An Improved Self Adaptive Min-Sum Decoding Algorithm for Flexible Low-Density Parity-Check Decoder
| Autor: | Ramesh Jayabalan, Michaelraj Kingston Roberts |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Berlekamp–Welch algorithm
Computer science 020208 electrical & electronic engineering List decoding 020206 networking & telecommunications Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Sequential decoding Belief propagation Coding gain 0202 electrical engineering electronic engineering information engineering Node (circuits) Low-density parity-check code Engineering (miscellaneous) Algorithm Decoding methods Computer Science::Information Theory |
| Zdroj: | National Academy Science Letters. 40:121-125 |
| ISSN: | 2250-1754 0250-541X |
| DOI: | 10.1007/s40009-016-0519-0 |
| Popis: | In this paper, an improved self adaptive min-sum decoding algorithm for flexible low-density parity-check (LDPC) code is proposed. In the proposed algorithm, new modifications are incorporated in both the check node and variable node update process to support the irregular LDPC codes. In the check node and variable node update process of the proposed algorithm, an improved min-sum approximation and down scaling factors are adopted. These modifications result in good error correcting performance without increasing the computational complexity. Through simulations the proposed decoding algorithm is shown to exhibit better decoding performance by achieving overall FER and BER coding gain improvement of 0.31 and 0.26 dB respectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink