peter
/
boothmul
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
Verilog Booth Multiplier
8 Commits 2 Branches 2 Tags 245 KiB
Python 58.3%
Verilog 27.2%
C++ 11.6%
Makefile 2.9%
Go to file
Peter McGoron 619734f54e add reset pin 2023-04-21 17:39:18 +00:00
arty_test documentation and license 2022-10-29 22:25:39 -04:00
.gitignore add .gitignore 2022-10-29 22:26:10 -04:00
COPYING bump version 2022-10-23 04:42:35 -04:00
Makefile Booth multiplier 2022-08-09 18:13:47 -04:00
README.md add reset pin 2023-04-21 17:39:18 +00:00
boothmul.v add reset pin 2023-04-21 17:39:18 +00:00
sim.cpp add reset pin 2023-04-21 17:39:18 +00:00

README.md

Booth Multiplier

Sequentially multiply two signed twos-compliment integers in Verilog using the Booth Algorithm.

This design (v1.0) has been sucessfully synthesized with F4PGA (5aafae65883e95e41de2d0294729662dbe0a34f5) on a Digilent Arty A7-35T running at a clock speed of 100MHz. The test design is in arty_test.

License

All source code is licensed under the CERN-OHL-W v2 or later, unless otherwise noted.

Usage

Set parameters A1_LEN and A2_LEN to the argument size of the first and second integer. Set A2LEN_SIZ equal to floor(log2(A2_LEN) + 1).

After inputting each integer, pulse arm and wait until fin goes high to retreive the output in outn.

Simulating

Simulation is done with Verilator. Run make.