• DocumentCode
    1007961
  • Title

    Quantizer monotonicities and globally optimal scalar quantizer design

  • Author

    Wu, Xiaolin ; Zhang, Kaizhong

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Western Ontario, London, Ont., Canada
  • Volume
    39
  • Issue
    3
  • fYear
    1993
  • fDate
    5/1/1993 12:00:00 AM
  • Firstpage
    1049
  • Lastpage
    1053
  • Abstract
    New monotonicity properties of optimal scalar quantizers are discussed. These monotonicities reveal a globally optimal scalar quantizer structure depending on the probability mass functions and on the number of quantizer levels. By incorporating the monotone quantizer structure into a dynamic programming process, the time complexities of previous algorithms for designing globally optimal scalar quantizers can be significantly reduced for very general classes of distortion measures
  • Keywords
    computational complexity; data compression; dynamic programming; encoding; distortion measures; dynamic programming process; globally optimal scalar quantizer design; matrix search algorithm; monotonicity properties; probability mass functions; time complexities; Algorithm design and analysis; Computer science; Density functional theory; Distortion measurement; Dynamic programming; Gas insulated transmission lines; Heuristic algorithms; Polynomials; Time measurement; Vector quantization;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.256513
  • Filename
    256513