A Methodology for Generating Application Specific Tree Multipliers

Low latency, application, specific multipliers are required fo r m,any DSP algorithms. Tree multipliers are an obvious answer to this requirement. However, tree architectures have not been considered for automatic multiplier generation because they have been conszdered to be irregular. I n this paper, a recursive methodology f o r generating n-2 compressors (for n in the range 3 5 n 5 64) using the basic cells 3-2 and 4-2 is presented. This methodology results in a highly regular and modular layout that can be automatically generated. The performance o f the resulting compressors is competitive with detailed full-custom design. The area and latency of the resdting layout for any n is predictable t o a faar degree of accnracy.