메뉴 건너뛰기




Volumn , Issue , 1993, Pages 22-31

Globally optimal bit allocation

Author keywords

combinatorial optimization; optimal bit allocation; quantization

Indexed keywords

COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION;

EID: 84994287241     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1993.253148     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 1
    • 0024626309 scopus 로고
    • Optimal pruning with applications to tree-structured source coding and modeling
    • P. A. Chou, T. Lookabaugh, and R. M. Gray, "Optimal pruning with applications to tree-structured source coding and modeling," IEEE Trans. Inf. Theory., vol. IT-35, no. 2, pp. 299-315, 1989.
    • (1989) IEEE Trans. Inf. Theory. , vol.IT-35 , Issue.2 , pp. 299-315
    • Chou, P.A.1    Lookabaugh, T.2    Gray, R.M.3
  • 2
    • 5544291423 scopus 로고
    • The complexity of the generalized lloyd-max problem
    • March
    • M. R. Garey, D. S. Johnson, H. S. Witsenhausen, "The complexity of the generalized lloyd-max problem," IEEE Trans. Inf. Theory, vol. IT-28, pp. 255-256, March 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.IT-28 , pp. 255-256
    • Garey, M.R.1    Johnson, D.S.2    Witsenhausen, H.S.3
  • 4
    • 0001101817 scopus 로고
    • Block quantization of correlated Gaussian random variables
    • J. Y. Huang and P. M. Schultheiss, "Block quantization of correlated Gaussian random variables," IEEE Trans. on Comm., vol. 11, p. 289-296, 1963.
    • (1963) IEEE Trans. On Comm. , vol.11 , pp. 289-296
    • Huang, J.Y.1    Schultheiss, P.M.2
  • 5
    • 85063454004 scopus 로고
    • On the complexity of optimal tree pruning for source coding
    • J. Lin, J. Storer, and M. Cohn, "On the complexity of optimal tree pruning for source coding," Information Processing 6 Management, vol. 28, no. 5, 1992.
    • (1992) Information Processing 6 Management , vol.28 , Issue.5
    • Lin, J.1    Storer, J.2    Cohn, M.3
  • 6
    • 0026116755 scopus 로고
    • Optimal bit allocation via the generalized BFOS algorithm
    • E. A. Riskin, "Optimal bit allocation via the generalized BFOS algorithm," IEEE Trans. Inform. Theory, vol. 37, p. 400-402, 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 400-402
    • Riskin, E.A.1
  • 7
    • 0016931516 scopus 로고
    • Bit allocation and encoding for vector sources
    • A. Segal, "Bit allocation and encoding for vector sources," IEEE Trans. Inj. Theory, vol. 22, p. 162-169, 1976.
    • (1976) IEEE Trans. Inj. Theory , vol.22 , pp. 162-169
    • Segal, A.1
  • 8
    • 0024077116 scopus 로고
    • Efficient bit allocation for an arbitrary set of quantizers
    • Y. Shoham and A. Gersho, "Efficient bit allocation for an arbitrary set of quantizers," IEEE Trans. Acoust. Speech, Signal Process., vol. 36, no. 9, p. 1445-1453, 1988.
    • (1988) IEEE Trans. Acoust. Speech, Signal Process. , vol.36 , Issue.9 , pp. 1445-1453
    • Shoham, Y.1    Gersho, A.2
  • 9
    • 38149145478 scopus 로고
    • Optimal quantization by matrix-searching
    • Dec.
    • X. Wu, "Optimal Quantization by Matrix-Searching," Journal of Algorithms, vol. 12, no. 4, p. 663-673, Dec. 1991.
    • (1991) Journal of Algorithms , vol.12 , Issue.4 , pp. 663-673
    • Wu, X.1
  • 10
    • 85063447772 scopus 로고    scopus 로고
    • Quantizer monotonicities and globally optimal scalar quantizer design
    • to appear
    • X. Wu and K. Zhang, "Quantizer Monotonicities and Globally Optimal Scalar Quantizer Design," IEEE Trans. on Information Theory, (to appear).
    • IEEE Trans. On Information Theory
    • Wu, X.1    Zhang, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.