Quasi-Cyclic LDPC Codes Based on the Improved Combining Method
YH Liu, ML Zhang, XL Niu - 2014 IEEE International …, 2014 - ieeexplore.ieee.org
YH Liu, ML Zhang, XL Niu
2014 IEEE International Conference on Computer and Information …, 2014•ieeexplore.ieee.orgAn improved combining method based on the Chinese Remainder Theorem is proposed for
constructing much better quasi-cyclic (QC) LDPC codes. By carefully permuting the block
columns of the parity check matrices of the component codes, a lot of QC-LDPC codes with
much less short cycles and better performance can be designed. Simulation results show
that at a BER of 10-6, the constructed QC-LDPC codes outperform those designed by the
existing combining methods by about 1.2 dB.
constructing much better quasi-cyclic (QC) LDPC codes. By carefully permuting the block
columns of the parity check matrices of the component codes, a lot of QC-LDPC codes with
much less short cycles and better performance can be designed. Simulation results show
that at a BER of 10-6, the constructed QC-LDPC codes outperform those designed by the
existing combining methods by about 1.2 dB.
An improved combining method based on the Chinese Remainder Theorem is proposed for constructing much better quasi-cyclic (QC) LDPC codes. By carefully permuting the block columns of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less short cycles and better performance can be designed. Simulation results show that at a BER of 10-6, the constructed QC-LDPC codes outperform those designed by the existing combining methods by about 1.2 dB.
ieeexplore.ieee.org
Showing the best result for this search. See all results