2020
DOI: 10.1016/j.mejo.2020.104816
|View full text |Cite
|
Sign up to set email alerts
|

Approximate radix-8 Booth multiplier for low power and high speed applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…All of these multiples are easily obtained by using shift and negation operations on X. Similarly, Radix-8 MBE requires X multiples of 0, 1, 2, 3, and 4, while lowering the height of the PP matrix from N to N/3 16 . The redundant binary PPG achieves the largest reduction in the number of PPs, around 75%, for a Radix-4 multiplier 17 .…”
Section: Related Workmentioning
confidence: 99%
“…All of these multiples are easily obtained by using shift and negation operations on X. Similarly, Radix-8 MBE requires X multiples of 0, 1, 2, 3, and 4, while lowering the height of the PP matrix from N to N/3 16 . The redundant binary PPG achieves the largest reduction in the number of PPs, around 75%, for a Radix-4 multiplier 17 .…”
Section: Related Workmentioning
confidence: 99%
“…M ULTIPLICATION is one of the most widely used arithmetic operations in a variety of applications, such as machine learning [1]- [7], image/video processing [8]- [12], and cryptographic operations [12]- [16]. Multipliers often cause computational bottlenecks, so that optimizing their efficiency is crucial [11], [17]- [19]. Embedded systems and high-performance computing devices incorporate a diverse range of multipliers, which vary in terms of their bit-length, internal architecture, and operational principles.…”
Section: Introductionmentioning
confidence: 99%