An Investigation on Inherent Robustness of Posit Data Representation

@article{Alouani2021AnIO,
  title={An Investigation on Inherent Robustness of Posit Data Representation},
  author={Ihsen Alouani and Anouar Ben Khalifa and Farhad Merchant and R. Leupers},
  journal={2021 34th International Conference on VLSI Design and 2021 20th International Conference on Embedded Systems (VLSID)},
  year={2021},
  pages={276-281}
}
As the dimensions and operating voltages of computer electronics shrink to cope with consumers' demand for higher performance and lower power consumption, circuit sensitivity to soft errors increases dramatically. Recently, a new data-type is proposed in the literature called posit data type. Posit arithmetic has absolute advantages such as higher numerical accuracy, speed, and simpler hardware design than IEEE 754–2008 technical standard-compliant arithmetic. In this paper, we propose a… Expand

Figures from this paper

Brightening the Optical Flow through Posit Arithmetic
TLDR
An extensive empirical study of posit-based arithmetic vis-à-vis IEEE 754 compliant arithmetic for the optical flow estimation method called Lucas-Kanade (LuKa), using SoftPosit and SoftFloat format emulators to perform an empirical error analysis. Expand

References

SHOWING 1-10 OF 28 REFERENCES
ExPAN(N)D: Exploring Posits for Efficient Artificial Neural Network Design in FPGA-Based Systems
TLDR
This paper presents ExPAN(N)D, a framework to analyze and ingather the efficacy of the Posit number representation scheme and the efficiency of fixed-point arithmetic implementations for ANNs, and proposes a modified Posit-based representation to store the trained parameters of a network. Expand
Approximate logic synthesis for error tolerant applications
  • Doochul Shin, S. Gupta
  • Computer Science
  • 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
  • 2010
TLDR
A new logic synthesis approach for the new problem of identifying how to exploit a given error rate threshold to maximally reduce the area of the synthesized circuit is proposed. Expand
Parity-based mono-Copy Cache for low power consumption and high reliability
TLDR
The Parity-based mono-Copy Cache (PmC2) is proposed that maintains cache reliability under aggressive voltage scaling and results in reducing energy consumption considerably with very low performance penalty. Expand
Soft error propagation in floating-point programs
  • Sha Li, Xiaoming Li
  • Computer Science
  • International Performance Computing and Communications Conference
  • 2010
TLDR
This paper starts from building a quantitative understanding of the error propagation in software and proposes a systematic evaluation of the impact of bit flip caused by soft errors on floating-point operations, and introduces a novel model to deal with soft errors. Expand
Beating Floating Point at its Own Game: Posit Arithmetic
TLDR
A new data type called a posit is designed as a direct drop-in replacement for IEEE Standard 754 floating-point numbers (floats), and provides compelling advantages over floats, including larger dynamic range, higher accuracy, better closure, bitwise identical results across systems, simpler hardware, and simpler exception handling. Expand
Parameterized Posit Arithmetic Hardware Generator
TLDR
The architecture of a parameterized PAU generator that can generate PAU adders and PAU multipliers of any bit-width pre-synthesis is presented and it is argued that an n-bit IEEE 754-2008 adder and multiplier can be safely replaced with an m-bit PAU addition and multiplier where m<n, due to superior numerical accuracy of the PAU. Expand
Characterizing the impact of soft errors on iterative methods in scientific computing
TLDR
The results indicate that explicit schemes will suffer from soft error induced numerical instabilities, thus exacerbating intrinsic stability issues for such methods, that impose constraints on relative time and space step sizes. Expand
Brightening the Optical Flow through Posit Arithmetic
TLDR
An extensive empirical study of posit-based arithmetic vis-à-vis IEEE 754 compliant arithmetic for the optical flow estimation method called Lucas-Kanade (LuKa), using SoftPosit and SoftFloat format emulators to perform an empirical error analysis. Expand
Analysis and Design of Nanoscale CMOS Storage Elements for Single-Event Hardening With Multiple-Node Upset
The occurrence of a single event with a multiple-node upset is likely to increase significantly in nanoscale CMOS due to reduced device size and power supply voltage scaling. This paper presents aExpand
Next Generation Arithmetic for Edge Computing
TLDR
Academia and industry are brought together to discuss the latest results and future directions for research in the domain of next-generation computer arithmetic, especially for edge computing. Expand
...
1
2
3
...