TY - GEN

T1 - On the sum capacity of K-user cascade Gaussian Z-interference channel

AU - Liu, Yuanpeng

AU - Erkip, Elza

N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - A K-user cascade Gaussian Z-interference channel is a subclass of the general K-user Gaussian interference channel, where each user, except the first one, experiences interference only from the previous user. Under simple Han-Kobayashi schemes assuming Gaussian inputs and no time sharing, it is shown that the maximum sum rate is achieved by each user transmitting either common or private signals. For K = 3, channel conditions under which the achieved sum rate is either equal to or within 0.5 bits to the sum capacity are identified.

AB - A K-user cascade Gaussian Z-interference channel is a subclass of the general K-user Gaussian interference channel, where each user, except the first one, experiences interference only from the previous user. Under simple Han-Kobayashi schemes assuming Gaussian inputs and no time sharing, it is shown that the maximum sum rate is achieved by each user transmitting either common or private signals. For K = 3, channel conditions under which the achieved sum rate is either equal to or within 0.5 bits to the sum capacity are identified.

UR - http://www.scopus.com/inward/record.url?scp=80054818744&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054818744&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6033765

DO - 10.1109/ISIT.2011.6033765

M3 - Conference contribution

AN - SCOPUS:80054818744

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1382

EP - 1386

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -