By Topic

Verification of fixed-point datapaths with comparator units using Constrained Arithmetic Transform (CAT)

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

2 Author(s)
Sarbishei, O. ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada ; Radecka, K.

Arithmetic Transform (AT) [1, 16, 17] is an efficient spectral technique, to analyze range and precision of fixed-point polynomial datapaths, among other methods including AA [4, 15] and SMT [5]. However, the major inefficiency of AT is that it cannot handle the datapaths with comparator units, which imply the non-arithmetic if-statements. This paper presents the approach, Constrained Arithmetic Transform (CAT), to perform range and precision analysis of fixed-point datapaths with comparator units. A custom branch-and-bound search is also introduced to provide more cutting branches and perform faster analyses of range and precision, by making use of safe and negligible overestimations. Experimental results prove the efficiency of our approach.

Published in:

Circuits and Systems (ISCAS), 2012 IEEE International Symposium on

Date of Conference:

20-23 May 2012