2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing 2013
DOI: 10.1109/prdc.2013.44
|View full text |Cite
|
Sign up to set email alerts
|

Applying Reduced Precision Arithmetic to Detect Errors in Floating Point Multiplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 5 publications
0
12
0
Order By: Relevance
“…It mainly considers detection of very large errors, and does not treat rounding which is specific to floating-point arithmetic. Error detection ratio based on this technique reported in [13] is very low as the authors have described. The multiplier based on the method will be used for applications which need to detect only very large errors.…”
Section: Introductionmentioning
confidence: 70%
See 1 more Smart Citation
“…It mainly considers detection of very large errors, and does not treat rounding which is specific to floating-point arithmetic. Error detection ratio based on this technique reported in [13] is very low as the authors have described. The multiplier based on the method will be used for applications which need to detect only very large errors.…”
Section: Introductionmentioning
confidence: 70%
“…Reliable floatingpoint arithmetic circuits utilizing methods other than full duplication and residue checking were proposed [11]- [14], but, to the best of our knowledge, are not actually used. Recently, reduced precision checking is proposed for floating-point addition and floating-point multiplication in [12] and [13], respectively. The technique uses a small significand adder or a small significand multiplier for checking of the result.…”
Section: Introductionmentioning
confidence: 99%
“…However, as shown in table 3, the required area and power overheads in our error detecting scheme are much lower, even with a longer mantissa. For example, the design with a 17-bit mantissa requires only 5% and 2.7% area and power overheads, respectively, while its precision is much higher than that of the checker in [20]. In addition, based on [15] the 11-bit mantissa is enough for many applications that verifies our proposed faulttolerant designs.…”
Section: Resultsmentioning
confidence: 96%
“…As mentioned in Section II, the RPC technique [20] can be used for detecting errors in the floating-point multiplier. This technique in which the 32-bit floatingpoint multiplier is checked by a k-bit (k<23) reducedprecision floating-point checker multiplier, requires the area and power overheads equal to 17.8% and 35%, respectively, for the checker multiplier in which the mantissa with the size of only 7 bits has been used.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation