Results 1 
3 of
3
On Gaussian Interference Channels with Mixed Gaussian and Discrete Inputs
"... Abstract—This paper studies the sumrate of a class of memoryless, realvalued additive white Gaussian noise interference channels (IC) achievable by treating interference as noise (TIN). We develop and analytically characterize the rates achievable by a new strategy that uses superpositions of Gau ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—This paper studies the sumrate of a class of memoryless, realvalued additive white Gaussian noise interference channels (IC) achievable by treating interference as noise (TIN). We develop and analytically characterize the rates achievable by a new strategy that uses superpositions of Gaussian and discrete random variables as channel inputs. Surprisingly, we demonstrate that TIN is sumgeneralized degrees of freedom optimal and can achieve to within an additive gap of O(1) or O(log log(SNR)) to the symmetric sumcapacity of the classical IC. We also demonstrate connections to other channels such as the IC with partial codebook knowledge and the block asynchronous IC. I.
On the TwoUser Interference Channel With Lack of Knowledge of the Interference Codebook at One Receiver
"... Abstract — In multiuser information theory, it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad hoc, cognitive, or heterogeneous networks. This paper considers the twouser interference channel with one ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — In multiuser information theory, it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad hoc, cognitive, or heterogeneous networks. This paper considers the twouser interference channel with one oblivious receiver (ICOR), i.e., one receiver lacks knowledge of the interfering cookbook, whereas the other receiver knows both codebooks. This paper asks whether, and if so how much, the channel capacity of the ICOR is reduced compared with that of the classical IC where both receivers know all codebooks. A novel outer bound is derived and shown to be achievable to within a gap for the class of injective semideterministic ICORs; the gap is shown to be zero for injective fully deterministic ICORs. An exact capacity result is shown for the general memoryless ICOR when the nonoblivious receiver experiences very strong interference. For the linear deterministic ICOR that models the Gaussian noise channel at high SNR, nonindependent identically distributed. Bernoulli(1/2) input bits are shown to achieve points not achievable by i.i.d. Bernoulli(1/2) input bits used in the same achievability scheme. For the realvalued Gaussian ICOR, the gap is shown to be at most 1/2 bit per channel use, even though the set of optimal input distributions for the derived outer bound could not be determined. Toward understanding the Gaussian ICOR, an achievability strategy is evaluated in which the input alphabets at the nonoblivious transmitter are a mixture of discrete and Gaussian random variables, where the cardinality of the discrete part is appropriately chosen as a function of the channel parameters. Surprisingly, as the oblivious receiver intuitively should not be able to jointly decode the intended and interfering messages (whose codebook is unavailable), it is shown that with this choice of input, the capacity region of the symmetric Gaussian ICOR is to within 1/2 log (12πe) ≈ 3.34 bits (per channel use per user) of an outer bound for the classical Gaussian IC with full codebook knowledge at both receivers.
1On the Twouser Interference Channel with Partial Codebook Knowledge at one Receiver
"... In multiuser information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed adhoc, cognitive or heterogeneous networks. This work considers the twouser Interference Channel with one Oblivious Rec ..."
Abstract
 Add to MetaCart
In multiuser information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed adhoc, cognitive or heterogeneous networks. This work considers the twouser Interference Channel with one Oblivious Receiver (ICOR), i.e., one receiver lacks knowledge of the interfering codebook while the other receiver knows both codebooks. The paper asks whether, and if so how much, the channel capacity of the ICOR is reduced compared to that of the classical IC where both receivers know all codebooks. A novel outer bound is derived and shown to be achievable to within a constant gap for the class of injective semideterministic ICORs; the gap is shown to be zero for injective fully deterministic ICORs. An exact capacity result is shown for the general memoryless ICOR when the nonoblivious receiver experiences very strong interference. For the linear deterministic ICOR that models the Gaussian noise channel at high SNR, non i.i.d. Bernoulli(1/2) input bits are shown to achieve points not achievable by i.i.d. Bernoulli(1/2) input bits used in the same achievability same. For the realvalued Gaussian ICOR the gap is shown to be at most 1/2 bit per channel use, even though the set of optimal input distributions for the derived outer bound could not be determined. Towards understanding the Gaussian ICOR, an achievability strategy is evaluated in which the input alphabets at the nonoblivious transmitter are a mixture of discrete and Gaussian random variables, where the cardinality of the discrete part is appropriately chosen as a function of the channel parameters. Surprisingly, as the oblivious receiver