| commit | 0d4a767b448d64cfd9ab2f283f2fb46f6374c2df | [log] [tgz] |
|---|---|---|
| author | Komal Gupta <119812542+komalg27@users.noreply.github.com> | Sat Dec 31 06:15:15 2022 +0530 |
| committer | GitHub <noreply@github.com> | Sat Dec 31 06:15:15 2022 +0530 |
| tree | 1b0dc9af6071dfdff523f5f16966750797f36227 | |
| parent | c03dfd94ffa676f39fde4be06c2bcfffdc17ae30 [diff] |
Update user_project_ci.yml
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.