• Results on the improved decodi...

Result: Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channel

Title:
Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channel
Authors:
VELLAMBI, Badri N, FEKRI, Faramarz
Source:
IEEE transactions on information theory. 53(4):1510-1520
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2007.
Publication Year:
2007
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Algorithme, Algorithm, Algoritmo, Borne inférieure, Lower bound, Cota inferior, Canal binaire, Binary channel, Canal binario, Code binaire, Binary code, Código binario, Code contrôle parité, Parity check codes, Code correcteur erreur, Error correcting code, Código corrector error, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Condition nécessaire suffisante, Necessary and sufficient condition, Condición necesaria suficiente, Contraction, Contracción, Décodage, Decoding, Desciframiento, Envoi message, Message passing, Méthode itérative, Iterative method, Método iterativo, Simulation, Simulación, Sous graphe, Subgraph, Subgrafo, Taux erreur bit, Bit error rate, Tasa error bit, Théorie graphe, Graph theory, Teoría grafo, Graphe de Tanner, Tanner graph, Connected component, depth-first search, graph contraction, improved decoding algorithm, induced subgraph, low-density parity- check (LDPC) codes, message passing decoder, valency
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0250, United States
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18621894
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.18621894
Database:
PASCAL Archive

Further Information

In this correspondence, we first investigate some analytical aspects of the recently proposed improved decoding algorithm for low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We derive a necessary and sufficient condition for the improved decoding algorithm to successfully complete decoding when the decoder is initialized to guess a predetermined number of guesses after the standard message-passing terminates at a stopping set. Furthermore, we present improved bounds on the number of bits to be guessed for successful completion of the decoding process when a stopping set is encountered. Under suitable conditions, we derive a lower bound on the number of iterations to be performed for complete decoding of the stopping set. We then present a superior, novel improved decoding algorithm for LDPC codes over the binary erasure channel (BEC). The proposed algorithm combines the observation that a considerable fraction of unsatisfied check nodes in the neighborhood of a stopping set are of degree two, and the concept of guessing bits to perform simple and intuitive graph-theoretic manipulations on the Tanner graph. The proposed decoding algorithm has a complexity similar to previous improved decoding algorithms. Finally, we present simulation results of short-length codes over BEC that demonstrate the superiority of our algorithm over previous improved decoding algorithms for a wide range of bit error rates.