Skip to content

Module and testbench codes are given in Verilog for a low-cost synchronous, generic multiplier that uses only one adder with bit width as same as its inputs' bit width.

Notifications You must be signed in to change notification settings

ghanimmustafa/Area-Optimized-Shift-and-Add-Multiplier

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 

Repository files navigation

Area-Optimized-Shift-and-Add-Multiplier

Module and testbench codes are given in Verilog for a low-cost synchronous, generic multiplier that uses only one adder with bit width as same as its inputs' bit width. This design is optimal for cases when high latency is accepted but best-case area is compulsory in small FPGA/ASIC to perform large multiplications such as 128-bit * 128-bit, 256-bit * 256-bit, .. etc.

Co-authored-by: Emre Aydin Guzel https://github.com/aydinemreguzel

About

Module and testbench codes are given in Verilog for a low-cost synchronous, generic multiplier that uses only one adder with bit width as same as its inputs' bit width.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published