11-15-2013, 09:47 PM
Lets get to it. In binary multiplication of two ecual long numbers ( let's use the example from the foto below) 1011 x 1101 we we will at maximum have to add the greatest valu bit n amonts of times. where n equals the legth of bits in the numbers.
![[Image: 4.-Binary-Multiplication.png]](http://http://www.stoimen.com/blog/wp-content/uploads/2013/01/4.-Binary-Multiplication.png)
so for this example 4.
My idea is to use signal strength to simplify this addition of equal numbers. This is how 1111 x 1111 would look in my new multiplier. 1 2 3 4 3 2 1 ( this is the same as 1x2^7 + 2x2^6 + 3x2^5 + 4x2^4 + 3x2^3 +2x2^2 + 2x2^1 ) and getting the binary from this I believe is faster then normal adder array. especially in bigger numbers. I have not seen any multipliers like this but that does not mean it hasn't already been made.
so for this example 4.
My idea is to use signal strength to simplify this addition of equal numbers. This is how 1111 x 1111 would look in my new multiplier. 1 2 3 4 3 2 1 ( this is the same as 1x2^7 + 2x2^6 + 3x2^5 + 4x2^4 + 3x2^3 +2x2^2 + 2x2^1 ) and getting the binary from this I believe is faster then normal adder array. especially in bigger numbers. I have not seen any multipliers like this but that does not mean it hasn't already been made.