Dynamic Bubble-Check Algorithm for Check Node Processing in Q-Ary LDPC Decoders

Wei LIN  Baoming BAI  Xiao MA  Rong SUN  

Publication
IEICE TRANSACTIONS on Communications   Vol.E95-B   No.5   pp.1815-1818
Publication Date: 2012/05/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.1815
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
Keyword: 
q-ary low-density parity-check (LDPC) codes,  extended min-sum (EMS),  bubble-check,  

Full Text: PDF(254.4KB)>>
Buy this Article




Summary: 
A simplified algorithm for check node processing of extended min-sum (EMS) q-ary LDPC decoders is presented in this letter. Compared with the bubble check algorithm, the so-called dynamic bubble-check (DBC) algorithm aims to further reduce the computational complexity for the elementary check node (ECN) processing. By introducing two flag vectors in ECN processing, The DBC algorithm can use the minimum number of comparisons at each step. Simulation results show that, DBC algorithm uses significantly fewer comparison operations than the bubble check algorithm, and presents no performance loss compared with standard EMS algorithm on AWGN channels.