Parallel approach to the functional decomposition of logical functions using developmental genetic programming

Authors:
Stanislaw Deniziak;Karol Wieczorek
Affiliations:
Departament of Computer Science, Kielce University of Technology, Poland;Departament of Computer Science, Kielce University of Technology, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 9
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Functional decomposition with an efficient input support selection for sub-functions based on information relationship measures

Journal of Systems Architecture: the EUROMICRO Journal - The Euromicro Journal
Functional Decomposition with Application to FPGA Synthesis

Functional Decomposition with Application to FPGA Synthesis
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Sequential Logic Synthesis

Sequential Logic Synthesis
An efficient variable partitioning approach for functional decomposition of circuits

Journal of Systems Architecture: the EUROMICRO Journal
Input Variable Partitioning Method for Functional Decomposition of Functions Specified by Large Truth Tables

ICCIMA '07 Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 02
Human-competitive results produced by genetic programming

Genetic Programming and Evolvable Machines
A scalable cellular implementation of parallel genetic programming

IEEE Transactions on Evolutionary Computation

Evolutionary optimization of decomposition strategies for logical functions

SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional decomposition is the main step in the FPGA-oriented logic synthesis, where a function is decomposed into a set of functions, each of which must be simple enough to be implementable in one logic cell. This paper presents a method of searching for the best decomposition strategy for logical functions specified by cubes. The strategy is represented by a decision tree, where each node corresponds to a single decomposition step. In that way the multistage decomposition of complex logical functions may be specified. The tree evolves using the parallel developmental genetic programming. The goal of the evolution is to find a decomposition strategy for which the cost of FPGA implementation of a given function is minimal. Experimental results show that our approach gives significantly better results than other existing methods.