commit | c86660b6dc1507c08aa5f7ab3260655c767de64c | [log] [tgz] |
---|---|---|
author | Radheshyam <sharmaradhe2022@gmail.com> | Sat Dec 31 05:41:03 2022 +0530 |
committer | Radheshyam <sharmaradhe2022@gmail.com> | Sat Dec 31 05:41:03 2022 +0530 |
tree | 9bd4e15db2c2bb02851e89d39132b8d1ac74dc07 | |
parent | 5d0eb7c8f7d5a773a9428341622d90ac844842eb [diff] |
add
Dadda proposed a method of reduction which achieves the reduced two-rowed Partial products in a minimum number of reduction stages. Dadda succeeded this, by placing the [3,2] and [2,2] counters in maximum Critical path in optimal manner. For an N-bit multiplier and multiplicand, there results a N by N partial products. These partial products are arranged in the form a Matrix. Dadda reduced these Matrix height to a two-rowed matrix, through a sequence a reduction stages.