Reduced Complexity LDPC Decoding using Forced Convergence
Ernesto Zimmermann, Gerhard Paul Fettweis, Prakash Pattisapu et al. · 2004
Abstract — Low-density parity-check (LDPC) codes have recently emerged as a viable option for forward error correction (FEC) in future wireless communications systems. One factor influencing the decision of whether to use a specific FEC technique in a system is its suitability for real time systems – and hence, its computational complexity. In this paper, we present a novel LDPC decoding architecture, where we use a threshold rule to decide whether a variable node of the LDPC decoder should update its information in subsequent iterations of the decoding process, or be considered as converged. We show that by choosing this threshold appropriately, decoding complexity can be significantly reduced with only negligible deterioration in error correction performance. I.
Cited by 50 works.
Authors
References
- Low-density parity-check codes
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
- Near Shannon limit error-correcting coding and decoding : Turbo-codes
- Good error-correcting codes based on very sparse matrices
- Design of capacity-approaching irregular low-density parity-check codes
- A recursive approach to low complexity codes
- Near Shannon limit performance of low density paritycheck codes
- Turbo decoding as an instance of Pearl's "belief propagation" algorithm
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
- Efficient encoding of low-density parity-check codes