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

Authors:
Pawel Morawiecki;Mariusz Rawski;Henry Selvaraj
Affiliations:
-;-;-
Venue:
ICCIMA '07 Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 02
Year:
2007

Citing 0
Cited 2

Evolutionary optimization of decomposition strategies for logical functions

SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Parallel approach to the functional decomposition of logical functions using developmental genetic programming

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.