By Topic

High-level design verification using Taylor Expansion Diagrams: first results

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

4 Author(s)
Kalla, P. ; Utah Univ., Salt Lake City, UT, USA ; Ciesielski, M. ; Boutillon, E. ; Martin, E.

Recently a theory of a compact, canonical representation for arithmetic expressions, called Taylor Expansion Diagram (TED) has been proposed. This representation, based on a novel, non-binary decomposition principle, raises a level of design abstraction from bits to bit vectors and words, thus facilitating the verification of behavioral and RTL specifications of arithmetic designs. This paper presents the first practical results of using TED in the context of high-level design representation and verification. It discusses the use of TED for equivalence checking of behavioral and RTL designs and comments on its limitations. It also demonstrates the application of TEDs to verification of designs on an algorithmic level and comments on their potential use in high level synthesis.

Published in:

High-Level Design Validation and Test Workshop, 2002. Seventh IEEE International

Date of Conference:

27-29 Oct. 2002