On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels

Zhao, Yue; Tan, Chee Wei; Avestimehr, A. Salman; Diggavi, Suhas; Pottie, Gregory J.

doi:10.1109/tit.2012.2190040

Cited by 37 publications

(36 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, it would be valuable to determine, with this additional flexibility, how much gain one can obtain beyond TIN for general channel strength levels in a K-user interference channel. For the case of 2-user interference channels, this problem is studied in [13], and the regimes under which such schemes outperform TIN are identified. Also, for the case of K-user linear deterministic interference channels, the achievable rates of such schemes are characterized as the convex hull of the feasible rates supported by the independent sets of an extended conflict graph [14].…”

Section: Discussionmentioning

confidence: 99%

On the Optimality of Treating Interference as Noise

Geng

Naderializadeh

Avestimehr

et al. 2015

IEEE Trans. Inform. Theory

198

333

View full text Add to dashboard Cite

It is shown that in the K-user interference channel, if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all values in dB scale), then the simple scheme of using point to point Gaussian codebooks with appropriate power levels at each transmitter and treating interference as noise at every receiver (in short, TIN scheme) achieves all points in the capacity region to within a constant gap. The generalized degrees of freedom (GDoF) region under this condition is a polyhedron, which is shown to be fully achieved by the same scheme, without the need for time-sharing. The results are proved by first deriving a polyhedral relaxation of the GDoF region achieved by TIN, then providing a dual characterization of this polyhedral region via the use of potential functions, and finally proving the optimality of this region in the desired regime.

show abstract

Section: Discussionmentioning

confidence: 99%

On the Optimality of Treating Interference as Noise

Geng

Naderializadeh

Avestimehr

et al. 2015

IEEE Trans. Inform. Theory

198

333

View full text Add to dashboard Cite

show abstract

“…For the analysis in this section, the bounds in Theorem 1 and bounds on the sum-rate (see, e.g., [7], [10], [11], [21], [25] and [26]) are used to obtain upper and lower bounds on ∆.…”

Section: The Excess Rate For the Sum-rate Wrt The Corner Points Ofmentioning

confidence: 99%

“…5) From the asymptotic upper and lower bounds on ∆(P, a) for large P and a fixed a ∈ (0, 1) (see (26) and (38)), we have…”

Section: Remarkmentioning

confidence: 99%

On the corner points of the capacity region of a two-user Gaussian interference channel

Sason

2013

2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the other at the largest rate for which reliable communication is still possible are called corner points. This paper relies on existing outer bounds on the capacity region of a two-user GIC that are used to derive informative bounds on the corner points of the capacity region. The new bounds refer to a weak two-user GIC (i.e., when both cross-link gains in standard form are positive and below 1), and a refinement of these bounds is obtained for the case where the transmission rate of one user is within ε > 0 of the single-user capacity. The bounds on the corner points are asymptotically tight as the transmitted powers tend to infinity, and they are also useful for the case of moderate SNR and INR. Upper and lower bounds on the gap (denoted by ∆) between the sum-rate and the maximal achievable total rate at the two corner points are derived. This is followed by an asymptotic analysis analogous to the study of the generalized degrees of freedom (where the SNR and INR scalings are coupled such that log(INR) log(SNR) = α ≥ 0), leading to an asymptotic characterization of this gap which is exact for the whole range of α. The upper and lower bounds on ∆ are asymptotically tight in the sense that they achieve the exact asymptotic characterization. Improved bounds on ∆ are derived for finite SNR and INR, and their improved tightness is exemplified numerically.

show abstract

“…Therefore, whether RS and SSD can achieve the H-K inner bound remains a question. Y. Zhao in [23] studies the maximum achievable rate with SSD in the deterministic model for IC. However, the deterministic model only works in high SNR region.…”

Section: Introductionmentioning

confidence: 99%

Achievable Rates of Gaussian Interference Channel with Multi‐Layer Rate‐Splitting and Successive Simple Decoding

Fei

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The capacity bound of the Gaussian interference channel (IC) has received extensive research interests in recent years. Since the IC model consists of multiple transmitters and multiple receivers, its exact capacity region is generally unknown. One well-known capacity achieving method in IC is Han-Kobayashi (H-K) scheme, which applies two-layer rate-splitting (RS) and simultaneous decoding (SD) as the pivotal techniques and is proven to achieve the IC capacity region within 1 bit. However, the computational complexity of SD grows exponentially with the number of independent signal layers, which is not affordable in practice. To this end, we propose a scheme which employs multi-layer RS at the transmitters and successive simple decoding (SSD) at the receivers in the two-transmitter and two-receiver IC model and then study the achievable sum capacity of this scheme. Compared with the complicated SD, SSD regards interference as noise and thus has linear complexity. We first analyze the asymptotic achievable sum capacity of IC with equal-power multi-layer RS and SSD, where the number of layers approaches to infinity. Specifically, we derive the closed-form expression of the achievable sum capacity of the proposed scheme in symmetric IC, where the proposed scheme only suffers from a little capacity loss compared with SD. We then present the achievable sum capacity with finite-layer RS and SSD. We also derive the sufficient conditions where employing finite-layer RS may even achieve larger sum capacity than that with infinite-layer RS. Finally, numerical simulations are proposed to validate that multi-layer RS and SSD are not generally weaker than SD with respect to the achievable sum capacity, at least for some certain channel gain conditions of IC.

show abstract

On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels

Cited by 37 publications

References 17 publications

On the Optimality of Treating Interference as Noise

On the Optimality of Treating Interference as Noise

On the corner points of the capacity region of a two-user Gaussian interference channel

Achievable Rates of Gaussian Interference Channel with Multi‐Layer Rate‐Splitting and Successive Simple Decoding

Contact Info

Product

Resources

About