commit 5d0eb7c8f7d5a773a9428341622d90ac844842eb
author Radheshyam <sharmaradhe2022@gmail.com> Sat Dec 31 05:37:26 2022 +0530
committer Radheshyam <sharmaradhe2022@gmail.com> Sat Dec 31 05:37:26 2022 +0530
tree e46e27ceec89105bb0ae9c3fdb9aa86f211ecb73
parent 523a15665290e1078d836c3f150b3f9a547c1591

radhe

README.md

diff --git a/README.md b/README.md
index 303df12..10b5b10 100644
--- a/README.md
+++ b/README.md
@@ -2,5 +2,4 @@
 
 [![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](https://opensource.org/licenses/Apache-2.0) [![UPRJ_CI](https://github.com/efabless/caravel_project_example/actions/workflows/user_project_ci.yml/badge.svg)](https://github.com/efabless/caravel_project_example/actions/workflows/user_project_ci.yml) [![Caravel Build](https://github.com/efabless/caravel_project_example/actions/workflows/caravel_build.yml/badge.svg)](https://github.com/efabless/caravel_project_example/actions/workflows/caravel_build.yml)
 
-
-Matrix multiplication is probably the most important matrix operation. It is used widely in such areas as network theory, solution of linear systems of equations, transformation of co-ordinate systems, and population modeling, to name but a very few.
+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.