On the concurrent update and generation of the dynamic Huffman code

摘要

We propose a concurrent procedure for dynamic Huffman (1952) encoding. The concurrent procedure performs the tree update and code generation processes in parallel and therefore reduces by over 45% the number of steps required by the Knuth's (1985) sequential scheme as shown from our experimental results.