Abstract :
Three algorithms are given to construct a weighted r-ary tree with a given set of integer weighted leaves in which the weight of a parent node is 1 + max of its sons. Two goals are of interest; to minimize 1) the weight of the root of the tree, and 2) the number of internal nodes.
Keywords :
Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.; Feedback; Hazards; Merging; Performance analysis; Phase detection; Sequential circuits; Signal analysis; Signal detection; Signal processing; Testing; Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.;
