By Topic

Specifying and verifying imprecise sequential datapaths by arithmetic transforms

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
K. Radecka ; Concordia Univ., Montreal, Que., Canada ; Z. Zilic

We address verification of imprecise datapath circuits with sequential elements. Using the arithmetic transform (AT) and its extensions, we verify the sequential datapath circuits with finite precision. An efficient formulation of precision verification is presented as a polynomial maximization search over Boolean inputs. Using a branch-and-bound search for the precision error and the block-level composition of ATs, we verify the approximated, rounded and truncated pipelined datapaths.

Published in:

Computer Aided Design, 2002. ICCAD 2002. IEEE/ACM International Conference on

Date of Conference:

10-14 Nov. 2002