Journal Paper

Paper Information

Journal:
Year:0 | Volume: | Issue:
Start Page: | End Page:

video

sound

Persian Version

View:

16,067

Download:

9,153

Cites:

Information Journal Paper

Title

SEARCH BASED WEIGHTED MULTI-BIT FLIPPING ALGORITHM FOR HIGH-PERFORMANCE LOW-COMPLEXITY DECODING OF LDPC CODES

Pages

 Start Page 85 | End Page 100

Keywords

BELIEF PROPAGATION (BP) 
LOW-DENSITY PARITY-CHECK (LDPC) CODES 

Abstract

 In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SBWMBF). The m ain idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algorithms do multi-dimensional searching between all possible bit position (s) that could flip in each iteration to select the best choices. It goes without saying that each iterative decoding algorithm provides a distinct trade-off between complexity and performance. SBWMBF algorithm can flip several bits in each iteration. This ability causes a faster convergence rate and less hardware complexity compared to the other hybrid decoding algorithms. Then, in order to simplicity and reduction in run time of original version, we have proposed a simplified form. Simulation results, when compared to other known decoding algorithms, illustrate that two proposed algorithms are highly efficient. They converge significantly faster and have a tangible reduction in iteration number and computational complexity. Also the presented algorithms have superior performance but with little performance penalty than the robust BP algorithm.

Cites

  • No record.

    • References

  • No record.

    • Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops