一种用于突发调制解调器的低复杂度符号时序恢复算法

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323729

Luo Wu, B. Liu

{"title":"一种用于突发调制解调器的低复杂度符号时序恢复算法","authors":"Luo Wu, B. Liu","doi":"10.1109/ITW2.2006.323729","DOIUrl":null,"url":null,"abstract":"In this paper, we describe and analyze an efficient non-date-aided (NDA) symbol timing recovery algorithm named the quadratic approximation (QA) algorithm. Compared with the tone filtering (TF) algorithm, the algorithm presented here is low-complexity. It requires only one multiplication per burst. Its performance is better than that of the TF algorithm in terms of the estimated standard deviation and sensitivity to frequency offsets","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications\",\"authors\":\"Luo Wu, B. Liu\",\"doi\":\"10.1109/ITW2.2006.323729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe and analyze an efficient non-date-aided (NDA) symbol timing recovery algorithm named the quadratic approximation (QA) algorithm. Compared with the tone filtering (TF) algorithm, the algorithm presented here is low-complexity. It requires only one multiplication per burst. Its performance is better than that of the TF algorithm in terms of the estimated standard deviation and sensitivity to frequency offsets\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文描述并分析了一种高效的非日期辅助(NDA)符号时序恢复算法——二次逼近(QA)算法。与音调滤波(TF)算法相比，该算法具有较低的复杂度。每次爆发只需要一次乘法。在估计标准差和对频率偏移的敏感性方面，其性能优于TF算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications

In this paper, we describe and analyze an efficient non-date-aided (NDA) symbol timing recovery algorithm named the quadratic approximation (QA) algorithm. Compared with the tone filtering (TF) algorithm, the algorithm presented here is low-complexity. It requires only one multiplication per burst. Its performance is better than that of the TF algorithm in terms of the estimated standard deviation and sensitivity to frequency offsets

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量