Design of Non Binary Quasi-Cyclic LDPC Codes Based on RA Encoding
A method to construct non binary QC-LDPC codes is proposed based on RA encoding with reducing encoding complexity. It is just to compute parity check symbols according to check equations or parity check matrix, and it’s not necessary to apply a generator matrix to the encoder, which greatly reduced encoding complexity. Also, the quasi-cyclic structure of parity check matrix makes it possible to realize parallel decoding with very low complexity. Simulation results show that this class QC-LDPC codes without small loop outperforms random LDPC codes both in complexity and performance with middle length and it is very suitable for implementation.
Qingping Yu Zhiping Shi Bing Yan Zhongpei Zhang
National Key Lab of Communications University of Electronic Science and Technology.Chengdu, China National Key Lab of Communications University of Electronic Science and Technology.Chengdu, China 2N
国际会议
2009国际通信电路与系统学术会议(ICCCAS 2009)(2009 International Conference on Communications,Circuits and Systems)
成都
英文
112-115
2009-07-23(万方平台首次上网日期,不代表论文的发表时间)