Iterative Decoding vs. Viterbi Decoding: A Comarison
by Santosh Shah
17 Mar 2008
(Updated 18 Mar 2008)
rum .m file before running mdl file.
|
Watch this File
|
| File Information |
| Description |
Abstract- Decoding algorithms employed in wireless
communication use either hard decision decoding or soft decision
decoding. Quantization is use in soft decision e.g. in Viterbi
decoding. Similarly in iterative decoders (Turbo Codes) either
serially concatenated or parallely concatenated decoders with
interleavers use soft-input soft-output (SISO) and additive loglikelihood
version (L-SISO) algorithms, to compute a posteriori
probability (APP). Even though soft decision is more powerful
than hard decision decoders, many systems can not use soft
decision algorithms, e.g. in GSM. In GSM channel decoding is
used after de-interleaving. So, if one were to use iterative
decoding, one is constrained to hard decision decoders. We
propose the uses of soft decision iterative decoders (Turbo codes)
in place of hard decision data (i.e. data in binary format). We
compare the performance of hard decision Viterbi decoding with
iterative decoders. |
| Required Products |
Communications Blockset
DSP System Toolbox
Signal Processing Toolbox
|
| MATLAB release |
MATLAB 7.3 (R2006b)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (3) |
| 22 May 2008 |
Heri Firmansyah
|
|
|
| 17 Sep 2008 |
lila zinal
|
|
|
| 18 Mar 2010 |
Ashwini
|
|
|
|
Contact us at files@mathworks.com