Non-sequential decoding algorithm for hard iterative turbo product codes - [transactions letters]
- 23 June 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (6) , 1545-1549
Abstract
In this letter, we propose a new decoding algorithm to improve the bit error rate performance of the hard-input hard-output (HIHO) turbo product codes (TPC) with hard iterative decoding. The proposed algorithm iteratively, but not sequentially, decodes the received TPC blocks based on the reliability of the constituent codes. Simulation results confirm a noticeable coding gain improvement using the proposed decoding process with respect to standard HIHO TPC decoding. An efficient implementation of the new technique offers a negligible additional complexity when the channel-bit error probability is less than 10 -2 .Keywords
This publication has 14 references indexed in Scilit:
- Recent progress in forward error correction and its interplay with transmission impairmentsIEEE Journal of Selected Topics in Quantum Electronics, 2006
- Essentials of Error‐Control Coding2006
- Turbo Code Applications2005
- Optical Communication Theory and Techniques2005
- Iterative Decoding With a Hamming Threshold for Block Turbo CodesIEEE Communications Letters, 2004
- New architecture for high data rate turbo decoding of product codes2004
- Soft decoding in optical systemsIEEE Transactions on Communications, 2003
- An efficient decoding algorithm for block turbo codesIEEE Transactions on Communications, 2001
- Near-optimum decoding of product codes: block turbo codesIEEE Transactions on Communications, 1998
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974