Performance Analysis of Quasi-Cyclic Low Density Parity Check Codes

Low-Density Parity-Check codes are the class of linear block codes, which perform the near Shannon limit performance on data transmission. Here, Quasi Cyclic codes are circulant permutation matrices, for the efficient encoding purpose. In this paper, QC-LDPC Codes have significant performance improvement due to the effective iterative Min-Sum decoding algorithm in terms of Bit Error Rate (BER) versus Eb/No with low and high code rates compared to other existing codes. Soft decision decoding and increased number of iterations of QC-LDPC codes has better performance.