Ergodic Fading Interference Channels: Sum-Capacity and Separability

被引:32
作者
Sankar, Lalitha [1 ]
Shang, Xiaohu [1 ,2 ]
Erkip, Elza [3 ]
Poor, H. Vincent [1 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Alcatel Lucent, Bell Labs, Holmdel, NJ 07733 USA
[3] NYU, Polytech Inst, Dept Elect & Comp Engn, Brooklyn, NY 11201 USA
基金
美国国家科学基金会;
关键词
Compound multiple access channel; ergodic capacity; ergodic fading; interference channel; polymatroids; separability; strong and weak interference; GAUSSIAN INTERFERENCE; REGION; BOUNDS;
D O I
10.1109/TIT.2011.2119270
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.
引用
收藏
页码:2605 / 2626
页数:22
相关论文
共 37 条
[11]  
Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed
[12]   Gaussian Interference Channel Capacity to Within One Bit [J].
Etkin, Raul H. ;
Tse, David N. C. ;
Wang, Hua .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (12) :5534-5562
[13]   Capacity of fading channels with channel side information [J].
Goldsmith, AJ ;
Varaiya, PP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) :1986-1992
[14]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49
[15]  
JAFAR S, 2009, 09020838 ARXIVORG
[16]  
Jindal N, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P215
[17]   Achieving the capacity region boundary of fading CDMA channels via generalized iterative waterfilling [J].
Kaya, Onur ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2006, 5 (11) :3215-3223
[18]  
KNOPP R, 1995, ICC '95 - 1995 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3, P331, DOI 10.1109/ICC.1995.525188
[19]   Outer bounds on the capacity of Gaussian interference channels [J].
Kramer, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (03) :581-586
[20]   Capacity Bounds for the Gaussian Interference Channel [J].
Motahari, Abolfazl Seyed ;
Khandani, Amir Keyvan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) :620-643