The worst-case interference in DSL systems employing dynamic spectrum management
EURASIP Journal on Applied Signal Processing
Capacity of cognitive interference channels with and without secrecy
IEEE Transactions on Information Theory
Capacity bounds for the Gaussian interference channel
IEEE Transactions on Information Theory
A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Bounds and capacity results for the cognitive Z-interference channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
New sum-rate upper bound for the two-user Gaussian interference channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the achievable diversity-multiplexing tradeoff in interference channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On the degrees-of-freedom of the K -user Gaussian interference channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
IEEE Transactions on Information Theory
Capacity regions and bounds for a class of Z-interference channels
IEEE Transactions on Information Theory
An achievable rate region for the Gaussian Z-interference channel with conferencing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Interference channel capacity region for randomized fixed-composition codes
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A two-stage precoding method based on interference alignment for interference channel systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An iterative precoder optimization method for K-user interference channel systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Communicating correlated Gaussian sources over Gaussian Z interference channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Linear precoder designs for K-user interference channels
IEEE Transactions on Wireless Communications
Weighted sum rate maximization on two user Gaussian interference channels with rate splitting
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Rate enhancement for the Gaussian Z-interference channel with transmitter cooperation
IEEE Communications Letters
Capacity regions and sum-rate capacities of vector Gaussian interference channels
IEEE Transactions on Information Theory
Hi-index | 755.26 |
The complete characterization of the capacity region of a two-user Gaussian interference channel (IC) is still an open problem unless the interference is strong. In this work, we derive an achievable rate region for this channel. It includes the rate region which is achieved by time/frequency division multiplexing (TDM/ FDM), and it also includes the rate region which is obtained by time sharing between the two rate pairs where one of the transmitters sends its data reliably at the maximal possible rate (i.e., the maximum rate it can achieve in the absence of interference), and the other transmitter decreases its data rate to the point where both receivers can reliably decode its message. The suggested rate region is easily calculable, though it is a particular case of the celebrated achievable rate region of Han and Kobayashi whose calculation is, in general, prohibitively complex. In the high-power regime, a lower bound on the sum-capacity (i.e., the maximal achievable total rate) is derived, and we show its superiority over the maximal total rate which is achieved by the TDM/FDM approach with moderate interference. For degraded and one-sided Gaussian ICs, we rely on some observations of Costa and Sato, and obtain directly their sum-capacities. We conclude our discussion by pointing out two interesting open problems.