An Improved Algorithm for Testing the Membership of Gaussian Multiple-Access Channel Capacity Region

被引:0
|
作者
Yan, Qifa [1 ]
Zheng, Lei [1 ]
Tang, Xiaohu [1 ]
Chen, Qingchun [1 ]
机构
[1] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China
关键词
Gaussian multiple-access channel; capacity region; membership testing;
D O I
10.1109/LCOMM.2016.2603150
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this letter, we investigate the problem of testing the membership of Gaussian multiple-access channel capacity region (GMACR), which involves 2(N) - 1 inequalities, where N is the number of senders. Given a fixed rate tuple and positive power constraint, we propose a simple but efficient algorithm to test the membership of the GMACR. It is unveiled that the algorithm can be accomplished in O(N log(2) N) operations, which is much more efficient than the approach by Zhang et al., whose complexity bound is larger than O(N-5).
引用
收藏
页码:2137 / 2140
页数:4
相关论文
共 50 条