A recursive fast multiplier

  title={A recursive fast multiplier},
  author={A. N. Danysh and E. E. Swartzlander},
  journal={Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)},
  pages={197-201 vol.1}
This paper presents a recursive fast multiplication algorithm. The paper defines the algorithm and applies it to two's complement signed multiplication. A step-by-step approach is given that discusses the architectural and logic implementation in detail. A random, self-checking, simulation program verifies the correctness of the recursive multiplication algorithm. The paper analyzes the speed and gate count of the design and compares the results to other multiplier designs. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 16 extracted citations

Truncation Scheme for Recursive Multipliers

2011 International Conference on Computer and Management (CAMAN) • 2011
View 4 Excerpts
Highly Influenced

Truncation Schemes for Recursive Multipliers

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. • 2005
View 4 Excerpts
Highly Influenced

Power aware and high speed reconfigurable modified booth multiplier

2011 IEEE Recent Advances in Intelligent Computational Systems • 2011
View 1 Excerpt

Recursive architectures for 2DLNS multiplication

Proceedings of 2010 IEEE International Symposium on Circuits and Systems • 2010
View 2 Excerpts

Fixed-Width Multi-Level Recursive Multipliers

2006 Fortieth Asilomar Conference on Signals, Systems and Computers • 2006
View 1 Excerpt


Publications referenced by this paper.
Showing 1-3 of 3 references

“ A suggestion for a fast mu It i pl i er

C S. Wallace

Some schemes for parallel multipliers,

L. SI Dadda
Altu Frey., • 1965

Similar Papers

Loading similar papers…