Please use this identifier to cite or link to this item:
|Title:||Bit-Plane Golomb Coding for Sources with Laplacian Distributions||Authors:||Yu, R.
|Issue Date:||2003||Citation:||Yu, R.,Ko, C.C.,Rahardja, S.,Lin, X. (2003). Bit-Plane Golomb Coding for Sources with Laplacian Distributions. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings 4 : 277-280. ScholarBank@NUS Repository.||Abstract:||A study was performed on a bit-plane coding algorithm for Laplacian distributed sources. By exploiting the statistical characteristics of the sources, the proposed algorithm achieved a rate-distortion performance comparable to an optimal non-scalable scalar quantizer. It was found that the algorithm operated at a complexity level suitable for most practical implementations.||Source Title:||ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/69514||ISSN:||15206149|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 7, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.