By Topic

Automatic error correction of tri-state circuits

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
$33 $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)
D. W. Hoffmann ; Inst. for Comput. Eng., Tubingen Univ., Germany ; T. Kropf

Boolean equivalence checking is a well established approach for verifying combinational circuits and is on the verge of becoming an integrated part of the design cycle. Previously (1999), we have presented a method for performing automatic error correction in combinational circuits if equivalence checking fails. However like all other automatic error correction techniques proposed in the past, it cannot handle circuits containing tri-states. This is a restriction for practical applications since tri-states occur in many real-life circuits. In this paper we present two solutions how the rectification method can be extended to locate and rectify errors in tri-state circuits. This makes the method applicable to a much broader range of circuits

Published in:

Computer Design, 1999. (ICCD '99) International Conference on

Date of Conference: