Techniques for polar coding over multiple access channels

Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
{"title":"Techniques for polar coding over multiple access channels","authors":"Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang","doi":"10.1109/CISS.2014.6814095","DOIUrl":null,"url":null,"abstract":"The problem of channel polarization and polar code construction for two-user multiple access channels is considered. The well-known method of time sharing is discussed first, where the underlying codes are point to point polar codes. We explain how to improve the performance in time sharing using the recently proposed compound polar codes. Then we propose a new scheme in which both users encode their messages using a polar encoder, while a joint successive cancellation decoder is used at the decoder. The polar codes for both users is constructed jointly by treating the whole polar transformation on both users as a single polar transformation, wherein the multiple access channel (MAC) is regarded as one more level of polarization. We prove that our scheme achieves the whole uniform rate region by changing the decoding order in the joint successive cancellation decoder, where the uniform rate region of a MAC is the set of achievable rates assuming that the input distributions are uniform. Some simulation results over binary-additive Gaussian noise MAC are provided. The proposed scheme is compared with the existing results on polar codes for multiple access channels to emphasize the differences and the main advantages of our scheme.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2014.6814095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The problem of channel polarization and polar code construction for two-user multiple access channels is considered. The well-known method of time sharing is discussed first, where the underlying codes are point to point polar codes. We explain how to improve the performance in time sharing using the recently proposed compound polar codes. Then we propose a new scheme in which both users encode their messages using a polar encoder, while a joint successive cancellation decoder is used at the decoder. The polar codes for both users is constructed jointly by treating the whole polar transformation on both users as a single polar transformation, wherein the multiple access channel (MAC) is regarded as one more level of polarization. We prove that our scheme achieves the whole uniform rate region by changing the decoding order in the joint successive cancellation decoder, where the uniform rate region of a MAC is the set of achievable rates assuming that the input distributions are uniform. Some simulation results over binary-additive Gaussian noise MAC are provided. The proposed scheme is compared with the existing results on polar codes for multiple access channels to emphasize the differences and the main advantages of our scheme.
多通道极化编码技术
研究了双用户多址信道的极化和极化码构造问题。首先讨论了众所周知的分时方法,其中底层代码是点对点极坐标代码。我们解释了如何使用最近提出的复合极性码来提高分时性能。然后,我们提出了一种新的方案,在该方案中,两个用户使用极性编码器对其消息进行编码,而在解码器中使用联合逐次取消解码器。通过将两个用户的整个极变换视为一个单极变换来共同构造两个用户的极码,其中将多址信道(MAC)视为多一级极化。我们证明了我们的方案通过改变联合连续对消解码器的解码顺序来实现整个均匀速率区域,其中MAC的均匀速率区域是假设输入分布均匀的可实现速率的集合。给出了在二元加性高斯噪声MAC上的一些仿真结果。将该方案与现有的多址极化码方案进行了比较,强调了该方案的不同之处和主要优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信