DSpace Repository

Automated HDL Generation of Two’s Complement Wallace Multiplier With Paralle Prefix Adders

Show simple item record

dc.contributor.author Asati, Abhijit
dc.date.accessioned 2023-03-02T07:01:27Z
dc.date.available 2023-03-02T07:01:27Z
dc.date.issued 2013
dc.identifier.uri https://www.ijareeie.com/upload/june/25B_AUTOMATED.pdf
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9424
dc.description.abstract Dadda multipliers are among the fastest multipliers owing to their logarithmic delay. The partial products of two‟s complement multiplication are generated by an algorithm described by Baugh-Wooley. The complicated and irregular reduction of partial products by Dadda algorithm and use of Parallel Prefix adders with logarithmic delay in the final stage of addition makes it difficult to write a generic Verilog code for them. To solve this difficulty, we described a C program which automatically generates a Verilog file for a Dadda multiplier with Parallel Prefix adders like Kogge-Stone adder, Brent-Kung adder and Han-Carlson adder of user defined size. We compared their post layout results which include propagation delay, area and power consumption. The Verilog codes have been synthesized using 90 nm technology library. We observed that the multiplier using Kogge-Stone adder in the final stage gives higher speed and lower Power Delay Products when compared to that using Brent-Kung and Han-Carlson adders. en_US
dc.language.iso en en_US
dc.publisher IJAREEIE en_US
dc.subject EEE en_US
dc.subject Kogge-Stone adder en_US
dc.subject Dadda multiplier en_US
dc.subject Brent-Kung adder en_US
dc.subject Han-Carlson Adder en_US
dc.title Automated HDL Generation of Two’s Complement Wallace Multiplier With Paralle Prefix Adders en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account