Source-Channel Coding Theorems for the Multiple-Access Relay Channel

被引:14
作者
Murin, Yonathan [1 ]
Dabora, Ron [1 ]
Guenduez, Deniz [2 ]
机构
[1] Ben Gurion Univ Negev, Dept Elect & Comp Engn, IL-84105 Beer Sheva, Israel
[2] Univ London Imperial Coll Sci Technol & Med, Dept Elect & Elect Engn, London SW7 2AZ, England
关键词
Correlation preserving mapping (CPM); fading; joint source and channel coding; multiple-access relay channel (MARC); separation theorem; Slepian-Wolf (SW) source coding; INTERFERENCE CHANNELS; BROADCAST CHANNELS; CAPACITY THEOREMS; ERGODIC CAPACITY; SYSTEMS; TRANSMISSION; INFORMATION; REGION;
D O I
10.1109/TIT.2013.2260592
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources, while in MABRCs, both the relay and the destination want to reconstruct them. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination have side information correlated with the source signals. Our objective is to determine whether a given pair of sources can be losslessly transmitted to the destination for a given number of channel symbols per source sample, defined as the source-channel rate. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with Slepian-Wolf source coding are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, we present conditions under which separation (i.e., separate and stand-alone source and channel codes) is optimal. This is the first time optimality of separation is proved for MARCs and MABRCs.
引用
收藏
页码:5446 / 5465
页数:20
相关论文
共 45 条
[1]  
Abramowitz M., 1972, Handbook on Mathematical Functions with Formulas, Graphs, and Mathematical Tables
[2]   ON SOURCE-CODING WITH SIDE INFORMATION VIA A MULTIPLE-ACCESS CHANNEL AND RELATED PROBLEMS IN MULTI-USER INFORMATION-THEORY [J].
AHLSWEDE, R ;
HAN, TS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :396-412
[3]  
[Anonymous], 2011, Network information theory
[4]  
[Anonymous], 2011, ANN C INFORM SCI SYS
[5]  
[Anonymous], 2002, A first course in information theory
[6]  
[Anonymous], THESIS KATHOLIEKE U
[7]  
Cover T. M., 1999, Elements of information theory
[8]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[9]   MULTIPLE ACCESS CHANNELS WITH ARBITRARILY CORRELATED SOURCES [J].
COVER, TM ;
ELGAMAL, A ;
SALEHI, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (06) :648-657