UB ScholarWorks

Implementation of a CMOS Wallace-tree Multiplier

Show simple item record

dc.contributor.author Li, Xiaoping en_US
dc.date.accessioned 2014-07-16T16:59:00Z
dc.date.available 2014-07-16T16:59:00Z
dc.date.issued 2009-04-03 en_US
dc.identifier.uri https://scholarworks.bridgeport.edu/xmlui/handle/123456789/814
dc.description © ASEE 2009
dc.description.abstract As slow and expensive operation units, multipliers are often the bottleneck limiting the overall performance of many computational VLSI circuits. Various CMOS multiplier architectures are available, such as the array multiplier, carry-save multiplier, and Wallace-tree multiplier. Wallace-tree multiplier has been a very popular design due to its fast speed, ease for modularization and fabrication. In this paper, the design and simulation of an 8-bit Wallace-tree multiplier with PSPICE is proposed. In order for comparison, an 8-bit CMOS array multiplier is also designed. The worst-case delay of both multiplier architectures are extracted and Wallace-tree multiplier demonstrates significant speed enhancement compared to CMOS array multiplier. Some efforts are made to further improve the performance of Wallace-tree multiplier. The revision in the circuit structure demonstrates effective speed improvement for the Wallace-tree multiplier. en_US
dc.language.iso en_US en_US
dc.publisher ASEE en_US
dc.subject Engineering en_US
dc.subject Computer science en_US
dc.subject Very-large-scale integration (VLSI) en_US
dc.subject Wallace-tree multiplier en_US
dc.title Implementation of a CMOS Wallace-tree Multiplier en_US
dc.type Article en_US
dc.event.location Bridgeport, CT en_US
dc.event.name 2009 Northeast ASEE (The American Society for Engineering Education) Conference en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ScholarWorks


Advanced Search

Browse

My Account