Optimal Sequential Frame Synchronization
From MaRDI portal
Publication:3604752
DOI10.1109/TIT.2008.926444zbMATH Open1329.94101arXiv0708.2911MaRDI QIDQ3604752
Venkat Chandar, Gregory W. Wornell, Aslan Tchamkerten
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assume that the sync pattern of length N starts being emitted at a random time within some interval of size A, that characterizes the asynchronism level between the transmitter and the receiver. We show that a sequential decoder can optimally locate the sync pattern, i.e., exactly, without delay, and with probability approaching one as N tends to infinity, if and only if the asynchronism level grows as O(exp(N*k)), with k below the `synchronization threshold,' a constant that admits a simple expression depending on the channel. This constant is the same as the one that characterizes the limit for reliable asynchronous communication, as was recently reported by the authors. If k exceeds the synchronization threshold, any decoder, sequential or non-sequential, locates the sync pattern with an error that tends to one as N tends to infinity. Hence, a sequential decoder can locate a sync pattern as well as the (non-sequential) maximum likelihood decoder that operates on the basis of output sequences of maximum length A+N-1, but with much fewer observations.
Full work available at URL: https://arxiv.org/abs/0708.2911
This page was built for publication: Optimal Sequential Frame Synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604752)
