Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

@article{Lan2007ConstructionOQ,
  title={Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach},
  author={Lan Lan and Lingqi Zeng and Ying Yu Tai and Lei Chen and Shu Lin and Khaled A. S. Abdel-Ghaffar},
  journal={IEEE Transactions on Information Theory},
  year={2007},
  volume={53},
  pages={2429-2458}
}
In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by… 
Quasi-cyclic LDPC codes: an algebraic construction
TLDR
Two new large classes of QC-LDPC codes, one binary and one non-binary, are presented, which have potential to replace Reed-Solomon codes in some communication or storage systems where combinations of random and bursts of errors (or erasures) occur.
Constructions of high performance non-binary quasi-cyclic LDPC codes
TLDR
Algebraic methods for constructing high performance quasi-cyclic LDPC codes over non-binary fields have a great potential to replace Reed-Solomon codes for some applications in communication or storage systems for combating mixed types of noise and interferences.
Non-binary LDPC codes vs. Reed-Solomon codes
  • Bo Zhou, Li Zhang, M. Xu
  • Computer Science
    2008 Information Theory and Applications Workshop
  • 2008
TLDR
Comparison shows that well designed non-binary LDPC codes have a great potential to replace RS codes for some applications in communication or storage systems, at least before a very efficient algorithm for decoding RS codes is devised.
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
TLDR
A simple and very flexible method for constructing quasi-cyclic (QC) low density paritycheck (LDPC) codes based on finite fields and a reduced-complexity iterative decoding scheme based on the section-wise cyclic structure of their parity-check matrices is presented.
A novel QC-LDPC code based on the finite field multiplicative group for optical communications
TLDR
The simulation results show that the constructed QC-LDPC(5334,4962) code can gain better error correction performance under the condition of the additive white Gaussian noise (AWGN) channel with iterative decoding sum-product algorithm (SPA).
High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries
TLDR
Algebraic methods for constructing high performance and efficiently encodable non-binary quasi-cyclic LDPC codes based on flats of finite Euclidean geometries and array masking are presented.
A deterministic construction of irregular LDPC codes
TLDR
Theoretic analysis and experimental results show that, at a bit-error rate of 10×10−4, the new codes with lower encoding complexities outperform Mackay's random LDPC codes by 0.4–0.6 dB over an additive white Gauss noise (AWGN) channel.
Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields
TLDR
Two new algebraic constructions of high performance non- binary quasi-cyclic LDPC codes based on array dispersions of matrices over non-binary fields with potential to replace RS codes for some applications in communication and storage systems are presented.
High-Performance and Energy-Efficient Decoder Design for Non-Binary LDPC Codes
TLDR
Several techniques at the algorithm level as well as hardware architecture level are proposed in an attempt to bring NB-LDPC codes closer to practical deployment, and a proof-of-concept ASIC chip is realized that integrates many of the proposed techniques.
High-Rate Nonbinary Regular Quasi-Cyclic LDPC Codes for Optical Communications
TLDR
This paper state and prove a theorem that establishes a necessary and sufficient condition that an NB matrix over GF(q), constructed by assigning nonzero elements from GF( q) to the 1s in the parity-check matrix of a binary quasi-cyclic LDPC code, must satisfy in order for its null-space to define a nonbinary QC-LDPC (NB-QC- LDPC) code.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 52 REFERENCES
Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in
Low-density parity-check codes based on finite geometries: A rediscovery and new results
TLDR
Long extended finite-geometry LDPC codes have been constructed and they achieve a performance only a few tenths of a decibel away from the Shannon theoretical limit with iterative decoding.
Low-density parity-check codes over Gaussian channels with erasures
TLDR
This work considers low-density parity-check code (LDPCC) design for additive white Gaussian noise (AWGN) channels with erasures and derives a steady-state equation which gives a graphical interpretation of decoder convergence and a good LDPCC over an AWGN channel is also good over the mixed channel up to a moderate erasure probability.
Efficient encoding of low-density parity-check codes
TLDR
It is shown how to exploit the sparseness of the parity-check matrix to obtain efficient encoders and it is shown that "optimized" codes actually admit linear time encoding.
Design of LDPC codes for two-state fading channel models
  • M. Yang, W. E. Ryan
  • Computer Science
    The 5th International Symposium on Wireless Personal Multimedia Communications
  • 2002
TLDR
It is shown that optimal BuEC codeEnsembles are equal to optimal binary erasure channel (BEC) code ensembles and the design of LDPC codes for these channels is designed.
Combinatorial constructions of low-density parity-check codes for iterative decoding
This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are
The capacity of low-density parity-check codes under message-passing decoding
TLDR
The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.
Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel
TLDR
The LDPC codes are very robust against large noise bursts, and are superior to the RS schemes examined in the measurable error rate region, and the results provide motivation for further investigation in this area.
Efficient encoding of quasi-cyclic low-density parity-check codes
TLDR
It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of thecode for high-speed parallel encoding.
A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem
TLDR
By applying the method to array codes, this paper presents a family of high-rate regular QC-LDPC codes with no 4-cycles, and results show that they have almost the same performance as random regular LDPC codes.
...
1
2
3
4
5
...