| 2/2013 - 6 |
Asymmetrical Two-Level Scalar Quantizer with Extended Huffman Coding for Compression of Laplacian SourcePERIC, Z.   , NIKOLIC, J. , VELIMIROVIC, L. , STANKOVIC, M. , ALEKSIC, D. |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (656 KB) | Citation | Downloads: 935 | Views: 4,770 |
Author keywords
distortion, entropy coding, Huffman coding, quantization, signal to noise ratio
References keywords
huffman(5), introduction(4), coding(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2013-05-31
Volume 13, Issue 2, Year 2013, On page(s): 39 - 42
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2013.02006
Web of Science Accession Number: 000322179400006
SCOPUS ID: 84878941715
Abstract
This paper proposes a novel model of the two-level scalar quantizer with extended Huffman coding. It is designed for the average bit rate to approach the source entropy as close as possible provided that the signal to quantization noise ratio (SQNR) value does not decrease more than 1 dB from the optimal SQNR value. Assuming the asymmetry of representation levels for the symmetric Laplacian probability density function, the unequal probabilities of representation levels are obtained, i.e. the proper basis for further implementation of lossless compression techniques is provided. In this paper, we are concerned with extended Huffman coding technique that provides the shortest length of codewords for blocks of two or more symbols. For the proposed quantizer with extended Huffman coding the convergence of the average bit rate to the source entropy is examined in the case of two to five symbol blocks. It is shown that the higher SQNR is achieved by the proposed asymmetrical quantizer with extended Huffman coding when compared with the symmetrical quantizers with extended Huffman coding having equal average bit rates. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] N. S. Jayant, P. Noll, Digital Coding of Waveforms: Principles and Applications to Speech and Video, New Jersey, Prentice Hall, 1984.
[2] D. C. Hankerson, G. A. Harris, P. D. Johnson, Introduction to Information Theory and Data Compression, Boca Raton, Chapman & Hall/CRC, 2003. [CrossRef] [3] L. Hanzo, C. Somerville, J. Woodard, Voice and Audio Compression for Wireless Communications, London, John Wiley & Sons, 2007. [CrossRef] [SCOPUS Times Cited 61] [4] K. Sayood, Introduction to Data Compression, San Francisco, Elsevier, 2006. [5] D. Salomon, A Concise Introduction to Data Compression, New York, Springer, 2008. [CrossRef] [6] A. R. Elabdalla, M. Irshid, "An Efficient Bitwise Huffman Coding Technique Based on Source Mapping", Computer and Electrical Engineering, Vol. 27, pp. 265-272, 2001. [CrossRef] [Web of Science Times Cited 16] [SCOPUS Times Cited 19] [7] A. Zolghadr-E-Asli, S. Alipour, "An Effective Method for Still Image Compression/ Decompression for Transmission on PSTN Lines Based on Modifications of Huffman Coding", Computer and Electrical Engineering, Vol. 30, pp. 129-145, 2004. [CrossRef] [Web of Science Times Cited 9] [SCOPUS Times Cited 11] [8] R. L. Rabiner, W. R.Schafer, "Introduction to Digital Speech Processing", Foundations and Trends in Signal Processing, Vol. 1, pp 1-194, 2007. [CrossRef] [Web of Science Times Cited 196] [SCOPUS Times Cited 230] [9] P. Fenwick, "Huffman Code Efficiencies for Extensions of Sources", IEEE Transaction on Communications, Vol 43, pp. 163-165, 1995. [CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 8] [10] M. Dincic, Z. Peric, "Design of Quantizers with Huffman Coding for Laplacian Source", Electronics and Electrical Engineering, Vol. 10, pp. 129-132, 2010. [11] Z. Peric, J. Nikolic, "An Effective Method for Initialization of Lloyd-Max's Algorithm of Optimal Scalar Quantization for Laplacian Source", Informatica, Vol. 18, pp. 279-288, 2007. [12] D. Marco, D. L. Neuhoff, "Low-Resolution Scalar Quantization for Gaussian and Laplacian Sources with Absolute and Squared Error Distortion Measures", Technical report, 2006. [13] Z. Peric, M. Dincic, M. Petkovic, "Design of a Hybrid Quantizer with Variable Length Code", Fundamenta informaticae , Vol. 98, pp. 233-256, 2010. [14] K. Fredriksson, J. Tarhio, "Efficient String Matching in Huffman Compressed Texts", Fundamenta Informaticae, Vol. 62, pp. 1-16, 2004. [15] V. Despotovic, Z. Peric, L. Velimirovic, V. Delic, "DPCM with forward gain-adaptive quantizer and switched first order predictor for high quality speech signals", Advances in Electrical and Computer Engineering, Vol. 10, pp. 95-98, 2010. [CrossRef] [Full Text] [Web of Science Times Cited 10] [SCOPUS Times Cited 11] [16] V. Despotovic, Z. Peric, "ADPCM Using a Second-order Switched Predictor and Adaptive Quantizer", Advances in Electrical and Computer Engineering, Vol. 11, pp. 61-61, 2011. [CrossRef] [Full Text] [Web of Science Times Cited 4] [SCOPUS Times Cited 4] Web of Science® Citations for all references: 240 TCR SCOPUS® Citations for all references: 344 TCR Web of Science® Average Citations per reference: 14 ACR SCOPUS® Average Citations per reference: 20 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-11-14 03:27 in 64 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
