Skip to main content

Set-partition Coding

  • Chapter
Coded Modulation Systems
  • 512 Accesses

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.

Bibliography

  1. References marked with an asterix are recommended as supplementary reading. C. Schlegel, Trellis Coding. IEEE Press, New York, 1997.

    MATH  Google Scholar 

  2. E. Biglieri, D. Divsalar, P. J. McLane, and M. Simon, Introduction to Trellis-Coded Modulation with Applications. Macmillan, New York, 1991.

    MATH  Google Scholar 

  3. L. H. C. Lee, Convolutional Coding. Artech House, Boston, 1997.

    MATH  Google Scholar 

  4. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inf. Theory, IT-28, 55–67, Jan. 1982.

    Google Scholar 

  5. References marked with an asterix are recommended as supplementary reading. G. Ungerboeck, “Trellis-coded modulation with redundant signal sets,” Parts I–II, IEEE Commun. Mag., 25, 5–21, Feb. 1987.

    Google Scholar 

  6. D. P. Taylor and H. C. Chan, “A simulation study of two bandwidth-efficient modulation techniques,” IEEE Trans. Commun., COM-29, 267–275, Mar. 1981.

    Google Scholar 

  7. L.-F. Wei, “Rotationally invariant convolutional channel coding with expanded signal space,” Parts I–II, IEEE J. Sel. Areas Communs., SAC-2, 659–686, Sept. 1984.

    Google Scholar 

  8. L.-F. Wei, “Trellis-coded modulation with multidimensional constellations,” IEEE Trans. Inf. Theory, IT-33, 483–501, July 1987.

    Google Scholar 

  9. S. S. Pietrobon, et al., “Rotationally invariant nonlinear trellis codes for two-dimensional modulation,” IEEE Trans. Inf. Theory, IT-40, 1773–1791, Nov. 1994.

    Google Scholar 

  10. S. S. Pietrobon and D. J. Costello, Jr., “Trellis coding with multidimensional QAM signal sets,” IEEE Trans. Inf. Theory, IT-39, 325–336, Mar. 1990.

    MathSciNet  Google Scholar 

  11. S. S. Pietrobon, et at., “Trellis-coded multidimensional phase modulation,” IEEE Trans. Inf. Theory, IT-36, 63–89, Jan. 1990.

    MathSciNet  Google Scholar 

  12. E. J. Rossin, N. T. Sindhushayana, and C. D. Heegard, “Trellis group codes for the Gaussian channel,” IEEE Trans. Inf. Theory, IT-41, 1217–1245, Sept. 1990.

    MathSciNet  Google Scholar 

  13. L. W. Couch, Jr., Digital and Analog Communication Systems, 6th Edn. Prentice-Hall, Upper Saddle River, NJ, 2000.

    Google Scholar 

  14. References marked with an asterix are recommended as supplementary reading. R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. IEEE Press, New York, 1999.

    Google Scholar 

  15. J. B. Anderson, T. Aulin, and C.-E. Sundberg, Digital Phase Modulation, Plenum, New York, 1986.

    Google Scholar 

  16. J. B. Anderson and D. P. Taylor, “A bandwidth-efficient class of signal space codes,” IEEE Trans. Inf. Theory, IT-24, 703–712, Nov. 1978.

    MathSciNet  Google Scholar 

  17. J. B. Anderson and R. deBuda, “Better phase-modulation error performance using trellis phase codes,” Electronics (Lett.), 12(22), 587–588, 28 Oct. 1976.

    Google Scholar 

  18. References marked with an asterix are recommended as supplementary reading. M. M. Mulligan and S. G. Wilson, “An improved algorithm for evaluating trellis phase codes,” IEEE Trans. Inf. Theory, IT-30, 846–851, Nov. 1984.

    Google Scholar 

  19. C. E. Shannon, “Communication in the presence of noise,” Proc. IRE, 37, 10–21, 1949; reprinted in Claude Elwood Shannon: Collected Papers, Sloane and Wyner, (eds), IEEE Press, New York, 1993.

    MathSciNet  Google Scholar 

  20. C. E. Shannon, “Probability of error for optimal codes in a Gaussian channel,” Bell Syst. Tech. J., 38, 611–656, 1959; see Sloane and Wyner, ibid.

    MathSciNet  Google Scholar 

  21. R. de Buda, “The upper error bound of a new near-optimal code,” IEEE Trans. Inf. Theory, IT-21, 441–445, 1975.

    Google Scholar 

  22. R. de Buda, “Some optimal codes have structure,” IEEEJ. Sel. Areas Communs., SAC-7, 893–899, Aug. 1989.

    Google Scholar 

  23. J. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer, New York, 1988.

    MATH  Google Scholar 

  24. G. D. Forney, Jr., “Coset codes — Part I, II,” IEEE Trans. Inf. Theory, IT-34, 1123–1187, Sept. 1988.

    MathSciNet  Google Scholar 

  25. G. D. Forney, Jr. and L.-F. Wei, “Multidimensional constellations — Part I,” IEEE J. Sel. Areas Communs., SAC-7, 877–892, Aug. 1989; G. D. Forney, Jr., “Multidimensional constellation — Part II,”ibid., 941–958.

    Google Scholar 

  26. A. R. Calderbank and N. J. A. Sloane, “New trellis codes based on lattices and cosets,” IEEE Trans. Inf. Theory, IT-33, 177–195, Mar. 1987.

    MathSciNet  Google Scholar 

  27. A. R. Calderbank and N. J. A. Sloane, “An eight-dimensional trellis code,” Proc. IEEE, 74, 757–759, May 1986.

    Article  Google Scholar 

  28. G. Lindell, “On coded continuous phase modulation,” PhD Thesis, Telecommunication Theory Dept., University of Lund, Lund, Sweden, 1985.

    Google Scholar 

  29. J. Du and M. Kasahara, “Improvements in the information-bit error rate of trellis code modulation systems,” IEICE Japan, E72, 609–614, 1989.

    Google Scholar 

  30. W. Zhang, “Finite-state machines in communications,” PhD Thesis, Digital Communications Group, University of South Australia, Adelaide, Australia, 1995.

    Google Scholar 

  31. J.-E. Porath, “On trellis coded modulation for Gaussian and bandlimited channels,” PhD Thesis, Computer Engineering Department, Chalmers University of Technology, Göteborg, Sweden, Dec. 1991; see also “Fast algorithmic construction of mostly optimal trellis codes,” Tech. Rpt. No. 5, Division of Information Theory, Electrical and Computer Engineering, Chalmers University of Technology, Göteborg, Sweden, 1987.

    Google Scholar 

  32. L. H. Zetterberg, “A class of codes for polyphase signals on a bandlimited Gaussian channel,” IEEE Trans. Inf. Theory, IT-11, 385–395, July 1965.

    MathSciNet  Google Scholar 

  33. D. Slepian, “Group codes for the Gaussian channel,” Bell Syst. Tech. J., 47, 575–602, April 1968.

    MathSciNet  MATH  Google Scholar 

  34. G. R. Welti and S. L. Lee, “Digital transmission with coherent four-dimensional modulation,” IEEE Trans. Inf. Theory, IT-20, 497–502, July 1974.

    Google Scholar 

  35. L. Zetterberg and H. Brändström, “Codes for combined phase and amplitude modulated signals in four-dimensional space,” IEEE Trans. Commun., COM-25, 943–950, Sept. 1977.

    Google Scholar 

  36. E. Biglieri and M. Luise (eds), Coded Modulation and Bandwidth-Efficient Transmission. Elsevier, Amsterdam, 1992 (chapter 4, Block Coded Modulation).

    Google Scholar 

Download references

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

(2002). Set-partition Coding. In: Wolf, J.K., McEliece, R.J., Proakis, J., Tranter, W.H. (eds) Coded Modulation Systems. Information Technology: Transmission, Processing and Storage. Springer, Boston, MA. https://doi.org/10.1007/0-306-47792-0_4

Download citation

  • DOI: https://doi.org/10.1007/0-306-47792-0_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-306-47279-4

  • Online ISBN: 978-0-306-47792-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics