A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codes

Keke Liu, Shu Lin, Khaled Abdel-Ghaffar · 2013

An effective reduced-complexity min-sum algorithm for decoding algebraic quasi-cyclic LDPC codes is presented. The proposed decoding algorithm significantly reduces the hardware implementation complexity, the size of memory required to store information, and the computational complexity of a decoder with no or a small loss in performance compared to the scaled min-sum algorithm.

Read the paper · More papers on PaperTik