TY - JOUR
T1 - Joint source and channel coding
AU - Fresia, Maria
AU - Pérez-Cruz, Fernando
AU - Poor, H. Vincent
AU - Verdu, Sergio
N1 - Funding Information:
This work was partially supported by National Science Foundation under grants CNS-09-05398, NCR-0074277 CCR-0312879, CCF-0728445, and CCF-0635154. This work was also partially funded by the Spanish Government (Ministerio de Educación y Ciencia TEC2009-14504-C02-01, Consolider-Ingenio 2010 CSD2008-00010). F. Pérez-Cruz was supported by Marie Curie Fellowship 040883-AI-COM.
PY - 2010/11
Y1 - 2010/11
N2 - The objectives of this article are two-fold: First, to present the problem of joint source and channel (JSC) coding from a graphical model perspective and second, to propose a structure that uses a new graphical model for jointly encoding and decoding a redundant source. In the first part of the article, relevant contributions to JSC coding, ranging from the Slepian-Wolf problem to joint decoding of variable length codes with state-of-the-art source codes, are reviewed and summarized. In the second part, a double low-density parity-check (LDPC) code for JSC coding is proposed. The double LDPC code can be decoded as a single bipartite graph using standard belief propagation (BP) and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.
AB - The objectives of this article are two-fold: First, to present the problem of joint source and channel (JSC) coding from a graphical model perspective and second, to propose a structure that uses a new graphical model for jointly encoding and decoding a redundant source. In the first part of the article, relevant contributions to JSC coding, ranging from the Slepian-Wolf problem to joint decoding of variable length codes with state-of-the-art source codes, are reviewed and summarized. In the second part, a double low-density parity-check (LDPC) code for JSC coding is proposed. The double LDPC code can be decoded as a single bipartite graph using standard belief propagation (BP) and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.
UR - http://www.scopus.com/inward/record.url?scp=85032752130&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032752130&partnerID=8YFLogxK
U2 - 10.1109/MSP.2010.938080
DO - 10.1109/MSP.2010.938080
M3 - Article
AN - SCOPUS:85032752130
SN - 1053-5888
VL - 27
SP - 104
EP - 113
JO - IEEE Signal Processing Magazine
JF - IEEE Signal Processing Magazine
IS - 6
M1 - 5563107
ER -