An improved decoding algorithm for finite-geometry LDPC codes

In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2009-02, Vol.57 (2), p.302-306
Main Authors: Ngatched, Telex Magloire Nkouatchah, Takawira, Fambirai, Bossert, Martin
Format: Article
Language:English
Subjects:
Africa
Algorithm design and analysis
Algorithms
Applied sciences
Belief propagation algorithm
Bit error rate
bit-flipping (BF) decoding algorithms
Coding, codes
Complexity
Costs
Decoding
Delay
Exact sciences and technology
Geometry
Hardware
Information, signal and communications theory
Iterative decoding
low-density parity-check (LDPC) codes
Parity check codes
Performance enhancement
Reduction
Signal and communications theory
Sparse matrices
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2009.02.060352