High efficiency, multiplication free approximation of arithmetic coding

Abstract

An alternative procedure for reducing the computational complexity, which is applicable to both binary and multialphabet arithmetic coding, is described and its performance analysed with respect to the small increase in code length.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>