Cart (Loading....) | Create Account
Close category search window
 

Recognizing nonseries-parallel structures in multilevel logic minimization

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)
Jaekel, A. ; Sch. of Comput. Sci., Windsor Univ., Ont., Canada ; Bandyopadhyay, S.

Traditional multilevel logic synthesis generally involves decomposing a given two-level sum-of-products expression into a series parallel network by factorization. There is a potential for greater savings if we can identify a nonseries-parallel network realizing the same function. Little work has been done in the area of recognition of nonseries-parallel structures. This paper introduces a new algorithm to identify these structures. Such structures, when present, lead to a significant reduction in literal count in the implementation of the corresponding logic functions

Published in:

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Date of Conference:

28-31 Mar 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.