On the Capacity-Achieving Scheme and Capacity of 1-Bit ADC Gaussian-Mixture Channels

Q2 Engineering
Md Hasan Rahman, M. Ranjbar, N. Tran
{"title":"On the Capacity-Achieving Scheme and Capacity of 1-Bit ADC Gaussian-Mixture Channels","authors":"Md Hasan Rahman, M. Ranjbar, N. Tran","doi":"10.4108/eai.31-1-2020.162830","DOIUrl":null,"url":null,"abstract":"This paper addresses the optimal signaling scheme and capacity of an additive Gaussian mixture (GM) noise channel using 1-bit analog-to-digital converters (ADCs). The consideration of GM noise provides a more realistic baseline for the analysis and design of co-channel interference links and networks. Towards that goal, we first show that the capacityachieving input signal is π/2 circularly symmetric. By examining a necessary and sufficient Kuhn–Tucker condition (KTC) for an input to be optimal, we demonstrate that the maximum number of optimal mass points is four. Our proof relies on Dubin’s theorem and the fact that the KTC coefficient is positive, i.e., the power constraint is active. By combining with the π/2 circularly symmetric property, it is then concluded the optimal input is unique, and it has exactly four mass points forming a square centered at the origin. By further checking the first and second derivatives of the modified KTC, it is then shown that the phase of the optimal mass point located in the first quadrant is π/4. Thus, the capacity-achieving input signal is QPSK. This result helps us obtain the channel capacity in closed-form.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"65 1","pages":"e4"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eai.31-1-2020.162830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 4

Abstract

This paper addresses the optimal signaling scheme and capacity of an additive Gaussian mixture (GM) noise channel using 1-bit analog-to-digital converters (ADCs). The consideration of GM noise provides a more realistic baseline for the analysis and design of co-channel interference links and networks. Towards that goal, we first show that the capacityachieving input signal is π/2 circularly symmetric. By examining a necessary and sufficient Kuhn–Tucker condition (KTC) for an input to be optimal, we demonstrate that the maximum number of optimal mass points is four. Our proof relies on Dubin’s theorem and the fact that the KTC coefficient is positive, i.e., the power constraint is active. By combining with the π/2 circularly symmetric property, it is then concluded the optimal input is unique, and it has exactly four mass points forming a square centered at the origin. By further checking the first and second derivatives of the modified KTC, it is then shown that the phase of the optimal mass point located in the first quadrant is π/4. Thus, the capacity-achieving input signal is QPSK. This result helps us obtain the channel capacity in closed-form.
1位ADC高斯混合信道容量实现方案及容量研究
本文讨论了使用1位模数转换器(adc)的加性高斯混合(GM)噪声信道的最佳信令方案和容量。GM噪声的考虑为同信道干扰链路和网络的分析和设计提供了更现实的基准。为了实现这一目标,我们首先证明了实现输入信号的容量是π/2圆对称的。通过检验输入最优的充分必要库恩-塔克条件(KTC),我们证明了最优质量点的最大数目为4个。我们的证明依赖于Dubin定理和KTC系数为正的事实,即功率约束是有效的。结合π/2的圆对称性质,得出最优输入是唯一的,并且它有四个质量点形成一个以原点为中心的正方形。通过对改进后的KTC的一阶导数和二阶导数的进一步检验,得出了最优质量点在第一象限的相位为π/4。因此,实现容量的输入信号为QPSK。这一结果有助于我们获得封闭形式的信道容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.00
自引率
0.00%
发文量
15
审稿时长
10 weeks
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信