[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Complexity Analysis of Adaptive Binary Arithmetic Coding Software Implementations

  • Conference paper
Smart Spaces and Next Generation Wired/Wireless Networking (ruSMART 2011, NEW2AN 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6869))

Abstract

This paper is dedicated to the complexity comparison of adaptive binary arithmetic coding integer software implementations. Firstly, for binary memoryless sources with known probability distribution, we prove that encoding time for arithmetic encoder is a linear function of a number of input binary symbols and source entropy. Secondly, we show that the byte-oriented renormalization allows to decrease encoding time up to 40% in comparison with bit-oriented renormalization. Finally, we study influence of probability estimation algorithm for encoding time and show that probability estimation algorithm using “Virtual Sliding Window“ has less computation complexity than state machine based probability estimation algorithm from H.264/AVC standard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. ITU-T and ISO/IEC JTC1, Digital Compression and cod- ing of continuous-tone still images. ISO/IEC 10918-1 ITU-T Recommendation T.81, JPEG (1992)

    Google Scholar 

  2. ITU-T and ISO/IEC JTC 1, JPEG 2000 Image Coding System: Core Coding System. ITU-T Recommendation T.800 and ISO/IEC 15444-1 JPEG 2000 Part 1 (2000)

    Google Scholar 

  3. Advanced video coding for generic audiovisual services. ITU-T Recommendation H.264 and ISO/IEC 14496-10, AVC (2009)

    Google Scholar 

  4. Eeckhaut, H., Schrauwen, B., Christiaens, M., Campenhout, J.: Speeding up Dirac’s entropy coder. In: Proc. 5th WSEAS Int. Conf. on Multimedia, Internet and Video Technologies, pp. 120–125 (2005)

    Google Scholar 

  5. Pennebaker, W.B., Mitchel, J.L., Langdon, G.G., Arps, R.B.: An overview of the basic principles of the q-coder adaptive binary arithmetic coder. IBM J. Research and Development 32, 717–726 (1988)

    Article  Google Scholar 

  6. Belyaev, E.: Low bit rate video coding based on three-dimensional discrete pseudo cosine transform. In: International Conference on Ultra Modern Telecommunications (2010)

    Google Scholar 

  7. Said, A.: Comparative analysis of arithmetic coding computational complexity. Hewlett-Packard Laboratories Report, HPL-2004-75 (2004)

    Google Scholar 

  8. High Efficiency Video Coding, http://www.h265.net/

  9. Lu, X., Wang, Y., Erkip, E.: Power efficient H.263 video transmission over wireless channels. In: International Conference on Image Processing, pp. 533–536 (2002)

    Google Scholar 

  10. He, Z., Liang, Y., Chen, L., Ahmad, I., Wu, D.: Power-rate-distortion analysis for wireless video communication under energy constraints. IEEE Transactions on Circuits and Systems for Video Technology 15, 645–658 (2005)

    Article  Google Scholar 

  11. Ryabko, B.: Imaginary sliding window as a tool for data compression. Problems of Information Transmission, 156–163 (1996)

    Google Scholar 

  12. Krichevski, E., Trofimov, V.: The performance of universal encoding. IEEE Transactions on Information Theory IT-27, 199–207 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Leighton, T., Rivest, R.L.: Estimating a probability using finite memory. IEEE Transactions on Information Theory IT-32, 733–742 (1986)

    Article  MATH  Google Scholar 

  14. Belyaev, E., Gilmutdinov, M., Turlikov, A.: Binary arithmetic coding system with adaptive probability estimation by Virtual Sliding Window. In: Proceedings of the 10th IEEE International Symposium on Consumer Electronics, pp. 194–198 (2006)

    Google Scholar 

  15. Marpe, D., Schwarz, H., Wiegand, T.: Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard. IEEE Transactions on Circuits and Systems for Video Technology 7, 620–636 (2003)

    Article  Google Scholar 

  16. Schindler, M.A.: Byte oriented arithmetic coding. In: Proceedings of Data Compression Conference (1998)

    Google Scholar 

  17. Vatolin, D.: Data compression methods. Dialog-MIFI Publisher, Moscow (2002) (in Russian)

    Google Scholar 

  18. Lindstrom, P., Isenburg, M.: Fast and Efficient Compression of Floating-Point Data. IEEE Transactions on Visualization and Computer Graphics 12(5), 1245–1250 (2006)

    Article  Google Scholar 

  19. Subbotin, D.: Carryless Rangecoder (1999), http://search.cpan.org/src/SALVA/Compress-PPMd-0.10/Coder.hpp

  20. Ryabko, B.Y., Fionov, A.N.: An efficient method for adaptive arithmetic coding of sources with large alphabets. Problems of Information Transmission 35(4), 95–108 (1999)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Belyaev, E., Veselov, A., Turlikov, A., Kai, L. (2011). Complexity Analysis of Adaptive Binary Arithmetic Coding Software Implementations. In: Balandin, S., Koucheryavy, Y., Hu, H. (eds) Smart Spaces and Next Generation Wired/Wireless Networking. ruSMART NEW2AN 2011 2011. Lecture Notes in Computer Science, vol 6869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22875-9_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22875-9_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22874-2

  • Online ISBN: 978-3-642-22875-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics