| commit | 0e6a832d6d9571ba136535b560ae68d3174923b5 | [log] [tgz] |
|---|---|---|
| author | Jeff DiCorpo <jeffdi@efabless.com> | Fri Mar 24 09:39:25 2023 -0700 |
| committer | Jeff DiCorpo <jeffdi@efabless.com> | Fri Mar 24 09:39:25 2023 -0700 |
| tree | d8ea31fdeaf2d668ffe681c9843698ce50a8d811 | |
| parent | 0d4a767b448d64cfd9ab2f283f2fb46f6374c2df [diff] |
final gds oasis
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.
