Reliability-Based Iterative Decoding Algorithm for LDPC Codes With Low Variable-Node Degree

In this letter, a new reliability-based iterative majority-logic decoding (RBI-MLGD) algorithm that computes the extrinsic information of previous iterations of the variable node is proposed. This decoding algorithm is called historical-extrinsic reliability-based iterative decoder (HE-RBID) and imp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 18; číslo 12; s. 2065 - 2068
Hlavní autori: Catala-Perez, J. M., Garcia-Herrero, F., Valls, J., Liu, K., Lin, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2014
Predmet:
Bit error rate
bit-flipping
Complexity theory
Decoding
Degradation
HE-RBID
Iterative decoding
LDPC codes
Parity check codes
historical-extrinsic reliability-based iterative decoder (HE-RBID)
Low-density Parity-Check (LDPC) codes
decoding
bit-flipping
ISSN:1089-7798
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this letter, a new reliability-based iterative majority-logic decoding (RBI-MLGD) algorithm that computes the extrinsic information of previous iterations of the variable node is proposed. This decoding algorithm is called historical-extrinsic reliability-based iterative decoder (HE-RBID) and improves the bit-error-rate performance of the previous RBI-MLGD. HE-RBID is particularly interesting for codes with a low degree of variable node, where traditional RBI-MLGD algorithms do not provide a good behavior. HE-RBID ensures a good performance without searching for the minimum at the check node and only by exchanging 1-bit messages between variable and check nodes.
ISSN:1089-7798
DOI:10.1109/LCOMM.2014.2363112