Variable-rate trellis source encoding

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 586-608

  Yang, En Hui ^a   Zhang, Zhen ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Arithmetic coding; Data compression; Quantization; Rate distortion function; Stationary and ergodic sources; Variable rate trellis source encoding

Indexed keywords

ALGORITHMS; CORRELATION THEORY; DATA COMPRESSION; DECODING; MARKOV PROCESSES; SIGNAL DISTORTION; SIGNAL ENCODING;

ARITHMETIC CODING; RATE-DISTORTION FUNCTIONS; VARIABLE-RATE TRELLIS SOURCE ENCODING;

TRELLIS CODES;

EID: 0033101247     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.749005     Document Type: Article

References (61)

1. J.B. Andersen and S. Mohan, Source and Channel Coding. Norwell, MA: Kluwer, 1991.
2. "Sequential encoding algorithms: A survey and cost analysis," IEEE Trans. Commun, vol. COM-32, pp. 169-176, Feb. 1984.
3. S. Arimoto, "An algorithm for computing capacity of arbitrary discrete memoryless channels," IEEE Trans. Inform. Theory, vol. IT-18, pp. 14-20, Jan. 1972.
4. E. Ayanoglu and R. M. Gray, "The design of predictive trellis waveform coders using the generalized Lloyd algorithm," IEEE Trans. Commun., vol. COM-34, pp. 1073-1080, Nov. 1986.
5. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice Hall, 1971.
6. "Minimum entropy quantizers and permutation codes," IEEE Trans. Inform. Theory, vol. IT-28, pp. 149-156, Mar. 1982.
7. P. Billingsley, Convergence of Probability Measures. New York: Wiley, 1968.
8. Probability and Measure. New York: Wiley, 1979.
9. R.E. Blahut, "Computation of channel capacity and rate distortion functions," IEEE Trans. Inform. Theory, vol. IT-18, pp. 460173, July 1972.
10. P.A. Chou, T. Lookabaugh, and R. M. Gray, "Entropy-constrained vector quantization," IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 31-42, Jan. 1989.
11. P.A. Chou and T. Lookabaugh, "Conditional entropy-constrained vector quantization of linear predictive coefficients," in P roc. 1990 IEEE Int. Conf. Acoustics, Speech, and Signal Processing (Albuquerque, NM, Apr. 1990), vol. 1, pp. 197-200.
12. P.A. Chou, M. Effros, and R. M. Gray, "A vector quantization approach to universal noiseless coding and quantization," IEEE Trans. Inform. Theory, vol. 42, pp. 1109-1138, July 1996.
13. T.M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
14. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
15. R.J. Dick, T. Berger, and F. Jelinek, "Tree-encoding of Gaussian sources," IEEE Trans. Inform. Theory, vol. IT-20, pp. 332-336, May 1974.
16. M. Effros, P. A. Chou, and R. M. Gray, "Variable-rate source coding theorems for stationary nonergodic sources," IEEE Trans. Inform. Theory, vol. 40, pp. 1920-1925, Nov. 1994.
17. 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. 48597, May 1984.
18. W.A. Finamore and W. A. Pearlman, "Optimal encoding of discretetime continuous-amplitude memoryless sources with finite output alphabets," IEEE Trans. Inform. Theory, vol. IT-26, pp. 144-155, Mar. 1980.
19. T.R. Fischer, M. W. Marcellin, and M. Wang, "Trellis-coded vector quantization," IEEE Trans. Inform. Theory, vol. 37, pp. 1551-1566, Nov. 1991.
20. T.R. Fischer and M. Wang, "Entropy-constrained trellis-coded quantization," IEEE Trans. Inform. Theory, vol. 38, pp. 415126, Mar. 1992.
21. G.D. Forney Jr., "The Viterbi algorithm," P roc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
22. G.H. Freeman, I. F. Blake, and J. W. Mark, "Trellis source code design as an optimization problem," IEEE Trans. Inform. Theory, vol. 34, pp. 1226-1241, Sept. 1988.
23. G.H. Freeman, J. W. Mark, and I. F. Blake, "Trellis source codes designed by conjugate gradient optimization," IEEE Trans. Commun., vol. 36, pp. 1-12, Jan. 1988.
24. N.T. Gaarder and D. Slepian, "On optimal finite-state digital transmission systems," IEEE Trans. Inform. Theory, vol. IT-28, pp. 167-186, Mar. 1982.
25. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
26. "Tree encoding for sources with a distortion measure," IEEE Trans. Inform. Theory, vol. IT-20, pp. 65-76, Jan. 1974.
27. A. Gersho, "Asymptotically optimal block quantization," IEEE Trans. Inform. Theory, vol. IT-25, pp. 373-380, July 1979.
28. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Norwell, MA: Kluwer, 1992.
29. H. Gish and N. J. Pierce, "Asymptotically efficient quantizing," IEEE Trans. Inform. Theory, vol. IT-14, pp. 676-683, Sept. 1968.
30. T.J. Goblick Jr., and J. L. Holsinger, "Analog source digitization: A comparison of theory and practice," IEEE Trans. Inform. Theory, vol. IT-13, pp. 323-326, Apr. 1967.
31. R.M. Gray, Source Coding Theory. Norwell, MA: Kluwer, 1990.
32. "Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-23, pp. 71-83, 1977.
33. Probability, Random Processes, and Ergodic Properties. New York: Springer-Verlag, 1988.
34. R.M. Gray and L. D. Davisson, "The ergodic decomposition of discrete stationary random processes," IEEE Trans. Inform. Theory, vol. IT-20, pp. 625-636, Sept. 1974.
35. R.M. Gray, D. L. Neuhoff, and D. S. Ornstein, "Nonblock source coding with a fidelity criterion," A. Probab., vol. 3, no. 3, pp. 478191, June 1975.
36. T. Hashimoto, "A list-type reduced constraint generalization of the Viterbi algorithm," IEEE Trans. Inform. Theory, vol. IT-33, pp. 866-876, 1987.
37. F. Jelinek, "Tree encoding of memoryless time-discrete sources with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-15, pp. 584-590, Sept. 1969.
38. J.C. Kieffer, "Extension of source coding theorems for block codes to sliding-block codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 679-692, 1980.
39. "Stochastic stability for feedback quantization schemes," IEEE Trans. Inform. Theory, vol. IT-28, pp. 248-254, Mar. 1982.
40. "Design of universal lossy data compression algorithms using universal lossless algorithms" (seminar note on information theory at the University of Minnesota), 1994.
41. S.P. Lloyd, "Least squares quantization in PCM," IEEE Trans. Inform. Theory, vol. IT-28, pp. 127-135, Mar. 1982.
42. 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.
43. J. Muramatsu and F. Kanaya, "Distortion-complexity and rate-distortion function," IEICE Trans. Fundamentals, vol. E77-A, pp. 1224-1229, 1994.
44. R. Pasoc, "Source coding algorithms for fast data compression," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1976.
45. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Res. Devel, vol. 20, pp. 198-203, 1976.
46. "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, 1986.
47. L.C. Stewart, R. M. Gray, and Y. Linde, "The design of trellis waveform coders," IEEE Trans. Commun., vol. COM-30, pp. 702-710, Apr. 1982.
48. A.J. Viterbi and J. K. Omura, "Trellis encoding of memoryless discrete-time sources with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-20, pp. 325-332, May 1974.
49. E.-h. Yang, "Universal almost sure data compression for abstract alphabets and arbitrary fidelity criteria," Probl. Contr. and Inform. Theory, vol. 20, no. 6, pp. 39708, 1991.
50. E.-h. Yang and J. C. Kieffer, "Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 42, pp. 239-245, Jan. 1996.
51. [51 ] "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, Jan. 1998.
52. E.-h. Yang and S.-Y. Shen, "Distortion program-size complexity with respect to a fidelity criterion and rate distortion function," IEEE Trans. Inform. Theory, vol. 39, pp. 288-292, Jan. 1993.
53. E.-h. Yang, Z. Zhang, and T. Berger, "Fixed-slope universal algorithms for lossy source coding via lossless codeword length functions," in Proc. IEEE ISIT'95 (Whistler, BC, Canada), p. 79.
54. "Fixed slope universal lossy data compression," IEEE Trans. Inform. Theory, vol. 43, pp. 1465-1476, Sept. 1997.
55. P.L. Zador, "Asymptotic quantization error of continuous signals and the quantization dimension," IEEE Trans. Inform. Theory, vol. IT-28, pp. 139-148, Mar. 1982.
56. Z. Zhang, E.-H. Yang, and V. K. Wei, "The redundancy of source coding with a fidelity criterion-Part I: Known statistics," IEEE Trans. Inform. Theory, vol. 43, pp. 71-91, Jan. 1997.
57. Z. Zhang and E.-h. Yang, "An on-line universal lossy data compression algorithm via continuous codebook refinement: Part II-Optimality for phi-mixing sources models," IEEE Trans. Inform. Theory, vol. 42, pp. 822-836, May 1996.
58. Z. Zhang and V. K. Wei, "An on-line universal lossy data compression algorithm via continuous codebook refinement," IEEE Trans. Inform. Theory, vol. 42, pp. 803-821, May 1996.
59. J. Ziv, "On universal quantization," IEEE Trans. Inform. Theory, vol. IT-31, pp. 344-347, May 1985.
60. "Distortion-rate theory for individual sequences," IEEE Trans. Inform. Theory, vol. IT-26, pp. 137-143, 1980.
61. J. Ziv and A. Lempel, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.