Near Optimal, Low Complexity Arithmetic Coding for Generalized Gaussian Sources

Ghido F. Near Optimal, Low Complexity Arithmetic Coding for Generalized Gaussian Sources. In: AES Convention 118. Audio Engineering Society; 2005. Paper 6487. Available from: https://aes.org/publications/elibrary-page/?id=13203

@inproceedings{Ghido2005_13203,
  author = {Ghido, Florin},
  title = {{Near Optimal, Low Complexity Arithmetic Coding for Generalized Gaussian Sources}},
  booktitle = {AES Convention 118},
  note = {Paper 6487},
  year = {2005},
  month = may,
  publisher = {Audio Engineering Society},
  url = {https://aes.org/publications/elibrary-page/?id=13203}
}

TY  - CPAPER
TI  - Near Optimal, Low Complexity Arithmetic Coding for Generalized Gaussian Sources
AU  - Ghido, Florin
T2  - AES Convention 118
M1  - Paper 6487
PY  - 2005
DA  - 2005/05/06
UR  - https://aes.org/publications/elibrary-page/?id=13203
PB  - Audio Engineering Society
LA  - en
AB  - We propose a near optimal, asymmetrical, low complexity, block-based arithmetic coding algorithm for the prediction residuals produced by lossless or lossy audio compression algorithms. The analysis of real-world prediction residuals motivates the use of a modified two-sided continuous generalized Gaussian distribution, pdf(x)=c(p,s)*exp[-(|x|/s)^p], which is mapped to a discrete distribution. Closed form formulas and fast numerical estimates for the block parameters (p,s) are derived. Using a distribution property, precomputed probability tables are obtained for different values of p, independent of s. The compression performance is within 0.2% of a high complexity, symmetrical coder. For very low complexity codes, an alternate coding algorithm is also proposed, employing only bit output, with comparable performance.
ER  -