Soft decision decoding using the hierarchy of linear block codes
✍ Scribed by Tadahiro Sato; Hatsukazu Tanaka
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 151 KB
- Volume
- 83
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
✦ Synopsis
Soft decision decoding is a decoding method which can cut the decoding error probability as compared with hard decision decoding by utilizing the channel measurement information effectively. In this paper, a new soft decision decoding method by which decoding operations can be efficiently carried out by utilizing the hierarchy of linear block codes is proposed. In addition, an improved algorithm which can reduce significantly the maximum computational complexity is also proposed. The proposed decoding algorithm utilizing the hierarchical structure of codes is a decoding method by which decoding is carried out sequentially from codes with high coding rates or codes of higher hierarchy in the inclusion order, and soft decision decoding can be efficiently carried out by utilizing a number of classes of codes having inclusion relationships in a manner which is superior to Chase algorithm 2 in the decoding error probability and the computational complexity for decoding. Computer simulation results confirm that the proposed algorithm realizes decoding error probability characteristics close to those of the maximum likelihood decoding method and that decoding can be carried out efficiently at a lower computational complexity than Chase algorithm 2 when the SNR is large. In addition, the improved algorithm which can reduce significantly the maximum computational complexity can realize decoding error probability characteristics close to those of the maximum likelihood decoding method on practical communication channels with relatively large SNR.