BIT DELETING DECODING ALGORITHM FOR FINITEGEOMETRY LDPC CODES
Based on Weighted Bit-Flipping decoding (WBF) algorithm, we present an efficient bit-deleting decoding algorithm. By deleting some code bits which are in a loop and related check bits, the decoder can converge quickly. Deleted bits are added when temporary convergence is achieved and final codes are found. Simulation results show that the bit-deleting decoding algorithm is only 0.4dB (BER) away from the performance of Sum Product Algorithm (SPA) with only a modest increase in computational complexity compare to other WBF algorithm.
belief propagation algorithm low density parity check (LDPC) codes bit-deleting decoding algorithm
Xin Chen Bo Yang Aidong Men
School of Telecommunication Engineering, BUPT, Beijing 100876, China
国际会议
北京
英文
1-4
2008-09-26(万方平台首次上网日期,不代表论文的发表时间)