search
Log In
0 votes
178 views
How is the no of gates required for array multiplier 2n-1,As much as I know we need for a m multiplier bit and n multiplicand bit mn and gates and m-1) adders to add the result of and gates?
in Digital Logic 178 views

Please log in or register to answer this question.

Related questions

26 votes
3 answers
1
5.5k views
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is $O(n^2)$ $O(n)$ $O(\log n)$ $O(1)$
asked Sep 23, 2014 in Digital Logic Kathleen 5.5k views
40 votes
4 answers
2
8.4k views
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
asked Sep 16, 2014 in Digital Logic Kathleen 8.4k views
0 votes
0 answers
3
0 votes
1 answer
4
796 views
Consider a $3-bit$ number $A$ and $2 bit$ number $B$ are given to a multiplier. The output of multiplier is realized using $AND$ gate and one-bit full adders. If the minimum number of $AND$ gates required are $X$ and one-bit full adders required are Y, then $X+Y = $ _______
asked May 31, 2018 in Digital Logic saumya mishra 796 views
...