Optimization of Column Compression Multipliers

Optimization of Column Compression Multipliers

4.11 - 1251 ratings - Source

With delay proportional to the logarithm of the multiplier word length, column compression multipliers are the fastest multipliers. Unfortunately, since the design community has assumed that fast multiplication can only be realized through custom design and layout, column compression multipliers are often dismissed as too time consuming and complex because of their irregular structure. This research demonstrates that an automated multiplier generation and layout process makes the column compression multiplier a viable option for application specific CMOS products. Techniques for optimal multiplier designs are identified through analysis of area, delay, and power characteristics of Wallace, Dadda, and Reduced Area multipliers.In the literature, various programming languages have been used to create VHDL, Verilog, or netlist files. Several generators [61, 62, 63] for Booth encoded multiplier with optimized Wallace trees have been written in Lisp, AWK, or C. Over time, such multiplier ... In 2000, Hsiao and Jiang [64] produced a synthesizer which generates gate level Verilog code for a fast column compression multiplier.

Title:Optimization of Column Compression Multipliers
Author:K'Andrea Catherine Bickerstaff
Publisher:ProQuest - 2007


You Must CONTINUE and create a free account to access unlimited downloads & streaming