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

Tunable Floating-Point Adder

Abstract: In this work, we address the design of an adder in Tunable Floating-Point (TFP) precision. TFP is a variable precision format in which a given precision can be chosen for a single operation by selecting a specific number of bits for significand and exponent in the floating-point representation. By tuning the precision of an algorithm to the minimum precision achieving an acceptable target error, we can make the computation more power efficient. In previous work, we introduced a unit for TFP multiplication. Her… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…Nannarelli [18] describes the design of an FPU based on the Tunable Floating-Point (TFP) format, which supports a variable number of bits for mantissa (from 4 to 24) and exponent (from 5 to 8). However, this solution does not support vectorization, which is a key enabler for energy efficiency.…”
Section: Transprecision Computing Building Blocksmentioning
confidence: 99%
“…Nannarelli [18] describes the design of an FPU based on the Tunable Floating-Point (TFP) format, which supports a variable number of bits for mantissa (from 4 to 24) and exponent (from 5 to 8). However, this solution does not support vectorization, which is a key enabler for energy efficiency.…”
Section: Transprecision Computing Building Blocksmentioning
confidence: 99%
“…In [24], the suggested adder is Tunable Floating Point (TFP) where the specific number of bits for substantial and exponent in the floating point illustration, in which the power efficient is calculated. The pair of circuit is used in the application of ternary half adder [25] with the improvement of multi-level ternary and basic binary circuits in which one path diminishes the computational resource through the power delay of about 63%.…”
Section: Introductionmentioning
confidence: 99%
“…FPA has various operations of variable latencies and the latency of FPA should be be optimized [13,14]; either by determining the smaller exponent to be subtracted from the larger exponent [15], or by using dual path algorithm [16][17][18][19][20][21][22], or considering subtraction operation separately [23]. Various design techniques are proposed to improve the performance of FPA to increase its speed [24][25][26][27][28], to reduce its silicon area [29], dealing with denormalized numbers [30] and rounding logic [31] and implementing FPA using field programmable gate array (FPGA) [32,33]. A Leading Zero Anticipator (LZA) is also designed for normalization process in dual path algorithm to improve the speed of FPA [34][35][36][37][38], and extensive research articles are available for synchronous FPA [39][40][41][42][43][44][45].…”
Section: Introductionmentioning
confidence: 99%