By Topic

Efficient method of input variable partitioning in functional decomposition based on evolutionary algorithms

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)
Rawski, M. ; Inst. of Telecommun., Warsaw Univ. of Technol., Poland ; Selvaraj, H. ; Morawiecki, P.

In recent years the functional decomposition has found an application in many fields of modern engineering and science, such as combinational and sequential logic synthesis for VLSI systems, pattern analysis, knowledge discovery, machine learning, decision systems, data bases, data mining etc. However, the lack of an effective and efficient method of the input variable partitioning limits its practical usefulness in complex systems. A classical method based on a systematic search of the whole solution space is inefficient due to its nonpolynomial time complexity. In this paper, a heuristic method for the input variable partitioning is proposed and discussed. The method is based on the application of evolutionary algorithms that allows exploring the possible solution space of a problem while keeping the high-quality solutions in this reduced space. The experimental results show that the proposed heuristic method is able to construct an optimal or near optimal solution very efficiently even for large systems. It is much faster than the systematic method while delivering results of comparable quality.

Published in:

Digital System Design, 2004. DSD 2004. Euromicro Symposium on

Date of Conference:

31 Aug.-3 Sept. 2004