A Lagrangian formulation of fixed-rate and entropy / memory constrained quantization 1
暂无分享,去创建一个
[1] Tamás Linder,et al. Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? , 2003, IEEE Trans. Inf. Theory.
[2] James A. Bucklew,et al. Two results on the asymptotic performance of quantizers , 1984, IEEE Trans. Inf. Theory.
[3] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[4] Allen Gersho,et al. Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.
[5] Tamás Linder,et al. A Lagrangian formulation of Zador's entropy-constrained quantization theorem , 2002, IEEE Trans. Inf. Theory.
[6] Paul L. Zador,et al. Asymptotic quantization error of continuous signals and the quantization dimension , 1982, IEEE Trans. Inf. Theory.
[7] S. Graf,et al. Foundations of Quantization for Probability Distributions , 2000 .
[8] Tamás Linder,et al. Results and conjectures on high rate quantization , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.
[9] James A. Bucklew,et al. Multidimensional asymptotic quantization theory with r th power distortion measures , 1982, IEEE Trans. Inf. Theory.
[10] R. Ladner. Entropy-constrained Vector Quantization , 2000 .