Improved random redundant iterative HDPC decoding
Dimnik, I.
Be'ery, Y.
Sch. of Electr. Eng., Tel Aviv Univ., Ramat Aviv, Israel;
This paper appears in: Communications, IEEE Transactions on
Publication Date: July 2009
Volume: 57,
Issue: 7
On page(s): 1982-1985
ISSN: 0090-6778
INSPEC Accession Number: 10781196
Digital Object Identifier: 10.1109/TCOMM.2009.07.070621
Current Version Published: 2009-07-17
Abstract
An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
