By Topic

Bit-plane Golomb coding for sources with Laplacian distributions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
R. Yu ; Labs. for Inf. Technol., A*STAR, Singapore ; C. C. Ko ; S. Rahardja ; X. Lin

This paper presents a bit-plane coding algorithm for Laplacian distributed sources that are commonly encountered in signal compression applications. By exploiting the statistical characteristics of the sources, the proposed algorithm achieves a rate-distortion performance that is essentially comparable to an optimal nonscalable scalar quantizer, while at the same time operates at a complexity level suitable for most practical implementations.

Published in:

Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on  (Volume:4 )

Date of Conference:

6-10 April 2003