By Topic

Method of input variable partitioning in functional decomposition based on evolutionary algorithm and binary decision diagrams

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)
Morawiecki, P. ; Kielce Univ. of Commerce, Kielce ; Rawski, M.

The functional decomposition is recognized as very efficient synthesis method of digital circuits and systems. However its practical usefulness for very complex systems is limited by lack of an efficient method of input variable partitioning. In this paper, a heuristic method for input variable partitioning is proposed for decomposition of Boolean function represented by BDD. The method is based on an application of evolutionary algorithms, what allows exploring the possible solution space of a problem while keeping the high-quality solutions in this reduced space. The boolean function is represented by the reduced ordered binary decision diagram (ROBDD). The experimental results show that the proposed heuristic method is able to generate optimal or near optimal solution very efficiently even for large systems. It is much faster than the systematic method while delivering results of the comparable quality.

Published in:

Human System Interactions, 2008 Conference on

Date of Conference:

25-27 May 2008