Bibliography

1

Y. L. Linde, A. Buzo, and R. M. Gray, ``An algorithm for vector quantizer design,'' IEEE Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.

2

S. G. Wilson and D. W. Lytle, ``Trellis encoding of continuous-amplitude memoryless sources,'' IEEE Trans. Inform. Theory, vol. IT-23, pp. 404-409, May 1977.

3

W. A. Pearlman, ``Sliding-block and random source coding with constrained size reproduction alphabets,'' IEEE Trans. Commun., vol. COM-30, pp. 1859-1867, Aug. 1982.

4

A. Gersho and R. M. Gray, Vector Quantization and Signal Compression.
Boston, MA: Kluwer Academic Publishers, 1993.

5

J. Hamkins and K. Zeger, ``Asymptotically efficient spherical codes--Part I: Wrapped spherical codes,'' IEEE Trans. Inform. Theory, vol. 43, pp. 1774-1785, Nov. 1997.

6

P. Vogel, ``Analytical coding of Gaussian sources,'' IEEE Trans. Inform. Theory, vol. 40, pp. 1639-1645, Sept. 1994.

7

P. F. Swaszek and J. B. Thomas, ``Multidimensional spherical coordinates quantization,'' IEEE Trans. Inform. Theory, vol. IT-29, pp. 570-576, July 1983.

8

H.-C. Tseng and T. R. Fischer, ``Transform and hybrid transform/DPCM coding of images using pyramid vector quantization,'' IEEE Trans. Commun., vol. COM-35, pp. 79-86, 1987.

9

T. R. Fischer and K. Malone, ``Transform coding of speech with pyramid vector quantization,'' in Conf. Rec. MILCOM, pp. 620-623, 1985.

10

K. Popat and K. Zeger, ``Robust quantization of memoryless sources using dispersive FIR filters,'' IEEE Trans. Commun., vol. 40, pp. 1670-1674, Nov. 1992.

11

R. Gallager, Information Theory and Reliable Communication.
New York, NY: Wiley, 1968.

12

J.-P. Adoul, C. Lamblin, and A. Leguyader, ``Base-band speech coding at 2400 bps using spherical vector quantization,'' in IEEE Int. Conf. Acoustics, Speech, Signal Processing, pp. 1.12.1-1.12.4, 1984.

13

M. V. Eyuboglu and G. D. Forney, ``Lattice and trellis quantization with lattice- and trellis-bounded codebooks--high-rate theory for memoryless sources,'' IEEE Trans. Inform. Theory, vol. 39, pp. 46-59, Jan. 1993.

14

T. R. Fischer, ``A pyramid vector quantizer,'' IEEE Trans. Inform. Theory, vol. IT-32, pp. 568-583, July 1986.

15

T. R. Fischer, ``Geometric source coding and vector quantization,'' IEEE Trans. Inform. Theory, vol. 35, pp. 137-145, Jan. 1989.

16

D. G. Jeong and J. D. Gibson, ``Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sources,'' IEEE Trans. Inform. Theory, vol. 39, pp. 786-803, May 1993.

17

N. S. Jayant and P. Noll, Digital Coding of Waveforms.
Englewood Cliffs, NJ: Prentice-Hall, 1984.

18

J. Max, ``Quantizing for minimum distortion,'' IRE Trans. Inform. Theory, vol. 6, pp. 7-12, March 1960.

19

M. W. Marcellin, ``On entropy-constrained trellis coded quantization,'' IEEE Trans. Commun., vol. 42, pp. 14-16, Jan. 1994.

20

M. W. Marcellin and T. Fischer, ``Trellis coded quantization of memoryless and Gauss-Markov sources,'' IEEE Trans. Commun., vol. 38, pp. 82-93, Jan. 1990.

21

D. Miller, K. Rose, and P. A. Chou, ``Deterministic annealing for trellis quantizer and HMM design using Baum-Welch re-estimation,'' in IEEE Int. Conf. Acoustics, Speech, Signal Processing, pp. V-261-V-264, Apr. 1994.

22

P. Noll and R. Zelinski, ``Bounds on quantizer performance in the low bit-rate region,'' IEEE Trans. Commun., vol. COM-26, pp. 300-304, Feb. 1978.

23

J. Pan and T. R. Fischer, ``Two-stage vector quantization--lattice vector quantization,'' IEEE Trans. Inform. Theory, vol. 41, pp. 155-163, Jan. 1995.

