A study of channel-matched iterative decoding algorithm
碩士 === 國立交通大學 === 電信工程系所 === 95 === Due to complexity and delay limit of source encoder, there exits source residual redundancy in digital communication. In order to enhance the system robustness, we proceed with iterative source-channel decoding based on a turbo principal at the receiver. The basi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/gdhfh2 |
| Summary: | 碩士 === 國立交通大學 === 電信工程系所 === 95 === Due to complexity and delay limit of source encoder, there exits source residual redundancy in digital communication. In order to enhance the system robustness, we proceed with iterative source-channel decoding based on a turbo principal at the receiver. The basic strategy is to exchange extrinsic information can be between the channel decoder and source decoder. Real channel are characterized by error burst due to the combined effects of intersymbol interference and multipath fading. It is therefore believed that further enhancement can be realized through a more precise characterization of the channel on which the iterative decoder design is based. Simulation results indicate that channel-matched iterative decoding based on convolutional code achieves the highest robustness against channel errors.
|
|---|