White Papers

Comparative Analysis of Arithmetic Coding Computational Complexity

Overview Some long-held assumptions about the most demanding computations for arithmetic coding are now obsolete due to new hardware. For instance, it is not advantageous to replace multiplication - which now can be done with high precision in a single CPU clock cycle - with comparisons and table-based approximations. A good understanding of the cost of the arithmetic coding computations is needed to design efficient implementations for the current and future processors. This paper profiles these computations by comparing the running times of many implementations, is trying to change at most one part at a time, and avoiding small effects being masked by much larger ones.

Further White Paper Details
PublisherHewlett-Packard File FormatPDF
Date PublishedApril 2004
FormatWhite Papers   
Topics
    N/A