Result: Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Title:
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
Authors:
PFISTER, Henry D, SASON, Igal, URBANKE, Rüdiger
Source:
IEEE transactions on information theory. 51(7):2352-2379
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2005.
Publication Year:
2005
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, Canal binaire, Binary channel, Canal binario, Canal sans mémoire, Memoryless channel, Canal sin memoria, Capacité canal, Channel capacity, Capacidad canal, Codage canal, Channel coding, Code contrôle parité, Parity check codes, Décodage, Decoding, Desciframiento, Envoi message, Message passing, Evaluation performance, Performance evaluation, Evaluación prestación, Méthode itérative, Iterative method, Método iterativo, Distribution degré, Evolution densité, Graphe Tanner, Binary erasure channel (BEC), Tanner graph, codes on graphs, degree distribution (d.d.), density evolution (DE), irregular repeat-accumulate (IRA) codes, low-density parity-check (LDPC) codes, memoryless binary-input output-symmetric (MBIOS) channel, message-passing iterative (MPI) decoding, punctured bits, state nodes
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Qualcomm, Inc, San Diego, CA, United States
Department of Electrical Engineering, Technion-Israel Institute of Technology, Technion City, Haifa 32000, Israel
EPFL-Swiss Federal Institute of Technology, Lausanne, 1015, Switzerland
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16926208
Rights:
Copyright 2005 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.16926208
Database:
PASCAL Archive

Further Information

We present two sequences of ensembles of nonsystematic irregular repeat-accumulate (IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the inverse of the gap (in rate) to capacity. The new bounded complexity result is achieved by puncturing bits, and allowing in this way a sufficient number of state nodes in the Tanner graph representing the codes. We derive an information-theoretic lower bound on the decoding complexity of randomly punctured codes on graphs. The bound holds for every memoryless binary-input output-symmetric (MBIOS) channel and is refined for the binary erasure channel.