Result: A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels

Title:
A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels
Authors:
SANDEEP PRADHAN, S, CHOI, Suhan, RAMCHANDRAN, Kannan
Source:
IEEE transactions on information theory. 53(12):4583-4604
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2007.
Publication Year:
2007
Physical Description:
print, 38 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, Accès multiple, Multiple access, Acceso múltiple, Canal multiple, Multiple channel, Canal múltiple, Canal multiutilisateur, Multiuser channels, Codage canal, Channel coding, Codage source canal, Joint source channel coding, Codificación fuente canal, Codage source, Source coding, Evaluation performance, Performance evaluation, Evaluación prestación, Graphe aléatoire, Random graph, Grafo aleatorio, Graphe biparti, Bipartite graph, Grafo bipartido, Signal source réparti, Distributed source signal, Señal fuente distribuida, Théorie information, Information theory, Teoría información, Discrete interface, distributed source coding, multiple-access channels, random graphs
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, United States
Samsung Electronics, Suwon, 443-742, Korea, Republic of
Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA 94720, United States
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19939185
Rights:
Copyright 2008 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.19939185
Database:
PASCAL Archive

Further Information

In this paper, we consider a graph-based framework for transmission of correlated sources over multiple-access channels. It is well known that the separation approach is not optimal for this multiuser communication. Our objective in this work is to reintroduce modularity in this problem using a graph-based discrete interface and to minimize the performance loss as compared to the optimal joint source-channel coding scheme. The proposed framework envisages a transmission systems with two modules: a source-coding module and a channel-coding module. In the former module, the correlated sources are encoded distributively into correlated messages whose correlation structure can be associated with a bipartite graph. These correlated messages are then encoded by using correlated codewords and are reliably transmitted over the multiple-access channel in the latter module. This leads to performance gains in terms of enlarging the class of correlated sources that can be reliably transmitted over a multiple-access channel as compared to the conventional separation approach. We provide an information-theoretic characterization of 1) the rate of exponential growth (as a function of the number of channel uses) of the size of the bipartite graphs whose edges can be reliably transmitted over a multiuser channel and 2) the rate of exponential growth (as a function of the number of source samples) of the size of the bipartite graphs which can reliably represent a pair of correlated sources to be transmitted over a multiuser channel.