Bit-plane arithmetic coding for Laplacian source
Hongtao Huang, Haiyan Shu, Susanto Rahardja · 2010
For bit-plane coding of random source, we establish a relationship between the probability density function of an arbitrary non-negative distribution and the bit-plane symbol probability. Applied to Laplacian source, the relationship gives a simple, closed form of bit-plane symbol probability, which is a superset of the probability assignment rule adopted in the MPEG-4 Audio Scalable Lossless Coding (SLS) international standard. For bit-plane arithmetic coding of Laplacian source, we propose an algorithm and apply it to MPEG-4 SLS. Experimental results show that without changing the encoder/decoder complexity, the proposed algorithm consistently improved the compression ratio over SLS for all the 51 MPEG test sequences. The overall improvement in the compression ratio is 0.11%.