Multiple-Access Relay Channels with Non-Causal Side Information at the Relay

被引:0
作者
Osmani-Bojd, Mohammad [1 ]
Sahebalam, Assadallah [1 ]
Hodtani, Ghosheh Abed [1 ]
机构
[1] Ferdowsi Univ Mashhad, Commun & Comp Res Ctr, Mashhad, Iran
来源
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2013年
关键词
Multiple-access relay channel; Non-causal side information; decode and forward strategy; CAPACITY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we derive an inner bound for two-user state-dependent multiple-access relay channel (MARC) via decode and forward strategy (DF) in which the states of channel are known non-causally at the relay. The inner bound is obtained by using a combination of binning scheme and codeword splitting. Codeword splitting at the relay is applied to generating two codebooks, one for utilizing a joint codebook between the relay and the transmitters and another for utilizing the channel state information. Furthermore, we obtain an outer bound for this model. Actually, our work is a generalization of Zaidi et al. work on the relay channel with informed relay to the MARC.
引用
收藏
页码:2636 / +
页数:2
相关论文
共 22 条
[1]  
Ahlswede R., 1971, Proc. IEEE ISIT'71, P23
[2]  
[Anonymous], 2006, Elements of Information Theory
[3]  
[Anonymous], P INT ZUR SEM COMM I
[4]  
[Anonymous], 1972, THESIS
[5]  
Bross S. I., 2010, 2010 IEEE 26th Convention of Electrical & Electronics Engineers in Israel (IEEEI 2010), P665, DOI 10.1109/EEEI.2010.5662131
[6]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[7]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[8]  
Gel'fand S. I., 1980, Problems of Control and Information Theory, V9, P19
[9]   ON THE CAPACITY OF COMPUTER MEMORY WITH DEFECTS [J].
HEEGARD, C ;
ELGAMAL, AA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) :731-739
[10]   Capacity with causal and noncausal side information: A unified view [J].
Jafar, Syed .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5468-5474