The Prague Stringology Conference 2004

Jan Šupol and Bořivoj Melichar

Arithmetic Coding in Parallel

We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF