Advertisement

Acquisition Times of Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis

  • Čedomir Stefanović
  • Dragana Bajić
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6338)

Abstract

In this paper we present a cross-bifix analysis of contiguous and distributed marker sequences and apply it to the problem of acquisition of frame synchronization. The analysis establishes the relationship between the sequence period, structure, length, the amount of distortion and expected worst-case acquisition time. The provided study is general and can be applied to multilevel and unequally distributed data.

Keywords

frame synchronization frame-synchronization acquisition marker sequences 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barker, R.H.: Group synchronization of binary digital systems. In: Communication Theory, pp. 273–287. Academic Press Inc., New York (1953)Google Scholar
  2. 2.
    Turyn, R.: Sequences with small corellation. In: Error Correcting Codes, pp. 195–228. Wiley, New York (1968)Google Scholar
  3. 3.
    Willard, M.W.: Optimum Code Patterns for PCM Synchronization. In: Proc. National Telemetry Conference (1962)Google Scholar
  4. 4.
    Lindner, J.: Binary sequences up to length 40 with best possible autocorellation function. Electron. Lett. 11(21), 507 (1975)CrossRefGoogle Scholar
  5. 5.
    Schroeder, M.: Number theory in science and communication. Springer, Berlin (1984)zbMATHGoogle Scholar
  6. 6.
    Scholtz, R.: Frame Synchronization Techniques. IEEE Trans. Comm. 28, 1204–1213 (1980)CrossRefGoogle Scholar
  7. 7.
    de Lind van Wijngaarden, A.J., Willink, T.J.: Frame Synchronization Using Distributed Sequences. IEEE Trans. Comm. 48(12), 2127–2138 (2000)CrossRefGoogle Scholar
  8. 8.
    Villanti, M., Iubatti, M., Vanelli-Coralli, A., Corazza, G.E.: Design of Distributed Unique Words for Enhanced Frame Synchronization. IEEE Trans. Comm. 57(8), 2430–2440 (2009)CrossRefGoogle Scholar
  9. 9.
    Schotten, H.D., Lüke, H.D.: On the search for low correlated binary sequences. Int. J. Electron. Commun. 59(2), 67–78 (2005)CrossRefGoogle Scholar
  10. 10.
    Al-Subbagh, M.N., Jones, E.V.: Optimum patterns for frame alignment. IEE Proc. part F - Commun., Radar & Signal Processing 135(6), 594–603 (1988)CrossRefGoogle Scholar
  11. 11.
    Nielsen, P.T.: On the Expected Duration of a Search for a Fixed Pattern in Random Data. IEEE Trans. Inform. Theory 19, 702–704 (1973)zbMATHCrossRefGoogle Scholar
  12. 12.
    Nielsen, P.T.: A Note on Bifix-free Sequences. IEEE Trans. Inform. Theory 19, 704–706 (1973)zbMATHCrossRefGoogle Scholar
  13. 13.
    McConnell, T.R.: The Expected Time to Find a String in a Random Binary Sequence (2001), http://barnyard.syr.edu/cover.pdf
  14. 14.
    Bajic, D., Stefanovic, C., Vukobratovic, D.: Search Process and Probabilistic Bifix Approach. In: Proc. of IEEE ISIT 2005, Adelaide, Australia (September 2005)Google Scholar
  15. 15.
    Stefanovic, C.: Synchronization sequences and bifix analysis (in Serbian). Master’s thesis, Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia (2006)Google Scholar
  16. 16.
    Bajic, D.: On Survival Probability of Alignment Sequences. In: Proc. of ISITA 2004, Parma, Italy (October 2004)Google Scholar
  17. 17.
    Häberle, H.: Frame Synchronizing PCM Systems. Electric. Comm. 44(4), 280–287 (1969)Google Scholar
  18. 18.
    Bajic, D.: New simple method for solving the first passage time problem. Electron. Lett. 27(16), 1419–1421 (1991)CrossRefGoogle Scholar
  19. 19.
    CCITT Recommendation, C.: Blue Book III.4. Geneve, Switzerland (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Čedomir Stefanović
    • 1
  • Dragana Bajić
    • 1
  1. 1.Department of Power, Electronics and Communication EngineeringUniversity of Novi SadNovi SadSerbia

Personalised recommendations