On the capacity region of some classes of interference channels
Authors:
- 7 July 2024
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3136-3141
Abstract
In this paper, we establish a new outer bound to the capacity region of the Gaussian Z-interference channel and also characterize the capacity of two new classes of discrete memory less interference channels. The latter is achieved by proving the optimality of the Han-Kobayashi in-ner bound via traditional converse proofs. The former is done by utilizing an outer bound, generally not computable for discrete interference channels, to derive a new outer bound for Gaussian Z-interference channels, and its computability is deduced by showing Gaussian extremality. 1Keywords
This publication has 15 references indexed in Scilit:
- Sub-optimality of Han-Kobayashi achievable region for interference channels2015
- Network Information Theory2011
- A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference ChannelsIEEE Transactions on Information Theory, 2009
- Capacity Bounds for the Gaussian Interference ChannelIEEE Transactions on Information Theory, 2009
- Outer Bounds on the Capacity of Gaussian Interference ChannelsIEEE Transactions on Information Theory, 2004
- The capacity region of the discrete memoryless interference channel with strong interference (Corresp.)IEEE Transactions on Information Theory, 1987
- A new entropy power inequalityIEEE Transactions on Information Theory, 1985
- On the Gaussian interference channelIEEE Transactions on Information Theory, 1985
- The capacity region of a class of deterministic interference channels (Corresp.)IEEE Transactions on Information Theory, 1982
- The capacity of the Gaussian interference channel under strong interference (Corresp.)IEEE Transactions on Information Theory, 1981