Skip to main content

Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1719))

Abstract

In this paper a bootstrap iterative decoding technique concatenated with the Viterbi algorithm (BIVA) and trellis shaping for trellis-coded modulation (TCM) is proposed. The concept of a bootstrap decoding is introduced first and then the new metric functions which take into account the bootstrap iterative decoding algorithm for TCM systems are derived. One and two dimensional bootstrap decoding are proposed for packet transmission. Furthermore, the trellis shaping technique is also considered to combine with such TCM schemes using the BIVA. The simulation results show that the performance of 1.25 dB away from Shannon limit can be achieved by the BIVA and trellis shaping for 256-state 6 bits/T TCM scheme, with low complexity and reasonable computation.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. G. Ungerboeck: t“Channel coding with multilevel/phase signals”, IEEE Trans. on Inform. Theory, Vol. IT-28, pp. 55–67, Jan. 1982.

    Article  Google Scholar 

  2. Ezio Biglieri, D. Divsalar, P. J. McLane and M. K. Simon, Introduction to Trelliscoded Modulation with Applications, Macmillan Publishing Company, New Vork, 1991.

    Google Scholar 

  3. G.D. Forney, Jr.: “The Viterbi Algorithm” Proc. of the IEEE, Vol. 61, No. 3, March 1973.

    Google Scholar 

  4. F. Jelinek, J. Cocke: “Bootstrap hybrid decoding for symmetrical binary input channels”, Information and Control, Vol. 18, pp. 261–298, April 1971.

    Google Scholar 

  5. F. Jelinek: “Bootstrap trellis decoding”, IEEE Trans. on Inform. Theory, Vol. 21, pp. 318–325, May 1975.

    Article  MATH  MathSciNet  Google Scholar 

  6. H. A. Cabral, D. J. Costello, Jr., P.R. Chevillat: “Bootstrap hybrid decoding using the multiple stack algorithm”, Proceeding of IEEE ISIT’97, pp. 494, Ulm, Germany, June 29-July 4.

    Google Scholar 

  7. L. Wei: “Near Optimal Limited-Search Detection, Part II: Convolutional Codes”, Submitted to IEEE Trans. on Inform. Theory

    Google Scholar 

  8. L. Wei: “On bootstrap iterative Viterbi algorithm”, IEEE ICC’, Vancouver, Canada.

    Google Scholar 

  9. G. Solomon, H. C. A. van Tilborg: “A connection between block and convolutional coded”, SIMA J. of Appl. Math, Vol. 37, No. 2, Oct. 1979.

    Google Scholar 

  10. G. D. Forney, Jr.: “Trellis shaping”, IEEE Trans. on Inform. Theory, Vol. 38, pp. 281–300, Mar. 1992.

    Article  MathSciNet  Google Scholar 

  11. S. Couturier, D. J. Costello, Jr., and Fu-Quan Wang, “Sequential decoding with trellis shaping”, IEEE Trans. on Inform. Theory, Vol. IT-41, No.6, pp. 2037–2040, Nov. 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Q., Wei, L., Kennedy, R.A. (1999). Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics