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.
This project have taught me and Mr. Radheshyam Sharma (Research Scholar) a lot about pdks, Openlane flow , RTL2GDS flow and many more.
I sincerely thank Prof. Santosh K. Vishvakarma and NSDCS lab members at IIT Indore for their continuous support.
Looking forward for more such collaborations and projects.
connect us on linkedIn :
Radheshyam Sharma : https://www.linkedin.com/in/radheshyam-sharma-37aa3713b
Komal Gupta : https://www.linkedin.com/in/komal-gupta-757409184
Further details of NSDCS lab can be found here.
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.
1.0
acc
sky130A