Abstract
In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.
Original language | English |
---|---|
Pages (from-to) | 313-315 |
Number of pages | 3 |
Journal | IEEE Communications Letters |
Volume | 12 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2008 |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering