Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes

This paper presents two novel iterative reliability-based majority-logic algorithms for decoding LDPC codes. Both algorithms are binary message-passing algorithms and require only logical operations and integer additions. Consequently, they can be implemented with simple combinational logic circuits...

Full description

Saved in:
Bibliographic Details
Published in:2009 IEEE Information Theory Workshop pp. 253 - 257
Main Authors: Qin Huang, Jingyu Kang, Li Zhang, Shu Lin, Abdel-Ghaffar, K.
Format: Conference Proceeding
Language:English
Published: IEEE 01.01.2009
Subjects:
Combinational circuits
Conferences
Convergence
Information theory
Iterative algorithms
Iterative decoding
Null space
Parity check codes
Reliability theory
USA Councils
ISBN:9781424449828, 1424449820
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents two novel iterative reliability-based majority-logic algorithms for decoding LDPC codes. Both algorithms are binary message-passing algorithms and require only logical operations and integer additions. Consequently, they can be implemented with simple combinational logic circuits. They either outperform or perform just well as the existing weighted bit-flipping or other reliability-based decoding algorithms for LDPC codes in error performance with a faster rate of decoding convergence and less decoding complexity. Compared to the sum-product algorithm for LDPC codes, they offer effective trade-offs between performance and decoding complexity.
ISBN:9781424449828
1424449820
DOI:10.1109/ITW.2009.5351264