The Universal Algorithm for Fitting Targeted to Complex Programmable Logic Devices

The universal approach to the problem of fitting the logic into a given architecture of Complex Programmable Logic Devices (CPLD) is addressed. The problem is reduced to a division of the set of the design primitives into separate subsets, each of which will be realized in a separate CPLD functional block. For solution of the fitting problem, we propose one sequential algorithm and iterative algorithms. Sequential algorithm generates some initial solution, which then is improved with the help of iterative algorithms.