By Topic

Input Variable Partitioning Method for Functional Decomposition of Functions Specified by Large Truth Tables

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)
Pawel Morawiecki ; Kielce Univ. of Commerce, Kielce ; Mariusz Rawski ; Henry Selvaraj

In this paper, a new input variable partitioning method for functional decomposition is presented. Efficiency of currently used decomposition algorithms is dependent on the size of decomposed functions. One of the crucial aspects of functional decomposition is the input variable partitioning. This synthesis method has important application in many fields of modern engineering and science. However the practical usefulness of decomposition-based methods for very complex systems is restricted by computational complexity and memory requirements of the existing algorithms. The paper presents many examples confirming that the proposed method leads to reduction in the computation time.

Published in:

Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on  (Volume:2 )

Date of Conference:

13-15 Dec. 2007