Discrete Time Faster-Than-Nyquist Signalling

M. McGuire, M. Sima
{"title":"Discrete Time Faster-Than-Nyquist Signalling","authors":"M. McGuire, M. Sima","doi":"10.1109/GLOCOM.2010.5683272","DOIUrl":null,"url":null,"abstract":"Increasing the symbol rate up to 25\\% faster than the Nyquist criteria for a digital communications system with QPSK modulation with an AWGN channel does not significantly increase the bit error rate or required transmission bandwidth. This so-called Faster-than-Nyquist (FTN) signalling has not been used in commercially deployed communications systems since the previously proposed implementation schemes required large receiver complexity. This paper introduces a reformulation of FTN signalling in terms of a non-square matrix multiplied by a sample vector of modulated QPSK symbols. It is shown that with this formulation the receiver complexity to detect the transmitted data for an AWGN channel is well within the complexity bounds for standard digital communication systems. This formulation enables an analysis of FTN signalling directly comparing it to standard higher order modulation and data coding techniques.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"65 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5683272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

Abstract

Increasing the symbol rate up to 25\% faster than the Nyquist criteria for a digital communications system with QPSK modulation with an AWGN channel does not significantly increase the bit error rate or required transmission bandwidth. This so-called Faster-than-Nyquist (FTN) signalling has not been used in commercially deployed communications systems since the previously proposed implementation schemes required large receiver complexity. This paper introduces a reformulation of FTN signalling in terms of a non-square matrix multiplied by a sample vector of modulated QPSK symbols. It is shown that with this formulation the receiver complexity to detect the transmitted data for an AWGN channel is well within the complexity bounds for standard digital communication systems. This formulation enables an analysis of FTN signalling directly comparing it to standard higher order modulation and data coding techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
比奈奎斯特信号更快的离散时间
对于带有AWGN信道的QPSK调制的数字通信系统,将符号率提高到比Nyquist标准快25%不会显著增加误码率或所需的传输带宽。这种所谓的比奈奎斯特(FTN)更快的信号还没有在商业部署的通信系统中使用,因为以前提出的实施方案需要很大的接收器复杂性。本文介绍了用非方阵乘以调制的QPSK符号的样本向量来重新表述FTN信令的方法。结果表明,利用该公式,接收端检测AWGN信道传输数据的复杂度完全在标准数字通信系统的复杂度范围内。该公式可以直接将FTN信号与标准的高阶调制和数据编码技术进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Channel Code Aided Decision-Directed Channel Estimation for MIMO OFDM/SDMA Systems Based on the "Expectation-Conditional Maximization Either" Algorithm Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking Platforms and Software Systems for an Autonomic Internet Multiple-Description Speech Coding Using Speech-Polarity Decomposition On Fairness and Locality in P2P-TV through Large-Scale Measurement Experiment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1