上行电缆OFDMA信号的定时同步

Yayi Xiao, B. Berscheid, Ha H. Nguyen, J. Salt
{"title":"上行电缆OFDMA信号的定时同步","authors":"Yayi Xiao, B. Berscheid, Ha H. Nguyen, J. Salt","doi":"10.1109/PACRIM47961.2019.8985094","DOIUrl":null,"url":null,"abstract":"The most recent broadband data-over-cable standard, known as DOCSIS 3.1, introduced orthogonal frequency-division multiplexing (OFDM) as a major upgrade to improve transmission efficiency. Because OFDM signals are sensitive to synchronization errors, accurate timing recovery is an integral part of a DOCSIS 3.1 system. Many conventional OFDM/OFDMA timing synchronization methods cannot be directly applied, as they require the use of specific training signals which are incompatible with DOCSIS 3.1. In this paper, the performance of a modified Schmidl and Cox (S&C) timing algorithm is first investigated for DOCSIS 3.1 systems and shown to be unsatisfactory under severe channel conditions. Two novel timing algorithms are proposed which take advantage of the mirrored symmetry of the training signal defined in DOCSIS 3.1. It is demonstrated that both algorithms provide accurate timing estimates even under severe channel conditions and heavy traffic flow. The second algorithm is introduced to eliminate the use of multipliers in the first algorithm, hence reducing the hardware complexity. Data skipping and data truncation are also presented as methods of further reducing the hardware complexity and the corresponding cost-performance tradeoff is investigated.","PeriodicalId":152556,"journal":{"name":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Timing Synchronization for Upstream Cable OFDMA Signals\",\"authors\":\"Yayi Xiao, B. Berscheid, Ha H. Nguyen, J. Salt\",\"doi\":\"10.1109/PACRIM47961.2019.8985094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most recent broadband data-over-cable standard, known as DOCSIS 3.1, introduced orthogonal frequency-division multiplexing (OFDM) as a major upgrade to improve transmission efficiency. Because OFDM signals are sensitive to synchronization errors, accurate timing recovery is an integral part of a DOCSIS 3.1 system. Many conventional OFDM/OFDMA timing synchronization methods cannot be directly applied, as they require the use of specific training signals which are incompatible with DOCSIS 3.1. In this paper, the performance of a modified Schmidl and Cox (S&C) timing algorithm is first investigated for DOCSIS 3.1 systems and shown to be unsatisfactory under severe channel conditions. Two novel timing algorithms are proposed which take advantage of the mirrored symmetry of the training signal defined in DOCSIS 3.1. It is demonstrated that both algorithms provide accurate timing estimates even under severe channel conditions and heavy traffic flow. The second algorithm is introduced to eliminate the use of multipliers in the first algorithm, hence reducing the hardware complexity. Data skipping and data truncation are also presented as methods of further reducing the hardware complexity and the corresponding cost-performance tradeoff is investigated.\",\"PeriodicalId\":152556,\"journal\":{\"name\":\"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM47961.2019.8985094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM47961.2019.8985094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最新的宽带电缆数据标准DOCSIS 3.1引入了正交频分复用(OFDM)作为主要升级,以提高传输效率。由于OFDM信号对同步误差很敏感,所以准确的定时恢复是DOCSIS 3.1系统不可缺少的一部分。许多传统的OFDM/OFDMA定时同步方法不能直接应用,因为它们需要使用与DOCSIS 3.1不兼容的特定训练信号。本文首先研究了一种改进的Schmidl and Cox (S&C)定时算法在DOCSIS 3.1系统中的性能,结果表明该算法在恶劣信道条件下的性能并不令人满意。利用DOCSIS 3.1中定义的训练信号的镜像对称性,提出了两种新的定时算法。结果表明,即使在恶劣的信道条件和交通流量较大的情况下,两种算法也能提供准确的时序估计。引入第二种算法是为了消除第一种算法中乘法器的使用,从而降低硬件复杂性。数据跳过和数据截断作为进一步降低硬件复杂度的方法也被提出,并研究了相应的成本性能权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Timing Synchronization for Upstream Cable OFDMA Signals
The most recent broadband data-over-cable standard, known as DOCSIS 3.1, introduced orthogonal frequency-division multiplexing (OFDM) as a major upgrade to improve transmission efficiency. Because OFDM signals are sensitive to synchronization errors, accurate timing recovery is an integral part of a DOCSIS 3.1 system. Many conventional OFDM/OFDMA timing synchronization methods cannot be directly applied, as they require the use of specific training signals which are incompatible with DOCSIS 3.1. In this paper, the performance of a modified Schmidl and Cox (S&C) timing algorithm is first investigated for DOCSIS 3.1 systems and shown to be unsatisfactory under severe channel conditions. Two novel timing algorithms are proposed which take advantage of the mirrored symmetry of the training signal defined in DOCSIS 3.1. It is demonstrated that both algorithms provide accurate timing estimates even under severe channel conditions and heavy traffic flow. The second algorithm is introduced to eliminate the use of multipliers in the first algorithm, hence reducing the hardware complexity. Data skipping and data truncation are also presented as methods of further reducing the hardware complexity and the corresponding cost-performance tradeoff is investigated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信