Skip to main content

Sequence based methods for data transmission and source compression

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

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

  • 177 Accesses

Abstract

In the last 10 years the invention of trellis coded modulation has revolutionized communication over bandlimited channels and is starting to be used in magnetic storage. Part of the reason is that sophisticated signal processing systems involving finite state machines can now be fabricated inexpensively. This paper discusses new developments in the performance analysis of finite state machines.

This is the extended abstract of an invited lecture to be given at the 10th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Puerto Rico, May 10–14, 1993.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. R. Calderbank and P. C. Fishburn, “The normalized second moment of the binary lattice determined by a convolutional code,” preprint 1991.

    Google Scholar 

  2. A. R. Calderbank, P. C. Fishburn, and A. Rabinovich, Covering properties of convolutional codes and associated lattices, preprint, 1992.

    Google Scholar 

  3. A. R. Calderbank, P. C. Fishburn, and P. H. Siegel, “State space characterization of Viterbi detector path metric differences,” preprint, 1992.

    Google Scholar 

  4. A. R. Calderbank and L. H. Ozarow, “Nonequiprobable signaling on the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-36, pp. 726–740, 1990.

    Google Scholar 

  5. G. D. Cohen, M. G. Karpovsky, H. F. Mattson Jr., and J. R. Schatz, “Covering radius — Survey and recent results,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 328–343, 1985.

    Google Scholar 

  6. J. H. Conway and N. J. A. Sloane, “A fast encoding method for lattice codes and quantizers,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 820–824, 1983.

    Google Scholar 

  7. G. D. Forney, Jr., “Structural analysis of convolutional codes via dual codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 512–518, 1973.

    Google Scholar 

  8. G. D. Forney, Jr., “Multidimensional constellations — Part II: Voronoi constellations,” IEEE J. Select. Areas Commun., vol. SAC-7, pp. 941–958, 1989.

    Google Scholar 

  9. G. D. Forney, Jr., “Trellis Shaping,” IEEE Trans. Inform. Theory, vol. IT-38, pt. 1, pp. 281–300, 1992.

    Google Scholar 

  10. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, IT-31, pp. 385–401, 1985.

    Google Scholar 

  11. P. Headley, “A counterexample to a Voronoi constellation conjecture,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 1665–1667, 1991.

    Google Scholar 

  12. A. Hekstra, “An Alternative to Metric Rescaling in Viterbi Decoders,” IEEE Trans. Commun., vol. 37, pp. 1220–1222, November 1989.

    Google Scholar 

  13. R. Laroia, N. Favardin, and S. Tretter, “On SVQ shaping of multidimensional constellations — High-rate large-dimensional constellations,” preprint, 1992.

    Google Scholar 

  14. M. W. Marcellin and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Commun., vol. 38, pp. 82–93, 1990.

    Google Scholar 

  15. B. H. Marcus, P. H. Siegel, and J. K. Wolf, “Finite-state modulation codes for data storage,” IEEE J. Select. Areas Commun., vol. 10, pp. 5–37, 1992.

    Google Scholar 

  16. C. B. Shung, R. Karabed, P. H. Siegel and H. K. Thapar, “A 30 MHz Trellis Codec Chip for Partial Response Channels,” IBM Technical Report RJ 7771 (71888), October 24, 1991.

    Google Scholar 

  17. P. Siegel, C. Shung, T. Howell, and H. Thapar, “Exact Bounds for Viterbi Detector Path Metric Differences,” Proceedings of 1991 IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP'91), Toronto, May 14–17, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gérard Cohen Teo Mora Oscar Moreno

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calderbank, A.R., Fishburn, P.C., Rabinovich, A. (1993). Sequence based methods for data transmission and source compression. In: Cohen, G., Mora, T., Moreno, O. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1993. Lecture Notes in Computer Science, vol 673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56686-4_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-56686-4_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56686-1

  • Online ISBN: 978-3-540-47630-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics