By Topic

Memory-Efficient Semi-Quasi Renormalization for Arithmetic Coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Danny Hong ; Dept. of Electr. Eng., Columbia Univ., New York, NY ; Alexandros Eleftheriadis

We propose a highly efficient, look-up table-based, renormalization method that can be used by any binary arithmetic encoder with the follow-on procedure. It replaces the time-consuming branching operations in the renormalization process with table look-ups and some simple bit-wise operations. We show that our new renormalization method outperforms the currently used ones with much less memory requirement than the previously known, table-based quasi-coder

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:17 ,  Issue: 1 )