commit | 13eb7dc6d255c56ccb7e326acfb3e297b1770b01 | [log] [tgz] |
---|---|---|
author | Radheshyam <sharmaradhe2022@gmail.com> | Sat Dec 31 05:47:15 2022 +0530 |
committer | Radheshyam <sharmaradhe2022@gmail.com> | Sat Dec 31 05:47:15 2022 +0530 |
tree | dd9d20ced6e335c69dc706a8464b6fb625365ca7 | |
parent | 82c98835fa554a26f68d3a19daa82b5bc0b3b558 [diff] |
now
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.