检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]成都大学电子信息与电气工程学院,四川成都610106
出 处:《现代传输》2025年第2期55-60,共6页Modern Transmission
基 金:四川省时频同步系统及应用工程技术研究中心开放课题(2024SPKT04);成都大学人才启动项目(X2152)。
摘 要:符号同步在无线通信中是实现数字调制信号精确解调的关键环节,要求接收端能够精确对齐发射端的采样时钟,以捕获信号的最佳采样点。然而,经典Gardner同步算法面临同步时间较长,并在相邻符号极性相同时失效的局限。针对这一问题,本文提出了一种优化的Gardner反馈同步环路方案。该方法结合拉格朗日三次插值滤波技术,准确估算相邻符号的幅度信息,并改进了Gardner算法以提升同步性能。仿真结果表明,改进后的算法显著缩短了同步时间,并在加快定时误差收敛方面表现出优异性能。相比传统算法,该方法显著提升了环路效率,为解决无线通信中的符号同步问题提供了更有效和可靠的方案。Symbol synchronization is a key step in wireless communication for achieving precise demodulation of digitally modulated signals, requiringthe receiver to accurately align its sampling clock with the transmitter to capture the optimal sampling point. However, the classical Gardnersynchronization algorithm faces limitations, including long synchronization time and failure when adjacent symbols have the same polarity.To address these issues, this paper proposes an optimized Gardner feedback synchronization loop. The method incorporates cubic Lagrangeinterpolation filtering to accurately estimate the amplitude of adjacent symbols, combined with an improved Gardner algorithm to enhancesynchronization performance. Simulation results show that the proposed algorithm significantly reduces synchronization time and demonstratessuperior performance in accelerating the convergence of timing errors. Compared with the classical algorithm, this approach notably improvesloop efficiency, providing a more effective and reliable solution to symbol synchronization challenges in wireless communication.
关 键 词:定时误差 符号同步 定时恢复 改进Gardner算法
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49