ARITHMETIC CODING IN PARALLEL
Jan Šupol, Bořivoj Melichar · International Journal of Foundations of Computer Science · 2005
We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in [Formula: see text] time using n/log n processors. Each part of the algorithm as well as a well-known parallel prefix computation forming a basis of the algorithm are clarified on simple examples.