Lattice and Trellis Quantization with Lattice- and Trellis-Bounded Codebooks—High-Rate Theory for Memoryless Sources

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 46-59

  Eyuboglu, M Vedat ^a   Forney, Jr, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

lattice quantization; Source coding; trellis coded modulation shaping; trellis coded quantization; vector quantization

Indexed keywords

CODES (SYMBOLS); DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY; PROBABILITY; SIGNAL DISTORTION; VECTORS;

BOUNDARY GAIN; GAUSSIAN SOURCES; GRANULAR GAIN; LATTICE QUANTIZATION; MEMORYLESS SOURCES; SOUECE CODING; TRELLIS QUANTIZATION; TRELLIS-CODED MODULATION; VARIABLE-RATE ENTROPY CODING; VECTOR QUANTIZATION;

SIGNAL ENCODING;

EID: 0027147870     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179341     Document Type: Article

References (45)

1. CE. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: Univ. of Illinois Press, 1949.
2. R. M. Gray and H. Abut, “Full search and tree searched vector quantization of speech waveforms,” Proc. ICASSP, Paris, France, May 1982, pp. 593–596.
3. J. Makhoul, S. Roucos, and H. Gish, “Vector quantization in speech coding,” Proc. IEEE, vol. 73, pp. 1551–1588, Nov. 1985.
4. A. Gersho and V. Cuperman, “Vector quantization: A pattern-matching technique for speech coding,” IEEE Commun. Mag., pp. 15–21, Dec. 1983.
5. B.-H. Juang and A. H. Gray, Jr., “Multiple stage vector quantization for speech coding,” Proc. ICASSP, May 1982, pp. 597–600.
6. M. J. Sabin and R. M. Gray, “Product code vector quantizers for speech and waveform coding,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 474–488, June 1984.
7. I. A. Gerson and M.A. Jasuik, “Vector sum excited linear prediction (VSELP) speech coding at 8 kb/s,” in Proc. ICASSP, Albuquerque, NM, Apr. 1989, pp. 461–464.
8. J. H. Conway and N.J.A. Sloane, “Voronoi regions of lattices, second moments of polytopes, and quantization,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 211–226, May 1982.
9. —, “Fast quantizing and decoding algorithms for lattice quantizers and codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 227–232, Mar. 1982.
10. —, “A fast encoding method for lattice codes and quantizers,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 820–824, Nov. 1983.
11. —, “A lower bound on the average error of vector quantizers,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 106–109, Jan. 1985.
12. A. Gersho, “On the structure of vector quantizers,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 157–166, Mar. 1982.
13. K. Sayood, J. D. Gibson, and M. C. Rost, “An algorithm for vector quantizer design,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 805–814, 1984.
14. J.D. Gibson and K. Sayood, “Lattice quantization,” in Advances in Electronics and Electron Phys., pp. 259–332, 1988.
15. T.-C. Chen, “A lattice vector quantizer using a geometric decomposition,” IEEE Trans. Commun., vol. 38, pp. 704–714, May 1990.
16. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
17. S.-Z. Kiang and R. L. Baker, “Efficient lattice vector quantizers for i.i.d. Gaussian and Laplacian sources,” Proc. Int. Symp. Inform. Theory and Its Applicat. (ISITA), Honolulu, HI, 1990.
18. D.G. Jeong and J.D. Gibson, “Cubic lattice vector quantizers for nonuniform sources,” IEEE Trans. Inform. Theory, to appear.
19. D. J. Sakrison, “A geometric treatment of source encoding of a Gaussian random variable,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 96–101, May 1968.
20. T. R. Fischer, “A pyramid vector quantizer,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 568–583, July 1986.
21. J.P. Adoul and M. Barth, “Nearest neighbor algorithm for spherical codes from the Leech lattice,” IEEE Trans. Inform. Theory, vol. 34, pt. II, pp. 1188–1202, Sept. 1988.
22. T. R. Fischer, “Geometric source coding and vector quantization,” IEEE Trans. Inform. Theory, vol. 35, pp. 137–145, Jan. 1989.
23. C. Lamblin, J. P. Adoul, D. Massaloux, and S. Morissette, “Fast CELP coding based on the Barnes-Wall lattice in 16 dimensions,” Proc. ICASSP’89, Glasgow, Apr. 1989, pp. 61–64.
24. P. Zador, “Asymptotic quantization error of continuous signals and the quantization dimension,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 139–149, Mar. 1982 (also unpublished Bell Labs memo., “Topics in the asymptotic quantization of continuous random variables,” 1966).
25. A. Gersho, “Asymptotically optimal block quantization,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 373–380, July 1979.
26. Y. Yamada, S. Tazaki, and R.M. Gray, “Asymptotic performance of block quantizers with difference distortion measures,” IEEE Trans. Inform. Theory, IT-26, pp. 6–15, Jan. 1984.
27. T. Lookabaugh and R.M. Gray, “High resolution quantization theory and the vector quantizer advantage,” IEEE Trans. Inform. Theory, vol. 35, pp. 1020–1033, Sept. 1989.
28. J. A. Bucklew, “Two results on the asymptotic performance of quantizers,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 341–348, 1984.
29. H. Gish and J. N. Pierce, “Asymptotically efficient quantizing,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 676–683, Sept. 1968.
30. N. Farvardin and J.W. Modestino, “Optimum quantizer performance for a class of non-Gaussian memoryless sources,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 485–497, May 1984.
31. G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
32. —, “Multidimensional constellations—Part II: Voronoi constellations,” IEEE J. Select. Areas Commun., vol. 7, pp. 941–958, 1989.
33. —, “Coset codes—Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, pt. II, pp. 1123–1151, Sept. 1988.
34. —, “Trellis shaping,” IEEE Trans. Inform. Theory, vol. 38, pt. II, pp. 281–300, Mar. 1992.
35. M. W. Marcellin and T. R. Fischer, “Trellis-coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Commun., vol. 38, pp. 82–93, Jan. 1990.
36. R. deBuda, “Some optimal codes have structure,” IEEE J. Select. Areas Commun., vol. 7, pp. 893–899, Aug. 1989.
37. T. Linder, C. Schlegel, and K. Zeger, “Comments on Some optimal codes have structure,” submitted to IEEE Trans. Inform. Theory, May 1992.
38. N. S. Jayant and P. Noll, Digital Coding of Waveforms: Principles and Applications to Speech and Video Coding. Englewood Cliffs, NJ: Prentice-Hall, 1984.
39. A. R. Calderbank and N. J. Sloane, “New trellis codes based on lattices and cosets,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 179–195, Mar. 1987.
40. G. D. Forney, Jr., “Geometrically uniform codes,” IEEE Trens. Inform. Theory, vol. 36, pp. 1241–1260, July 1991.
41. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 55–67, Jan. 1982.
42. L.-F. Wei, “Trellis-coded modulation with multidimensional constellations,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 483–501, July 1987.
43. G. D. Forney, Jr. and L. F. Wei, “Multidimensional constellations—Part I: Introduction, figures of merit and generalized cross constellations,” IEEE J. Select. Areas Commun., vol. 7, pp. 877–892, Aug. 1989.
44. J.M. Wozencraft and I.M. Jacobs, Principles of Communication Engineering. New York: John Wiley, 1965.
45. M. V. Eyuboglu and A. Balamesh, “Lattice and trellis quantization with lattice-and trellis-bounded codebooks—Implementation techniques for memoryless sources,” submitted to IEEE Trans. Inform. Theory, 1991.