2019
DOI: 10.1016/j.mee.2019.04.015
|View full text |Cite
|
Sign up to set email alerts
|

Comparative analysis of various types of multipliers for effective low power

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 20 publications
2
17
0
Order By: Relevance
“…From this structure, it is observed that N partial product rows can be added using the proposed N-operand BTA which involves log 2 N addition stages. Secondly, the M × N Wallace multiplier structure of [34] is analysed in which N partial product rows are generated in the same way as in array multiplier. Initially, these N partial product rows are reduced to two operands using carry-save adders (array of FAs) and finally these two operands are added by the RCA.…”
Section: Performance Analysis Of Proposed Bta In Multipliersmentioning
confidence: 99%
See 3 more Smart Citations
“…From this structure, it is observed that N partial product rows can be added using the proposed N-operand BTA which involves log 2 N addition stages. Secondly, the M × N Wallace multiplier structure of [34] is analysed in which N partial product rows are generated in the same way as in array multiplier. Initially, these N partial product rows are reduced to two operands using carry-save adders (array of FAs) and finally these two operands are added by the RCA.…”
Section: Performance Analysis Of Proposed Bta In Multipliersmentioning
confidence: 99%
“…For this purpose, three recent multiplier structures, namely array multiplier [34], Wallace multiplier [34] and Booth multiplier [35] are analysed. Firstly, we have analysed M×N array multiplier of [34] in which N partial product rows are generated using AND gates, where M and N denote the bit width of multiplicand and multiplier terms, respectively. These partial product rows are added in false(N1false) number of addition stages to generate the final product.…”
Section: Performance Analysis Of Proposed Bta In Multipliersmentioning
confidence: 99%
See 2 more Smart Citations
“…The partial products are then accumulated to generate the final result. The above steps can be performed using several algorithms [27][28][29][30][31]. Some of them are suitable to achieve high computational speed, while others are more suitable to save occupied resources.…”
Section: Motivations and Backgroundmentioning
confidence: 99%