Optimum Quantizer Performance for a Class of Non-Gaussian Memoryless Sources

IEEE Transactions on Information Theory

Volumn 30, Issue 3, 1984, Pages 485-497

  Farvardin, Nariman ^a   Modestino, James W ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMUM QUANTIZERS; SOURCE CODING;

CODES, SYMBOLIC;

EID: 0021422549     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056920     Document Type: Article

References (21)

1. S. P. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 129–137, Mar. 1982.
2. J. Max, “Quantization for minimum distortion,” IEEE Trans. Inform. Theory, vol. IT-6, pp. 7–12, Mar. 1960.
3. P. E. Fleischer, “Sufficient conditions for achieving minimum distortion in a quantizer,” IEEE Int. Conv. Rec., Part 1, pp. 104–111, 1964.
4. T. Berger, “Optimum quantizers and permutation codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 759–765, Nov, 1972.
5. A. N. Netravali and R. Saigal, “Optimum quantization design using a fixed-point algorithm,” Bell Syst. Tech. J., vol. 55, no. 9, pp. 1423–1435, Nov. 1976.
6. D. K. Sharma, “Design of absolutely optimal quantizers for a wide class of distortion measures,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 693–702, Nov. 1978.
7. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice Hall, 1971.
8. T. J. Goblick and J. L. Holsinger, “Analog source digitization: A comparison of theory and practice,” IEEE Trans. Inform. Theory, vol. IT-13, 323–326, Apr. 1967.
9. H. Gish and J. N. Pierce, “Asymptotically efficient quantizing,” IEEE Trans. Inform. Theory, vol. IT-14, 676–683, Sept. 1968.
10. 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.
11. F. Jelinek, “Buffer overflow in variable length coding of fixed rate sources,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 490–501, May 1968.
12. 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.
13. M. S. Bazaraa and C. M. Shetty, Nonlinear Programming. New York: Wiley, 1979.
14. T. Berger, “Minimum entropy quantizers and permutation codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 149–157, Mar. 1982.
15. V. R. Algazi and R. M. Lerner, “Binary detection in white non-Gaussian noise,” Tech. Rep. DS-2138, M.I.T. Lincoln Lab., Lexington, MA, 1965.
16. R. C. Wood, “On optimum quantization,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 248–252, Mar. 1969.
17. R. E. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 460–473, July 1972.
18. J. C. Kieffer, “Exponential rate of convergence for Lloyd’s method I,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 205–210, Mar. 1982.
19. R. M. Gray and E. D. Karnin, “Multiple local optima in vector quantizers,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 256–261, Mar. 1982.
20. J. W. Modestino, “Adaptive nonparametric detection techniques,” in Nonparametric Methods in Communications, P. Papantoni-Kazakos and D. Kazakos, Eds. New York: Marcel Dekker, 1977, pp. 29–65.
21. D. L. Neuhoff and R. K. Gilbert, “Causal source codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 701–713, Sept. 1982.