On the sum-capacity with successive decoding in interference channels. Zhao, Y., Tan, C., Avestimehr, A., Diggavi, S., & Pottie, G. In Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, pages 1494-1498, July, 2011. doi abstract bibtex In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we show that the constrained sum-capacity oscillates as a function of the cross link gain parameters between the information theoretic sum-capacity and the sum-capacity with interference treated as noise. Furthermore, we show that if the number of messages of either user is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise. We translate the optimal schemes in the deterministic channel model to the Gaussian channel model, and also derive two upper bounds on the constrained sum-capacity. Numerical evaluations show that the constrained sum-capacity in the Gaussian channels oscillates between the sum-capacity with Gaussian Han-Kobayashi schemes and that with single message schemes.
@inproceedings{6033790,
abstract = {In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we show that the constrained sum-capacity oscillates as a function of the cross link gain parameters between the information theoretic sum-capacity and the sum-capacity with interference treated as noise. Furthermore, we show that if the number of messages of either user is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise. We translate the optimal schemes in the deterministic channel model to the Gaussian channel model, and also derive two upper bounds on the constrained sum-capacity. Numerical evaluations show that the constrained sum-capacity in the Gaussian channels oscillates between the sum-capacity with Gaussian Han-Kobayashi schemes and that with single message schemes.},
author = {Yue Zhao and Chee-wei Tan and Avestimehr, AS. and Diggavi, S.N. and Pottie, G.J.},
booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},
doi = {10.1109/ISIT.2011.6033790},
file = {:papers:suc_dec_ic_isit.pdf},
issn = {2157-8095},
month = {July},
pages = {1494-1498},
tags = {conf,WiIntMgmt,IT,WiNet},
title = {On the sum-capacity with successive decoding in interference channels},
type = {4},
year = {2011}
}
Downloads: 0
{"_id":"5SCp349gZ5N5kdHqf","bibbaseid":"zhao-tan-avestimehr-diggavi-pottie-onthesumcapacitywithsuccessivedecodingininterferencechannels-2011","author_short":["Zhao, Y.","Tan, C.","Avestimehr, A.","Diggavi, S.","Pottie, G."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we show that the constrained sum-capacity oscillates as a function of the cross link gain parameters between the information theoretic sum-capacity and the sum-capacity with interference treated as noise. Furthermore, we show that if the number of messages of either user is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise. We translate the optimal schemes in the deterministic channel model to the Gaussian channel model, and also derive two upper bounds on the constrained sum-capacity. Numerical evaluations show that the constrained sum-capacity in the Gaussian channels oscillates between the sum-capacity with Gaussian Han-Kobayashi schemes and that with single message schemes.","author":[{"firstnames":["Yue"],"propositions":[],"lastnames":["Zhao"],"suffixes":[]},{"firstnames":["Chee-wei"],"propositions":[],"lastnames":["Tan"],"suffixes":[]},{"propositions":[],"lastnames":["Avestimehr"],"firstnames":["AS."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S.N."],"suffixes":[]},{"propositions":[],"lastnames":["Pottie"],"firstnames":["G.J."],"suffixes":[]}],"booktitle":"Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on","doi":"10.1109/ISIT.2011.6033790","file":":papers:suc_dec_ic_isit.pdf","issn":"2157-8095","month":"July","pages":"1494-1498","tags":"conf,WiIntMgmt,IT,WiNet","title":"On the sum-capacity with successive decoding in interference channels","year":"2011","bibtex":"@inproceedings{6033790,\n abstract = {In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we show that the constrained sum-capacity oscillates as a function of the cross link gain parameters between the information theoretic sum-capacity and the sum-capacity with interference treated as noise. Furthermore, we show that if the number of messages of either user is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise. We translate the optimal schemes in the deterministic channel model to the Gaussian channel model, and also derive two upper bounds on the constrained sum-capacity. Numerical evaluations show that the constrained sum-capacity in the Gaussian channels oscillates between the sum-capacity with Gaussian Han-Kobayashi schemes and that with single message schemes.},\n author = {Yue Zhao and Chee-wei Tan and Avestimehr, AS. and Diggavi, S.N. and Pottie, G.J.},\n booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},\n doi = {10.1109/ISIT.2011.6033790},\n file = {:papers:suc_dec_ic_isit.pdf},\n issn = {2157-8095},\n month = {July},\n pages = {1494-1498},\n tags = {conf,WiIntMgmt,IT,WiNet},\n title = {On the sum-capacity with successive decoding in interference channels},\n type = {4},\n year = {2011}\n}\n\n","author_short":["Zhao, Y.","Tan, C.","Avestimehr, A.","Diggavi, S.","Pottie, G."],"key":"6033790","id":"6033790","bibbaseid":"zhao-tan-avestimehr-diggavi-pottie-onthesumcapacitywithsuccessivedecodingininterferencechannels-2011","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["xJuTMZ3nEiMJi5Y9f","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["sum","capacity","successive","decoding","interference","channels","zhao","tan","avestimehr","diggavi","pottie"],"title":"On the sum-capacity with successive decoding in interference channels","year":2011}