Performance-driven mapping for CPLD architectures

In this paper we present a performance-driven mapping algorithm, PLAmap, for CPLD architectures which consist of a large number of PLA-style logic cells. The primary goal of our mapping algorithm is to minimize the depth of the mapped circuit. Meanwhile, we have successfully reduced the area of the mapped circuits by applying several heuristic techniques, including threshold control of PLA fanouts and product terms, slack-time relaxation, and PLA-packing. We compare our PLAmap with a recently-published algorithm TEMPLA [1] and a commercial tool, Altera's MAX+PLUS II [16]. Experimental results on various MCNC benchmarks show that overall TEMPLA uses 8 to 11% less area at the cost of 96 to 106% more mapping depth, and MAX+PLUS II uses 12% less area but 58% more delay compared with our mapper.

[1]  Jason Cong,et al.  Combinational logic synthesis for LUT based field programmable gate arrays , 1996, TODE.

[2]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[3]  Robert K. Brayton,et al.  Cross-talk immune VLSI design using a network of PLAs embedded in a regular layout fabric , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[4]  Massoud Pedram,et al.  PLATO P: PLA timing optimization by partitioning , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[5]  Jason Helge Anderson,et al.  Technology mapping for large complex PLDs , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[6]  David Harrison,et al.  A fast partitioning method for PLA-based FPGAs , 1992, IEEE Design & Test of Computers.

[7]  Chi-Ho Lin,et al.  A new techology mapping for CPLD under the time constraint , 2001, ASP-DAC '01.

[8]  Jason Cong,et al.  On area/depth trade-off in LUT-based FPGA technology mapping , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[9]  Eugene L. Lawler,et al.  Module Clustering to Minimize Delay in Digital Networks , 1969, IEEE Transactions on Computers.

[10]  Jason Cong,et al.  Technology mapping for k/m-macrocell based FPGAs , 2000, FPGA '00.

[11]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Jason Cong,et al.  DAG-Map: graph-based FPGA technology mapping for delay optimization , 1992, IEEE Design & Test of Computers.

[13]  A. El Gamal,et al.  FPGA performance versus cell granularity , 1991, Proceedings of the IEEE 1991 Custom Integrated Circuits Conference.

[14]  Dariusz Kania.  A technology mapping algorithm for PAL-based devices using multi-output function graphs , 2000, Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future.

[15]  Jonathan Rose,et al.  Chortle-crf: fast technology mapping for lookup table-based FPGAs , 1991, 28th ACM/IEEE Design Automation Conference.

[16]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[17]  Jason Cong,et al.  Synthesis challenges for next-generation high-performance and high-density PLDs , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[18]  Jason Cong,et al.  Invited talk: synthesis challenges for next-generation high-performance and high-density PLDs , 2000, ASP-DAC '00.