TY - JOUR
T1 - Ergodic fading interference channels
T2 - Sum-capacity and separability
AU - Sankar, Lalitha
AU - Shang, Xiaohu
AU - Erkip, Elza
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received June 03, 2009; revised December 09, 2010; accepted January 03, 2011. Date of current version April 20, 2011. This work was performed in part when E. Erkip was visiting Princeton University. This work was supported in part by the National Science Foundation under Grants CNS-09-05398 and CCF-06-35177 and in part by a fellowship from the Princeton University Council on Science and Technology. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008, and in part at the 46th Annual Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 2008.
PY - 2011/5
Y1 - 2011/5
N2 - 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.
AB - 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.
KW - Compound multiple access channel
KW - ergodic capacity
KW - ergodic fading
KW - interference channel
KW - polymatroids
KW - separability
KW - strong and weak interference
UR - http://www.scopus.com/inward/record.url?scp=79955513503&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955513503&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2119270
DO - 10.1109/TIT.2011.2119270
M3 - Article
AN - SCOPUS:79955513503
SN - 0018-9448
VL - 57
SP - 2605
EP - 2626
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 5
M1 - 5752443
ER -