Show simple item record

dc.contributor.authorSankaranarayanan, S.
dc.contributor.authorVasic, B.
dc.date.accessioned2020-08-01T01:07:26Z
dc.date.available2020-08-01T01:07:26Z
dc.date.issued2005-08-22
dc.identifier.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.en_US
dc.identifier.issn0018-9448
dc.identifier.doi10.1109/tit.2005.853321
dc.identifier.urihttp://hdl.handle.net/10150/641975
dc.description.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.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rightsCopyright © 2005 IEEEen_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subjectauxiliary checksen_US
dc.subjectauxiliary variablesen_US
dc.subjectbelief-propagation algorithmen_US
dc.subjectfour-cyclesen_US
dc.subjectTanner graphs (TGs)en_US
dc.titleIterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approachen_US
dc.typeArticleen_US
dc.contributor.departmentUniv Arizona, Dept Elect & Comp Engnen_US
dc.identifier.journalIEEE Transactions on Information Theoryen_US
dc.description.collectioninformationThis 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 repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US
dc.source.journaltitleIEEE Transactions on Information Theory
dc.source.volume51
dc.source.issue9
dc.source.beginpage3347
dc.source.endpage3353
refterms.dateFOA2020-08-01T01:07:28Z


Files in this item

Thumbnail
Name:
Iterative Decoding of Linear ...
Size:
502.1Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record