Proof of concept mathemathical model of a modulation breaking the Shannon limit

M. Bujor
{"title":"Proof of concept mathemathical model of a modulation breaking the Shannon limit","authors":"M. Bujor","doi":"10.1109/SIITME.2017.8259913","DOIUrl":null,"url":null,"abstract":"Recent research in the field of spectral analysis shows oversampling helps extract significantly more information than conventional sampling, from the same signal in the same bandwidth. A modulation grouping time domain overlapping symbols is proposed, in order to utilize oversampling. Overlapped symbol groups are decoded with the help of a system of equations, as each symbol has a slightly different time position. Their values can thus be distinctively detected with a low error probability. The Shannon limit is considered in a complete form, i.e. error probability, beside bandwidth and signal to noise ratio determine the maximum rate of a channel. The simulation gives a rate about four times the Shannon limit without considering bits to be wasted on synchronization, which are not considered in the Shannon limit either. The modulation needs time synchronization like most digital modulations, e.g. OFDM, but there are enough bits left for it without falling behind the Shannon limit. The result suggests a new channel limit theorem is needed and more research has to be done on reaching it by oversampling the signal relative to the channel bandwidth.","PeriodicalId":138347,"journal":{"name":"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIITME.2017.8259913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recent research in the field of spectral analysis shows oversampling helps extract significantly more information than conventional sampling, from the same signal in the same bandwidth. A modulation grouping time domain overlapping symbols is proposed, in order to utilize oversampling. Overlapped symbol groups are decoded with the help of a system of equations, as each symbol has a slightly different time position. Their values can thus be distinctively detected with a low error probability. The Shannon limit is considered in a complete form, i.e. error probability, beside bandwidth and signal to noise ratio determine the maximum rate of a channel. The simulation gives a rate about four times the Shannon limit without considering bits to be wasted on synchronization, which are not considered in the Shannon limit either. The modulation needs time synchronization like most digital modulations, e.g. OFDM, but there are enough bits left for it without falling behind the Shannon limit. The result suggests a new channel limit theorem is needed and more research has to be done on reaching it by oversampling the signal relative to the channel bandwidth.
打破香农极限的调制的概念数学模型的证明
最近在频谱分析领域的研究表明,在相同的带宽下,从相同的信号中,过采样可以比传统采样提取更多的信息。为了利用过采样,提出了一种调制分组时域重叠符号的方法。由于每个符号的时间位置略有不同,重叠的符号组在方程系统的帮助下进行解码。因此,它们的值可以以较低的错误概率被明显地检测出来。香农极限以完备的形式考虑,即误差概率,而带宽和信噪比决定信道的最大速率。模拟给出的速率大约是香农极限的四倍,而不考虑在同步上浪费的比特,这在香农极限中也不考虑。像大多数数字调制(如OFDM)一样,调制需要时间同步,但有足够的比特留给它,而不会落后于香农限制。结果表明需要一个新的信道极限定理,并且需要做更多的研究来通过相对于信道带宽的信号过采样来达到它。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信