We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Verified functions for generating signed-binary arithmetic hardware

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shiu-Kai Chin ; Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA

Formally verified metafunctions which synthesize array multipliers and inner product hardware of arbitrary size and structure are presented. The metafunctions operate on signed-binary inputs in general and two's-complement in particular, and are higher order. They are shown to be equivalence-preserving transformations and correctly produce multipliers and inner product hardware of arbitrary size and structure. All the metafunctions, their associated correctness theorems, and their correctness proofs are machine executable within the higher order logic (HOL) theorem prover. The function expressions produced by the metafunctions can be used as hardware synthesis descriptions or as comparison functions for Boolean-comparison-based systems. In addition to the definitions written in higher-order logic, the major definitions are written in a more informal functional programming language-like notation which should facilitate translation of the synthesis functions to other hardware description languages

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:11 ,  Issue: 12 )