A General Characterization of Sync Word for Asynchronous Communication
R. M. Sundaram, Devendra Jalihal, Venkatesh Ramaiyan

TL;DR
This paper characterizes the fundamental limits of frame synchronization in asynchronous communication, revealing a tradeoff between sync frame length and channel parameters like power, extending previous results from discrete memoryless channels to AWGN channels.
Contribution
It introduces a unified framework for understanding sync word requirements across different channel types, including a novel analysis of energy scaling for AWGN channels.
Findings
Synchronization threshold $eta(Q)$ for DMCs is characterized.
Tradeoff between sync frame length and input power in AWGN channels is established.
Scaling laws for energy-efficient synchronization are derived.
Abstract
We study a problem of sequential frame synchronization for a frame transmitted uniformly in slots. For a discrete memoryless channel (DMC), Venkat Chandar et al showed that the frame length must scale with as for the frame synchronization error to go to zero (asymptotically with ). Here, denotes the transition probabilities of the DMC and , defined as the synchronization threshold, characterizes the scaling needed of for asymptotic error free frame synchronization. We show that the asynchronous communication framework permits a natural tradeoff between the sync frame length and the channel (usually parameterised by the input). For an AWGN channel, we study this tradeoff between the sync frame length and the input symbol power and characterise the scaling needed of the sync frame energy for optimal frame…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · Algorithms and Data Compression
