A fast partitioning method for PLA-based FPGAs

A method for automatic multipartitioning of a multiple-output logic function into the smallest number of subfunctions for mapping to fixed-size PLAs of a field-programmable gate array (FPGA) chip is described. A detailed example to demonstrate the procedure is presented. It is shown that, for this example, the method produced almost optimum partitions in a fast and efficient manner.<<ETX>>

[1]  Seiyang Yang,et al.  PLA decomposition with generalized decoders , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Kotagiri Ramamohanarao,et al.  Automatic Synthesis of Boolean Equations Using Programmable Array Logic , 1989, 26th ACM/IEEE Design Automation Conference.

[3]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[4]  William W. Cohen,et al.  A Rule-Based System for Optimizing Combinational Logic , 1985, IEEE Design & Test of Computers.

[5]  Jonathan Rose,et al.  Chortle: a technology mapping program for lookup table-based field programmable gate arrays , 1990, 27th ACM/IEEE Design Automation Conference.

[6]  Isao Shirakawa,et al.  A Layout System for the Random Logic Portion of an MOS LSI Chip , 1981, IEEE Transactions on Computers.

[7]  Robert K. Brayton,et al.  Three-level decomposition with application to PLDs , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[8]  Robert K. Brayton,et al.  Logic synthesis for programmable gate arrays , 1991, DAC '90.

[9]  Kevin Karplus.  Xmap: a technology mapper for table-lookup field-programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.

[10]  Giovanni De Micheli,et al.  Technology mapping for a two-output RAM-based field programmable gate array , 1991, Proceedings of the European Conference on Design Automation..