2023
DOI: 10.1109/tc.2022.3216465
|View full text |Cite
|
Sign up to set email alerts
|

On the Design of Iterative Approximate Floating-Point Multipliers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…The work [16] proposes the floating-point approximate PAM multiplier with run-time customisation, which can successfully replace a full-precision floating-point multiplier in some deep neural networks and image-processing applications. In [17], the authors proposed an iterative approximate floating-point multiplier based on two-dimensional pseudo-Booth encoding. The accuracy of the proposed multiplier is tuned by three parameters: iteration, encoder's radix, and word length after truncation.…”
Section: Introductionmentioning
confidence: 99%
“…The work [16] proposes the floating-point approximate PAM multiplier with run-time customisation, which can successfully replace a full-precision floating-point multiplier in some deep neural networks and image-processing applications. In [17], the authors proposed an iterative approximate floating-point multiplier based on two-dimensional pseudo-Booth encoding. The accuracy of the proposed multiplier is tuned by three parameters: iteration, encoder's radix, and word length after truncation.…”
Section: Introductionmentioning
confidence: 99%
“…Floating point (FP) multiplication is an essential component required in a large set of FPGA based hardware acceleration application [2]. So, efficient implementation of FPGA based floating point multipliers are highly desirable.…”
Section: Introductionmentioning
confidence: 99%