By Topic

Boolean decomposition based on cyclic chains

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

3 Author(s)
Dubrova, E. ; R. Inst. of Technol., IMIT/KTH, Stockholm, Sweden ; Teslenko, M. ; Karlsson, J.

We present a new algorithm for decomposition of type f=g·h+r. The algorithm searches for Boolean products g·h of a special type, called cyclic chains. The number of cubes in a cyclic chain is no greater than the number of cubes in the part of the on-set of f covered by this chain. The number of literals is always smaller. Cyclic chains are extracted recursively until no more can be found. The presented algorithm is of particular interest in applications, which require circuit representations of a limited depth. Experimental results on benchmark circuits demonstrate the efficiency of our approach.

Published in:

Computer Design, 2003. Proceedings. 21st International Conference on

Date of Conference:

13-15 Oct. 2003