Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a new kind of LDPC codes named IF-LDPC codes. Based on the properties of the method proved in this paper, we present a design of regular and quasi-regular IF-LDPC encoders which have linear encoding complexity, simple construction, low memory requirement and are suitable for partly parallel decoding. These advantages make them easy to hardware implementation. The IF-LDPC codes exhibit good performance in computer simulations and some even better than MacKay codes.
Design of Low-Complexity Well-Structured LDPC Codes Based on Iterative-Filled Approach
2008 Congress on Image and Signal Processing ; 2 ; 209-213
2008-05-01
671110 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Low-Complexity Concatenated LDPC-Staircase Codes
British Library Online Contents | 2018
|Corrections to “Low-Complexity Concatenated LDPC-Staircase Codes”
British Library Online Contents | 2019
Information Sciences - Bounded-Angle Iterative Decoding of LDPC Codes
Online Contents | 2009
Analysis of 5G LDPC Codes Rate-Matching Design
IEEE | 2018
|