A clock skew compensation algorithm was recently proposed based on the extension of Bresenham's line drawing algorithm (Kim and Kang, IEEE Commun. Lett., vol. 26, no. 4, pp. 902--906, Apr. 2022), which takes into account the discrete nature of clocks in digital communication systems and mitigates the effect of limited floating-point precision on clock skew compensation. It lacks, however, a theoretical analysis of the range of the initial value of skew-compensated clock, which is also an initial condition for the proposed algorithm. In this letter, we provide practical as well as theoretical bounds on the initial value of skew-compensated clock based on a systematic analysis of the errors of floating-point operations, which replace the approximate bounds in Theorem 1 of the prior work.

翻译：最近根据Bresenham的线性绘图算法(Kim and Kang, IEEE Commun. Lett., vol.26, No.4, pp. 902-906, Apr.2022)的扩展,提出了时钟补偿算法,该算法考虑到数字通信系统中时钟的离散性质,减轻了浮点定定数有限对时钟斜度补偿的影响,但缺乏对已补偿时钟初始值范围的理论分析,这也是拟议算法的初始条件之一。在本信内,我们根据对浮动点操作错误的系统分析,就已补偿时钟的初始值提供了实用和理论界限,以取代先前工作Theorem 1 的近似界限。