Formalization of Cadence SPW fixed-point arithmetic in HOL

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses the formalization in higher-order logic of fixed-point arithmetic based on the SPW (Signal Processing Work System) tool. We encoded the fixed-point number system and specified the different rounding modes in fixed-point arithmetic such as the directed and even rounding modes. We also considered the formalization of exceptions detection and their handling like overflow and invalid operation. An error analysis is then performed to check the correctness of the rounding and to verify the basic arithmetic operations, addition, subtraction, multiplication and division against their mathematical counterparts. Finally, we showed by an example how this formalization can be used to enable the verification of the transition from the floating-point to fixed-point algorithmic levels in the design flow of signal processors.

Cite

CITATION STYLE

APA

Akbarpour, B., Dekdouk, A., & Tahar, S. (2002). Formalization of Cadence SPW fixed-point arithmetic in HOL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2335, pp. 185–204). Springer Verlag. https://doi.org/10.1007/3-540-47884-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free