Result: Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation

Title:
Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation
Authors:
JIN MENG, YANG, En-Hui
Source:
IEEE transactions on information theory. 59(5):3068-3103
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2013.
Publication Year:
2013
Physical Description:
print, 34 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, Code correcteur erreur, Error correcting code, Código corrector error, Alphabet, Alfabeto, Approche crédibiliste, Credal approach, Enfoque credal, Borne supérieure, Upper bound, Cota superior, Canal binaire, Binary channel, Canal binario, Circuit sans perte, Lossless circuit, Circuito sin pérdida, Codage canal, Channel coding, Codage source, Source coding, Code binaire, Binary code, Código binario, Code contrôle parité, Parity check codes, Codec, Décodage, Decoding, Desciframiento, Entropie, Entropy, Entropía, Ergodicité, Ergodicity, Ergodicidad, Evaluation performance, Performance evaluation, Evaluación prestación, Probabilité erreur, Error probability, Probabilidad error, Signal binaire, Binary signal, Señal binaria, Signal source réparti, Distributed source signal, Señal fuente distribuida, Simulation, Simulación, Système conversationnel, Interactive system, Sistema interactivo, Taux erreur bit, Bit error rate, Tasa error bit, Phenomène de cross-over, Cross-over phenomenon, Belief propagation (BP) decoding, distributed source coding, entropy, interactive encoding and decoding (IED), low-density parity-check (LDPC) code, rateless Slepian-Wolf coding (SWC), syndrome accumulation (SA)
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=27317481
Rights:
Copyright 2014 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.27317481
Database:
PASCAL Archive

Further Information

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is GF(2), and the side information alphabet is finite. It is first demonstrated how to convert any classical universal lossless code Cn (with block length n and side information available to both the encoder and decoder) into a universal SA-LDPC-IED scheme. It is then shown that with the word error probability approaching 0 subexponentially with n, the compression rate (including both the forward and backward rates) of the resulting SA-LDPC-IED scheme is upper bounded by a functional of that of Cn, which in turn approaches the compression rate of Cn for each and every individual sequence pair (xn, yn) and the conditional entropy rate H(X|Y) for any stationary, ergodic source and side information (X,Y) as the average variable node degree l of the underlying LDPC code increases without bound. When applied to the class of binary source and side information (X,Y) correlated through a binary symmetrical channel with crossover probability unknown to both the encoder and decoder, the resulting SA-LDPC-IED scheme can be further simplified, yielding even improved rate performance versus the bit error probability when l is not large. Simulation results (coupled with linear time belief propagation decoding) on binary source-side information pairs confirm the theoretic analysis and further show that the SA-LDPC-IED scheme consistently outperforms the Slepian-Wolf coding scheme based on the same underlying LDPC code. As a by-product, probability bounds involving LDPC established in the course are also interesting on their own and expected to have implications on the performance of LDPC for channel coding as well.