Allerton 2015 Paper Abstract

Close

Paper ThD6.3

Haghi, Ali (University of Waterloo), Khandani, Amir K. (University of Waterloo)

Achievable Sum-Rate of the Two-User Gaussian Interference Channel through Rate-Splitting and Successive Decoding

Scheduled for presentation during the Regular Session "Information Theory IV" (ThD6), Thursday, October 1, 2015, 16:10−16:30, Vistior Center

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on November 19, 2019

Keywords Information Theory

Abstract

Most coding schemes, proposed for the interference channel, take advantage of joint decoding to achieve a larger rate region. However, joint decoding significantly increases decoding complexity. This paper investigates the achievable sum-rate of the two-user Gaussian interference channel when successive decoding is employed instead of joint decoding. First, this study proves that when interference is strong and the powers of the transmitters satisfy certain conditions, the sum-capacity can be achieved by successive decoding. The number of the required splits, the amount of power allocated to each split, and the order of decoding at receivers are explicitly determined. Moreover, the maximum sum-rate loss when simultaneous non-unique decoding is replaced by successive decoding is characterized. Second, it is proved that successive decoding achieves the sum-rate of simultaneous non-unique decoding, when interference is weak and the powers of the transmitters satisfy certain conditions. Rate-splitting is shown to be beneficial, if the powers of the transmitters are greater than a threshold. However, when the powers are below the threshold, still single-split successive decoding can achieve the sum-capacity.

 

 

All Content © PaperCept, Inc..


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-11-19  13:20:51 PST  Terms of use