论文部分内容阅读
Gardner算法是全数字接收机无数据辅助时钟恢复常用方法,但该算法是针对连续通信模式提出的,收敛时间较长,无法直接应用于数据量较少的突发通信模式。该文对传统的Gardner算法进行修正,提出循环Gardner算法,采用先存储再处理的方式,正反相间反复利用有限数据,实现对每一帧突发数据独立完成时钟恢复。采用循环Gardner算法,正反计算具有明显的对称特征,保证正反相间利用数据与利用连续数据取得近乎一致的计算效果。
Gardner algorithm is a common method for all-digital receiver without data-assisted clock recovery. However, the proposed algorithm is proposed for continuous communication mode and has a long convergence time, so it can not be directly applied to the burst communication mode with less data volume. In this paper, the traditional Gardner algorithm is modified, and a cyclic Gardner algorithm is proposed. By using the method of first storing and then processing, the finite data is repeatedly used between the positive and the negative to achieve clock recovery independently for each frame of burst data. Using cyclic Gardner algorithm, the forward and reverse computations have obvious symmetry characteristics, ensuring that the data between the positive and negative phases and the continuous data are used to obtain a nearly uniform computational effect.