Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2208.11520 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910917379227648 |
|---|---|
| author | Kang, Seungyeop Kim, Kyeong Soo |
| author_facet | Kang, Seungyeop Kim, Kyeong Soo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_11520 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss Kang, Seungyeop Kim, Kyeong Soo Networking and Internet Architecture 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. |
| title | Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2208.11520 |