iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.48550/arXiv.2208.11520
[2208.11520] Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Networking and Internet Architecture

arXiv:2208.11520 (cs)
[Submitted on 24 Aug 2022 (v1), last revised 27 Aug 2022 (this version, v2)]

Title:Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss

Authors:Seungyeop Kang, Kyeong Soo Kim
View PDF
Abstract: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.
Comments: 4 pages, under review for journal publication
Subjects: Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2208.11520 [cs.NI]
  (or arXiv:2208.11520v2 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2208.11520
Journal reference: Fiber and Integrated Optics, vol. 43, no. 3, pp. 111--121, Jun. 24, 2024
Related DOI: https://doi.org/10.1080/01468030.2024.2363250

Submission history

From: Kyeong Soo (Joseph) Kim [view email]
[v1] Wed, 24 Aug 2022 13:07:58 UTC (10 KB)
[v2] Sat, 27 Aug 2022 12:35:53 UTC (10 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2022-08
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)