2014
DOI: 10.48550/arxiv.1401.2592
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On the Optimality of Treating Interference as Noise: General Message Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…Remark 2: A similar result is proved for the K × K XC in [18], where they show that under certain channel conditions, strategy M1, i.e., treating interference as noise at the receivers is sum generalized degrees-of-freedom (GDoF) optimal and also achieves a constant gap to the sum-rate capacity. This result can be specialized to the many-to-one XC, and after some manipulations, the channel conditions in [18,Theorem 2] essentially boil down to sub-region (39), where it is shown that the gap from the sum-rate capacity is within K 2 log 2 K(K + 1) bits. Note that the gap from the sum-rate capacity is larger than that in Theorem 6, owing to the fact that the bounding techniques as well as the results in [18] are applicable to the general fully connected K × K XC.…”
Section: Bmentioning
confidence: 55%
See 2 more Smart Citations
“…Remark 2: A similar result is proved for the K × K XC in [18], where they show that under certain channel conditions, strategy M1, i.e., treating interference as noise at the receivers is sum generalized degrees-of-freedom (GDoF) optimal and also achieves a constant gap to the sum-rate capacity. This result can be specialized to the many-to-one XC, and after some manipulations, the channel conditions in [18,Theorem 2] essentially boil down to sub-region (39), where it is shown that the gap from the sum-rate capacity is within K 2 log 2 K(K + 1) bits. Note that the gap from the sum-rate capacity is larger than that in Theorem 6, owing to the fact that the bounding techniques as well as the results in [18] are applicable to the general fully connected K × K XC.…”
Section: Bmentioning
confidence: 55%
“…This result can be specialized to the many-to-one XC, and after some manipulations, the channel conditions in [18,Theorem 2] essentially boil down to sub-region (39), where it is shown that the gap from the sum-rate capacity is within K 2 log 2 K(K + 1) bits. Note that the gap from the sum-rate capacity is larger than that in Theorem 6, owing to the fact that the bounding techniques as well as the results in [18] are applicable to the general fully connected K × K XC.…”
Section: Bmentioning
confidence: 95%
See 1 more Smart Citation
“…Note that for general compound interference channels, P φ (i.e., the polyhedral TIN region for the case in which all the users are active) is the same as the polyhedral TIN region P defined in Section 2.1, i.e., P = P φ . When ( 20) is satisfied, the polyhedral TIN region P φ subsumes all the others and P * = P. Remark 3 It is also not hard to extend the result of Theorem 1 to the sum-GDoF optimality of TIN for M ×N compound X channels following [36]. In addition, based on the bounding techniques provided in [10,36], it is easy to prove that under the same condition (20), power control and TIN is sufficient to achieve a constant gap to the capacity region of the K-user compound interference channel, and the constant gap result can also be generalized to compound X channels in terms of the sum capacity.…”
Section: Potential Graphmentioning
confidence: 99%
“…6(c), where there are 4 messages totally. According to Remark 3, following [36], we know that even if the message set is increased, the sum-GDoF of this compound X channel remains as 1, which is apparently achievable by setting W 12 = W 21 = φ, sending only {W 11 , W 22 } through the channel with appropriate power levels and treating interference as noise at each receiver.…”
Section: Potential Graphmentioning
confidence: 99%