By Topic

On the Search for a Sequence from a Predefined Set of Sequences in Random and Framed Data Streams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Stefanovic, C. ; Dept. of Power, Electron. & Commun. Eng., Univ. of Novi Sad, Novi Sad, Serbia ; Bajic, D.

In this paper we present a statistical analysis of the search for a set of predefined sequences in non-equiprobable data streams, both random and framed, and derive a number of corresponding statistical parameters. Most importantly, we derive the probability of occurrence of some sequence from the set at any given position, from which all other statistical quantities of interest can be obtained. The presented analysis is based on descriptors called cross-bifices, which express similarities among sequences in the set. Based on the obtained results, we examine the problem of frame synchronization in synchronous transmission and derive parameters that could be used for the evaluation of the properties of frame-synchronization sequences. We introduce a survival probability of the search in a frame and a list-miss probability for the list synchronizer, which give exact bounds on the probability of correct frame synchronization when hard-correlation is used as a sequence detection metric.

Published in:

Communications, IEEE Transactions on  (Volume:60 ,  Issue: 1 )