Performance-driven mapping for CPLD architectures

  • Authors:
  • Deming Chen;Jason Cong;Milos D. Ercegovac;Zhijun Huang

  • Affiliations:
  • Department of Computer Science, University of California, Los Angeles, Los Angeles, CA;Department of Computer Science, University of California, Los Angeles, Los Angeles, CA;Department of Computer Science, University of California, Los Angeles, Los Angeles, CA;Department of Computer Science, University of California, Los Angeles, Los Angeles, CA

  • Venue:
  • FPGA '01 Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.