1. Construction of regular quasi-cyclic LDPC codes based on cosets
- Author
-
Pengcheng Chen, Yuansheng Tang, Zhanghua Cao, and Tingsu Yan
- Subjects
Discrete mathematics ,Girth (graph theory) ,Prime (order theory) ,Combinatorics ,symbols.namesake ,Additive white Gaussian noise ,Construction method ,Bit error rate ,symbols ,Coset ,Low-density parity-check code ,Computer Science::Information Theory ,Communication channel ,Mathematics - Abstract
We propose a construction method for constructing quasi-cyclic low-density parity-check (QC LDPC) codes based on subgroup's coset. Our construction method is available not only for the prime circulants size, but also for the nonprime circulants size in some conditions. And it is showed that these conditions are easy to satisfy. Regular QC LDPC codes with various lengths and rates can be easily constructed with girth at least 6. Simulation results show that they are have almost the same performance as random regular LDPC codes over AWGN channel.
- Published
- 2009