2018 15th International Bhurban Conference on Applied Sciences and Technology (IBCAST) 2018
DOI: 10.1109/ibcast.2018.8312254
|View full text |Cite
|
Sign up to set email alerts
|

Low power 4×4 bit multiplier design using dadda algorithm and optimized full adder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…In 17 , the authors modified the carry-select adder (CSA) using a binary to excess-1 (BEC1) converter and used this circuit as a compressor to implement the circuit of the Dadda multiplier, which improved the speed, area, and energy as compared to the traditional CSA-based design. To reduce power and area, an optimized adder with pass transistor logic is used to design a dadda multiplier in 18 , but the output voltage levels are not as strong as in CMOS logic. The authors proposed a Dadda circuit based on the carry look-ahead adder and optimized full adder in 19 , which was implemented using complex cells in CMOS 65 nm technology.…”
Section: Introductionmentioning
confidence: 99%
“…In 17 , the authors modified the carry-select adder (CSA) using a binary to excess-1 (BEC1) converter and used this circuit as a compressor to implement the circuit of the Dadda multiplier, which improved the speed, area, and energy as compared to the traditional CSA-based design. To reduce power and area, an optimized adder with pass transistor logic is used to design a dadda multiplier in 18 , but the output voltage levels are not as strong as in CMOS logic. The authors proposed a Dadda circuit based on the carry look-ahead adder and optimized full adder in 19 , which was implemented using complex cells in CMOS 65 nm technology.…”
Section: Introductionmentioning
confidence: 99%
“…Dadda algorithm can be used for 16-bit or higher order multiplication but with the increase in number of bits, the complexity also increases. For a 4-bit Dadda multiplier, the maximum tree height of partial products is four and reduction stages are three [16]. When the same algorithm is utilized to perform 8-bit multiplication, the tree height increases to six and reduction stages increase to four [17], thereby increasing the resources consumption and delay.…”
Section: Introductionmentioning
confidence: 99%