Issue No. 05 - May (1979 vol. 28)

ISSN: 0018-9340

pp: 365-367

D.S., Jr Parker , Department of Computer Science, University of California

ABSTRACT

Huffman's algorithm produces an optimal weighted r-ary tree on a given set of leaf weights, where the weight of any parent node is the maximum of the son weights plus some positive constant. If the weights are viewed as (parallel) completion times, the algorithm has useful applications to combinatorial circuit design? especially for merging, or "fanning-in," a set of inputs with varying ready times: the weight of the tree's root node is then the completion time of the whole merging process. In this note we give new, tight upper and lower bounds on the weight of this root node (extending some work of Golumbic), and briefly describe an application in multiplexor design which exercises both of these bounds.

INDEX TERMS

R?nyi entropy., Bounds, Huffman tree construction, multiplexors, noiseless coding theorem

CITATION

D.S., Jr Parker, "Combinatorial Merging and Huffman's Algorithm",

*IEEE Transactions on Computers*, vol. 28, no. , pp. 365-367, May 1979, doi:10.1109/TC.1979.1675367