Coding for two-user Gaussian MAC with PSK and PAM signal sets

J. Harshan, B. Rajan
{"title":"Coding for two-user Gaussian MAC with PSK and PAM signal sets","authors":"J. Harshan, B. Rajan","doi":"10.1109/ISIT.2009.5205440","DOIUrl":null,"url":null,"abstract":"Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M-PSK and M-PAM alphabet pairs, for arbitrary values of M; to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"86 16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M-PSK and M-PAM alphabet pairs, for arbitrary values of M; to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.
基于PSK和PAM信号集的二用户高斯MAC编码
最近报道了双用户高斯多址信道(GMAC)的星座约束(CC)容量区域。针对这种信道,本文提出了基于格子编码调制的码对,采用M- psk和M- pam字母对,M为任意值;使总价接近GMAC的CC总价。特别地,利用M-PSK和M-PAM字母对的和字母结构来证明,对于字母之间的一定旋转角度,每个用户的格上的Ungerboeck标记最大化保证和格的平方欧氏距离。因此,这种标记方案可以系统地用于构建网格码对,以实现接近CC和容量的和率。更重要的是,它首次表明,当使用M-PAM字母表对时,目标的ML解码复杂性显着降低,而求和容量几乎没有损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信