24

M. C. Rost and K. Sayood, ``The root lattices as low bit rate vector quantizers,'' IEEE Trans. Inform. Theory, vol. 34, pp. 1053-1058, Sept. 1988.

25

D. J. Sakrison, ``A geometric treatment of the source encoding of a Gaussian random variable,'' IEEE Trans. Inform. Theory, vol. IT-14, pp. 481-486, May 1968.

26

H. S. Wang and N. Moayeri, ``Trellis coded vector quantization,'' IEEE Trans. Commun., vol. 40, pp. 1273-1276, Aug. 1992.

27

S. D. Servetto, ``Lattice quantization with side information,'' in Proceedings of the Data Compression Conference, (Snowbird, Utah), pp. 510-519, Mar. 2000.

28

F. Chen, Z. Gao, and K. Zeger, ``Lattice vector quantization of generalized gaussian sources,'' IEEE Trans. Inform. Theory, vol. 43, pp. 92-103, Jan. 1997.

29

K. Miller, Multidimensional Gaussian Distributions.
New York, NY: John Wiley, 1964.

30

J. Hamkins, Design and Analysis of Spherical Codes.
PhD thesis, University of Illinois at Urbana-Champaign, Sept. 1996.

31

J. D. Gibson and K. Sayood, ``Lattice quantization,'' in Adv. Electronics Electron Phys. (P. Hawkes, ed.), vol. 72, pp. 259-330, New York: Academic, 1988.

32

A. Gersho, ``Asymptotically optimal block quantization,'' IEEE Trans. Inform. Theory, vol. IT-25, pp. 373-380, July 1979.

33

S. P. Lloyd, ``Least squares quantization in PCM,'' IEEE Trans. Inform. Theory, vol. 28, pp. 129-136, Mar. 1982.

34

P. E. Fleischer, ``Sufficient conditions for achieving minimum distortion in a quantizer,'' IEEE Int. Conv. Rec., Part 1, pp. 104-111, 1964.

35

A. V. Trushkin, ``Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions,'' IEEE Trans. Inform. Theory, vol. IT-28, pp. 187-198, Mar. 1982.

36

P. Moo and D. Neuhoff, ``An asymptotic analysis of fixed-rate lattice vector quantization,'' in Proc. Int. Symp. Inform. Theory and its Applications, pp. 409-412, Sept. 1996.

37

J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups.
Springer-Verlag, 1988.

38

W. H. Press, W. T. Vetterling, S. A. Teukolsky, and B. P. Flannery, Numerical Recipes in C.
New York: Cambridge University Press, 1992.

39

W. H. Beyer, CRC Standard Mathematical Tables.
Boca Raton, FL: CRC Press, Inc., 26th ed., 1981.

40

J.-P. Adoul and M. Barth, ``Nearest neighbor algorithm for spherical codes from the Leech lattice,'' IEEE Trans. Inform. Theory, vol. 34, pp. 1188-1202, Sept. 1988.

41

Y. Be'ery, B. Shahar, and J. Snyders, ``Fast decoding of the Leech lattice,'' IEEE J. Select. Area Commun., vol. 7, pp. 959-966, Aug. 1989.

42

R. Laroia and N. Farvardin, ``Trellis-based scalar-vector quantizer for memoryless sources,'' IEEE Trans. Inform. Theory, vol. 40, pp. 860-870, May 1994.

43

S. G. Wilson and D. W. Lytle, ``Trellis encoding of continuous-amplitude memoryless sources,'' IEEE Trans. Inform. Theory, vol. IT-28, pp. 211-226, May 1982.

44

S. G. Wilson, ``Magnitude/phase quantization of independent gaussian variates,'' IEEE Trans. Commun., vol. COM-28, pp. 1924-1929, Nov. 1980.

45

A. Vardy and Y. Be'ery, ``Maximum likelihood decoding of the Leech lattice,'' IEEE Trans. Inform. Theory, vol. 39, pp. 1435-1444, July 1993.

46

K. T. Malone and T. R. Fischer, ``Contour-gain vector quantization,'' IEEE Trans. Acoust. Speech Sig. Process., vol. 36, pp. 862-870, June 1988.

47

R. E. A. C. Paley, ``On orthogonal matrices,'' J. Math. Phys., vol. 12, pp. 311-320, 1933.