2015
DOI: 10.1109/tit.2014.2365771
|View full text |Cite
|
Sign up to set email alerts
|

An Alternative to Decoding Interference or Treating Interference as Gaussian Noise

Abstract: This paper addresses the following question regarding Gaussian networks: Is there an alternative to decoding interference or treating interference as Gaussian noise? To state our result, we study a decentralized network of one primary user (PU) and one secondary user (SU) modeled by a two-user Gaussian interference channel. In one scenario, the primary transmitter is constellation-based and PUs codebook is constructed over its modulation signal set. Assuming SU is aware of the constellation points of PU, the i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
16
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(16 citation statements)
references
References 20 publications
0
16
0
Order By: Relevance
“…Another reason is that discrete inputs often outperform Gaussian inputs in competitive multi-user scenarios, such as the interference channel, as will be demonstrated in Section 7. For other examples of discrete inputs being useful in multi-user settings, the interested readers is referred to [43][44][45][46].…”
Section: Generalized Ozarow-wyner Boundmentioning
confidence: 99%
See 3 more Smart Citations
“…Another reason is that discrete inputs often outperform Gaussian inputs in competitive multi-user scenarios, such as the interference channel, as will be demonstrated in Section 7. For other examples of discrete inputs being useful in multi-user settings, the interested readers is referred to [43][44][45][46].…”
Section: Generalized Ozarow-wyner Boundmentioning
confidence: 99%
“…An open question, for n = 1, is what value of p provide the smallest gap and whether it coincides with the ultimate "shaping loss". For the AWGN channel there exist a number of other bounds that use discrete inputs as well (see [46,[56][57][58] and references therein). The advantage of using Ozarow-Wyner type bounds, however, lies in their simplicity as they only depend on the number of signal constellation points and the minimum distance of the constellation.…”
Section: Theorem 4 (Generalized Ozarow-wyner Boundmentioning
confidence: 99%
See 2 more Smart Citations
“…(a) For t = 1, 2, ..., n, compute the values of P(y 1,t |y t−1 1 ) and α t (s t ) recursively according to Equations (19) and (20).…”
mentioning
confidence: 99%