![](https://embedthreads.com/wp-content/uploads/2024/02/image-1.png)
Here we implement the circuit with combinational logic In next edition we will implement with sequential logic.
![](https://embedthreads.com/wp-content/uploads/2024/02/image-2.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-15.png)
What did we concluded on the basis of above observation…
Let us conclude in a table
![](https://embedthreads.com/wp-content/uploads/2024/02/image-4.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-5.png)
So how does multiplication works with Booth Algorithms method…
![](https://embedthreads.com/wp-content/uploads/2024/02/image-6.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-7.png)
Partial products reduce in Modified Booth Algorithm
![](https://embedthreads.com/wp-content/uploads/2024/02/image-8.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-9.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-10.png)
So our code will be
if( a==3'b010)
m <= k;
Now we will make cases
![](https://embedthreads.com/wp-content/uploads/2024/02/image-11.png)
if(a==3'b000 || a==3'b111)
m <= 8'b0;
else if(a==3'b001 || a==3'b010)
m <= k;
else if(a==3'b011)
m <= k<<1;v
else if(a==3'b100)
m <= -(k<<1);
else if(a==3'b101 || a==3'b110)
m <= -k;
![](https://embedthreads.com/wp-content/uploads/2024/02/image-12.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-13-1024x416.png)
![](https://embedthreads.com/wp-content/uploads/2024/02/image-14-1024x571.png)
Leave a comment