Average complexity analysis of scalar quantizer design

  • Authors:
  • Jelena Nikolic;Zoran Peric;Dragoljub Pokrajac

  • Affiliations:
  • Telecommunication Department, Faculty of Electronic Engineering Nis, Nis, Serbia;Telecommunication Department, Faculty of Electronic Engineering Nis, Nis, Serbia;Computer and Information Sciences Department and Applied Mathematics Research Center, Delaware State University, Delaware

  • Venue:
  • TELE-INFO'07 Proceedings of the 6th WSEAS Int. Conference on Telecommunications and Informatics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper an exact and complete analysis of average design complexities of Lloyd-Max's scalar quantizers, scalar compandors and scalar quantizers designed using the hybrid model is carried out. The average design complexity depends on arithmetic complexity, memory complexity and implementation complexity. It is demonstrated that for a fixed number of quantizaton levels N, scalar compandors have the smallest and the Lloyd-Max's scalar quantizers have the largest complexity. Furthermore, it is shown that for a fixed number of quantizaton levels N the average design complexity of hybrid scalar quantizers is significantly smaller than the average design complexity of Lloyd-Max's scalar quantizers. Combining this result with the fact that the performances of hybrid scalar quantizers are almost equal to the optimal performances of Lloyd-Max's scalar quantizers, the usability of recently developed hybrid model is confirmed.