2014
DOI: 10.1109/tcsi.2013.2283695
|View full text |Cite
|
Sign up to set email alerts
|

An Optimized Modified Booth Recoder for Efficient Design of the Add-Multiply Operator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(30 citation statements)
references
References 15 publications
0
29
0
1
Order By: Relevance
“…The circuit is relied upon to lessen the power utilization and cost of the multiplier. Kostas Tsoumanis et al (2014) [21] endeavored to advanced intertwined include duplicate (FAM) to build the execution of the FAM. They present an organized and effective adjusted stall recording procedure and investigate three unique plans to fuse them in the FAM outlines.…”
Section: Bypassing Multipliermentioning
confidence: 99%
“…The circuit is relied upon to lessen the power utilization and cost of the multiplier. Kostas Tsoumanis et al (2014) [21] endeavored to advanced intertwined include duplicate (FAM) to build the execution of the FAM. They present an organized and effective adjusted stall recording procedure and investigate three unique plans to fuse them in the FAM outlines.…”
Section: Bypassing Multipliermentioning
confidence: 99%
“…Such a technique was first proposed by Booth [6]. The original Booth's algorithm [1] [6] closest strings of l's by using the property that: 2 + 2(n-1) + 2(n-2) + . .…”
Section: Motivationmentioning
confidence: 99%
“…Conventional and signed HAs and FAs [1,10] are to be used, each of the three schemes can be easily applied in either signed (2's complement representation) or un-signed numbers which consist of odd or even number of bits. In the following techniques, both inputs are in 2's complement form for signed and unsigned consist of bits 2k in case of even or 2k+1 bits in case of odd bit-width [9] considered.…”
Section: Structured Signed Arithmeticmentioning
confidence: 99%
See 1 more Smart Citation
“…A very popular scheme for parallel multiplication is radix-4, where for a 32-bit multiplier Y, the PPs are 32/2=16 [3]. As the wordlength becomes longer, the radix has been extended to radix-8 [4]- [6] and even radix-16 [7].…”
Section: Introductionmentioning
confidence: 99%