Using a genetic algorithm for optimizing the functional decomposition of multiple-valued functions

Tatiana Kalganova, E. G. Kochergov, N Strechen · Brunel University Research Archive (BURA) (Brunel University London) · 1997

: The genetic algorithm which determines the good functional decomposition of multiple-valued logic functions is presented. The algorithm expands the range of searching for a best decomposition, providing the optimal column multiplicity. The possible solutions are evaluated using the gain of decomposition for multiple-valued function. 1. INTRODUCTION In recent years, increasing attention has been given to multiple-valued (MV) circuits. This is because of their ability to reduce the number of interconnections in complicated digital circuits, to increase the information content per unit chip area, and to increase the speed of information transmission [Shousha 1995]. The combinational circuits based on the look-up table type FPGA (field programmable gate array), MV PLA (multiple-valued programmable logic array), FPD (field programmable devices), PAL (programmable logic array), Tgate (multiplexer) and etc. can be designed by using the functional decomposition technique. This technique i...

Read the paper · More papers on PaperTik