Modified Decoding Algorithm for Linear Block Codes
碩士 === 國立臺北科技大學 === 電機工程系研究所 === 98 === In this thesis , we propose a modified decoding method for linesr block codes. For a linear block code, the maximum likelihood decoding can provide the best error performance, which can be obtained by applying the Viterbi algorithm in the decoding trellis. How...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86ga57 |
| Summary: | 碩士 === 國立臺北科技大學 === 電機工程系研究所 === 98 === In this thesis , we propose a modified decoding method for linesr block codes. For a linear block code, the maximum likelihood decoding can provide the best error performance, which can be obtained by applying the Viterbi algorithm in the decoding trellis. However, the decoding complexity of the trellis grows exponentially with the dimension of the code, which incurs a huge amount of computation. Therefore, a modified decoding algorithm is proposed to reduce the decoding complexity. Simulation results show that the error performance of the new method is close to that of the maximum likelihood decoding.
|
|---|