| commit | c03dfd94ffa676f39fde4be06c2bcfffdc17ae30 | [log] [tgz] |
|---|---|---|
| author | Komal Gupta <119812542+komalg27@users.noreply.github.com> | Sat Dec 31 05:51:19 2022 +0530 |
| committer | GitHub <noreply@github.com> | Sat Dec 31 05:51:19 2022 +0530 |
| tree | 3869059585c6a1b26d721d7a1380ad2a913ba4d5 | |
| parent | 13eb7dc6d255c56ccb7e326acfb3e297b1770b01 [diff] |
Update includes.rtl.caravel_user_project
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.