Optimum Placement and Routing of Multiplier Partial Product Trees


An algorithm that builds a multiplier under the constraint of a limited number of wiring tracks is designed. The algorithm has been implemented. The program is then used to compare several designs of an IEEE oating point multiplier using several delay models. 


8 Figures and Tables