By Topic

On finding functionally identical and functionally opposite lines in combinational logic 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
$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)
Pomeranz, I. ; Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA ; Reddy, S.M.

Given a combinational logic circuit, we find a subset of lines R that has the following property. Every line g in the circuit has a representative line r∈R such that g and r carry identical values for any input combination of the circuit. This problem has applications in logic optimization as well as in testing. We define the problem, discuss its applications, describe a solution based on structural analysis and on functional analysis that uses logic simulation, and present experimental results. Considering logic optimization, every line g in the circuit can be replaced by a fanout branch of its representative r, and the logic driving g can be removed. Circuit size is thus reduced. We demonstrate that circuit reduction based on the set R can be used as a preprocessing step to reduce the run time of logic optimization procedures, without compromising solution quality. We also consider pairs of lines that always carry opposite values and show how they can be used to further reduce circuit size

Published in:

VLSI Design, 1996. Proceedings., Ninth International Conference on

Date of Conference:

3-6 Jan 1996