Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Dadda multiplier

Known as: Dadda multipliers, Dadda tree 
The Dadda multiplier is a hardware multiplier design invented by computer scientist Luigi Dadda in 1965. It is similar to the Wallace multiplier, but… Expand
Wikipedia

Related topics

Related topics

6 relations
Adder (electronics)BKM algorithmBinary multiplierBooth's multiplication algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Dadda Multiplier designs using memristors
Memristors have recently become a leader in future system design due to their unique storage abilities and high density. This… Expand
  • table II
  • figure 1
  • table III
  • figure 2
  • figure 3
Is this relevant?
2013
2013
Implementation of a high speed multiplier using carry lookahead adders
This paper examines a modification to the Wallace/Dadda Multiplier to use carry lookahead adders instead of full adders to… Expand
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Design of High Speed Vedic Multiplier using Vedic Mathematics Techniques
This paper proposed the design of high speed Vedic Multiplier using the techniques of Ancient Indian Vedic Mathematics that have… Expand
  • figure 1
  • figure 3
  • figure 2
  • table 1
Is this relevant?
2011
2011
Speed Comparison of 16x16 Vedic Multipliers
The paper presents the concepts behind the "Urdhva Tiryagbhyam Sutra" and "Nikhilam Sutra" multiplication techniques. It then… Expand
  • figure 1
  • figure 3
  • figure 2
  • table I
  • table 2
Is this relevant?
2010
2010
Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs
This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
2006
2006
A GF(24m) Inverter and its Application in a Reconfigurable Tate Pairing Processor
This paper details an architecture for performing inversion in the field GF(24m), which is the field used in computing the Tate… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A comparison of Dadda and Wallace multiplier delays
The two well-known fast multipliers are those presented by Wallace and Dadda. Both consist of three stages. In the first stage… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Minimization of switching activities of partial products for designing low-power multipliers
This work presents low-power 2's complement multipliers by minimizing the switching activities of partial products using the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 3
  • figure 4
Is this relevant?
1991
1991
F-Multipliers and the Localization of Distributive Lattices II
 
Is this relevant?
1983
1983
A VLSI layout for a pipelined Dadda multiplier
Parallel counters (unary-to-binary converters) are the principal component of a dadda multiplier. The authors specify a design… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE