By Topic

Observability relations and observability don't cares

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)
Savoj, H. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Brayton, R.K.

The observability relation O(x,z) or the Boolean relation provides a description of all the flexibility one has in implementing a Boolean network N. The authors represent and use this flexibility in a logic synthesis system by adding a single output node to the Boolean network N. The node function for the new node is O(x,z). The newly constructed network N' (called the observability network) has only one output and computes 1 for every input x. It is shown that the observability don't cares (ODCs) for a node y/sub i/ in N' provide the maximum flexibility for implementing y/sub i/ and subsume the flexibility obtained for y/sub i/ in N even with don't cares provided at each output. This gives rise to new methods for computing complete ODCs for N' and hence for N.<>

Published in:

Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference on

Date of Conference:

11-14 Nov. 1991