Optimization of Quantizer’s Segment Threshold Using Spline Approximations for Optimal Compressor Function


In this paper, the optimization of quantizer’s segment threshold is done. The quantizer is designed on the basis of approximative spline functions. Coefficients on which we form approximative spline functions are calculated by minimization mean square error (MSE). For coefficients determined in this way, spline functions by which optimal compressor function is approximated are obtained. For the quantizer designed on the basis of approximative spline functions, segment threshold is numerically determined depending on maximal value of the signal to quantization noise ratio (SQNR). Thus, quantizer with optimized segment threshold is achieved. It is shown that by quantizer model designed in this way and proposed in this paper, the SQNR that is very close to SQNR of nonlinear optimal companding quantizer is achieved.

Share and Cite:

L. Velimirović, Z. Perić, M. Stanković and J. Nikolić, "Optimization of Quantizer’s Segment Threshold Using Spline Approximations for Optimal Compressor Function," Applied Mathematics, Vol. 3 No. 10A, 2012, pp. 1430-1434. doi: 10.4236/am.2012.330201.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] N. S. Jayant and P. Noll, “Digital Coding of Waveforms, Principles and Applications to Speech and Video,” Prentice Hall Secondary Education Division, Upper Saddle River, 1984.
[2] A. Gersho and R. M. Gray, “Vector Quantization and Signal Compression,” Kluwer Academic Publishers, Boston, Dordrecht, London, 1992. doi:10.1007/978-1-4615-3626-0
[3] L. R. Rabiner and R. W. Schafer, “Introduction to Digital Speech Processing,” Foundations and Trends in Signal Processing, Hanover, 2007.
[4] J. Nikoli?, Z. Peri?, D. Anti?, A. Jovanovi? and D. Deni?, “Low Complex Forward Adaptive Loss Compression Algorithm and ITS Aplication in Speech Coding,” Journal of Electrical Engineering, Vol. 62, No. 1, 2011, pp. 19-24. doi:10.2478/v10187-011-0003-5
[5] Z. Peri?, M. Petkovi? and M. Din?i?, “Simple Compression Algorithm for Memoryless Laplacian Source Based on the Optimal Companding Technique,” Informatica, Vol. 20, No.1, 2009, pp. 99-114.
[6] Z. Peri? and J. Nikoli?, “Analysis of Compressor Function for Laplacian Source’s Scalar Compandor Construction,” Data Recording, Storage and Processing, Vol. 8, No. 2, 2006, pp. 15-24.
[7] L. Velimirovi?, Z. Peri?, J. Nikoli? and M. Stankovi?, “Design of Compandor Quantizer for Laplacian Source for Medium Bit Rate Using Spline Approximations,” Facta Universitatis, Vol. 25, No. 1, 2012, pp. 90-102.
[8] S. Na, “On the Support of Fixed-Rate Minimum MeanSquared Error Scalar Quantizers for a Laplacian Source,” IEEE Transactions on Information Theory, Vol. 50, No. 5, 2004, pp. 937-944. doi:10.1109/TIT.2004.826686
[9] Z. Peri?, J. Nikoli? and D. Pokrajac, “Estimation of the Support Region for Laplacian Source Scalar Quantizers,” Journal of Electrical Engineering, Vol. 58, No. 1, 2007, pp. 47-51.
[10] Z. Peri?, J. Nikoli? and D. Pokrajac, “Analysis of Support Region for Laplacian Source’s Scalar Quantizers,” Proceedings of 7th IEEE Conference on Telecommunications in Modern Satelite, Cable and Broadcasting Services TELSIKS 2005, Ni?, 28-30 September 2005, Vol. 2, pp. 491-494.
[11] W. Cheney and D. Kincaid, “Numerical Mathematics and Computing,” 6th Edition, Thomson Higher Education, Belmont, 2008.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.