Skip to main content

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 403))

Abstract

The recently proposed turbo codes [1] have demonstrated performance near the Shannon limit. This superior performance is achieved at the cost of decoding delay, system complexity and requirement of frame synchronisation. For a practical modem, frame synchronisation is an important issue. In this paper we will examine a number of frame synchronisation methods and propose a turbo decoder aided frame synchronisation algorithm. This algorithm is suitable for DSP implementations and fading channels.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berrow, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in ICC’93, pp. 1064–1070, 1993.

    Google Scholar 

  2. J. L. Massey, “Optimum frame synchronization,” IEEE Trans. Commun., vol. C-20, pp. 115–119, Apr. 1972.

    Article  Google Scholar 

  3. G. L. Lui and H. H. Tan, “Frame synchronization for Gaussian channels,” IEEE Trans. Commun., vol. C-35, pp. 818–829, Aug. 1987.

    Google Scholar 

  4. P. T. Nielsen, “Some optimum and sumoptimum frame synchronizers for binary data in Gaussian noise,” IEEE Trans. Commun., vol. 21, pp. 770–772, June 1973.

    Article  Google Scholar 

  5. R. A. Scholtz, “Frame synchronization techniques,” IEEE Trans. Commun., vol. 28, pp. 1204–1213, Aug. 1980.

    Article  Google Scholar 

  6. S. Patarasen and C. N. Georghiades, “Frame synchronization for optical overlapping pulse-position modulation systems,” IEEE Trans. Commun., vol. 40, pp. 783–794, Apr. 1992.

    Article  MATH  Google Scholar 

  7. P. Robertson, “Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes,” in Globecom’94, pp. 1298–1303, Dec. 1994.

    Google Scholar 

  8. L. Zhang, “On the MAP algorithm, iterative decoding and turbo codes,” in DSP for Communication Systems, Forth international symposium, Perth, Sept. 1996.

    Google Scholar 

  9. P. Bylanski and D. G. W. Ingram, Digital transmission systems. (Stevenage, Eng: P. Per egrinus on behalf of) IEE Telecommunications series, 1976.

    Google Scholar 

  10. L. Zhang, W. Zhang, J. Ball, and M. Gill, “A turbo-coded, low-rate HF radio modem,” in DSP for Communication Systems, Forth international symposium, Perth, Sept. 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Zhang, W., Zhang, L., Ball, J., Gill, M. (1997). A Frame Synchronisation Scheme for Turbo Codes. In: Wysocki, T., Razavi, H., Honary, B. (eds) Digital Signal Processing for Communication Systems. The Springer International Series in Engineering and Computer Science, vol 403. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6119-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-6119-4_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7804-4

  • Online ISBN: 978-1-4615-6119-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics