ACM Home Page
Please provide us with feedback. Feedback
Performance-driven mapping for CPLD architectures
Full text PdfPdf (266 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays table of contents
Monterey, California, United States
Pages: 39 - 47  
Year of Publication: 2001
ISBN:1-58113-341-3
Authors
Deming Chen  Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Jason Cong  Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Milos D. Ercegovac  Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Zhijun Huang  Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 25,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/360276.360296
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
J. Cong and Y. Ding, FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs", IEEE Trans. on Computer-Aided Design, Jan. 1994, Vol. 13, No. 1, pp.1- 12.
 
4
J. Cong and Y. Ding, On Area/Depth Trade-off in LUT-based FPGA Technology Mapping", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.2, (no.2), June 1994. pp.137-148.
5
6
7
8
 
9
 
10
 
11
J.L. Kouloheris and A. El Gamal, FPGA Performance vs. Cell granularity", Proc. Custom Integrated Circuits Conference, 1991, pp.621-624.
 
12
J.L. Kouloheris, Empirical Study of the Effect of Cell Granularity on FPGA Density andPerformance", PhD thesis, Stanford University, 1993.
 
13
E.L. Lawler, K.N. Levitt, and J. Turner, Module Clustering to Minimize Delay in Digital Networks", IEEE Trans. on Computers, Vol. C18(1), Jan. 1969, pp.47-57.
 
14
 
15
Ellen Sentovich, et.al., SIS: A System for Sequential Circuit Synthesis", Electronics Research Lab., Memo. No. UCB/ERL M92/41, 1992.
 
16
MAX 7000B, Programmable Logic Device Family, the Altera Data Book, Altera Corporation, February 2000.
 
17
Understanding MAX 7000 Timing, Application Note 94, Altera Corporation, May 1999.
 
18
The Cypress Data Book, Cypress Semiconductor Corporation, Aug. 2000.
 
19
The Lattice Data Book, Lattice Semiconductor Corporation, July 2000.


Collaborative Colleagues:
Deming Chen: colleagues
Jason Cong: colleagues
Milos D. Ercegovac: colleagues
Zhijun Huang: colleagues