会议专题

A Hybrid Low Complexity Decoding of LDPC Codes

An efficient early stopping criterion based on the evolution of the number of reliable variable nodes (NRVN) is proposed for low density parity check (LDPC) codes in this paper. This criterion can significantly reduce the average number of iterations (ANI) at low to middle signal to noise ratios (SNRs) with minimal performance degradation. Furthermore, a hybrid decoding method is presented to reduce the decoding complexity of LDPC codes by combining the proposed stopping criterion and forced convergence (FC) decoding algorithm. Compared with the classic belief propagation (BP) decoding, significant computation complexity reduction can be achieved with small computation overhead.

ldpc codes iterative decoding reduced complexity decoding early stopping criterion

Hua Wang Guangrong Fan Jingming Kuang

School of Information and Electronics Beijing Institute of Technology Beijing, China

国际会议

2010 The IET 3rd International Conference on Wireless,Mobile & Multimedia Networks(第三届IET无线移动及多媒体网络国际会议 ICWMMN 2010)

北京

英文

108-112

2010-09-26(万方平台首次上网日期,不代表论文的发表时间)