Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach
AffiliationUniv Arizona, Dept Elect & Comp Engn
Tanner graphs (TGs)
MetadataShow full item record
CitationS. Sankaranarayanan and B. Vasic, "Iterative decoding of linear block codes: a parity-check orthogonalization approach," in IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3347-3353, Sept. 2005, doi: 10.1109/TIT.2005.853321.
RightsCopyright © 2005 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractIt is widely accepted that short cycles in Tanner graphs deteriorate the performance of message-passing algorithms. This discourages the use of these algorithms on Tanner graphs (TGs) of well-known algebraic codes such as Hamming codes, Bose-Chaudhuri-Hocquenghem codes, and Reed-Solomon codes. Yedidia et al. presented a method to generate code representations suitable for message-passing algorithms. This method does not guarantee a representation free of four-cycles. In this correspondence, we present an algorithm to convert an arbitrary linear block into a code with orthogonal parity-check equations. A combinatorial argument is used to prove that the algorithm guarantees a four-cycle free representation for any linear code. The effects of removing four-cycles on the performance of a belief propagation decoder for the binary erasure channel are studied in detail by analyzing the structures in different representations. Finally, we present bit-error rate (BER) and block-error rate (BLER) performance curves of linear block codes under belief propagation algorithms for the binary erasure channel and the additive white Gaussian noise (AWGN) channel in order to demonstrate the improvement in performance achieved with the help of the proposed algorithm.
VersionFinal accepted manuscript