Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
IEEE Communications Magazine
A design of parity check matrix for irregular LDPC codes
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Hi-index | 0.00 |
Quasi Cyclic Low Density Parity Check codes (QC-LDPC) is proposed to reduce the complexity of the Low Density Parity Check codes (LDPC) further while obtaining the similar performance. Our proposed QC-LDPC presents an improved construction of circulant sub-matrices based QC-LDPC at high SNR. The proposed construction yields a performance gain of about 1 dB at a 0.0003 bit error rate (BER). Proposed code is tested on 4 types of decoding algorithm and compared. Proposed algorithm is also compared with the existing QC-LDPC and the proposed approach outperforms the existing one at high SNR. Simulation is also performed varying the number of horizontal submatrix and the result shows that the parity check matrix with smaller horizontal concatenation shows better performance.