By Topic

Addendum to `A kernel-finding state assignment algorithm for multi-level logic'

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

3 Author(s)
W. Wolf ; AT&T Bell Labs., Murray Hill, NJ ; K. Keutzer ; J. Akella

Two new sets of results are presented that extend work on state assignment for multilevel logic implementation previously reported by the authors (see Proc. IEEE/ACM 25th Design Autom Conf., p.433-8, 1988). Results are presented for several state assignment algorithms that were compared using an improved logic optimization method. The resulting logic implementations were smaller in absolute size and showed considerably more variation in random state assignment than in previous experiments. A new set of experiments that compare state assignment implementations in two-level and multilevel implementations using randomly generated state assignments is reported. These experiments show that, for the benchmark set used, a state assignment that gives a good two-level implementation also gives a good multilevel implementation

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:8 ,  Issue: 8 )