ACM Home Page
Please provide us with feedback. Feedback
Placement-driven technology mapping for LUT-based FPGAs
Full text PdfPdf (253 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
SESSION: Logic synthesis and mapping table of contents
Pages: 121 - 126  
Year of Publication: 2003
ISBN:1-58113-651-X
Authors
Joey Y. Lin  Aplus Design Technologies, Inc.
Ashok Jagannathan  UCLA Computer Science Department
Jason Cong  UCLA Computer Science Department
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 30,   Citation Count: 9
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/611817.611836
What is a DOI?

ABSTRACT

In this paper, we study the problem of placement-driven technology mapping for table-lookup based FPGA architectures to optimize circuit performance. Early work on technology mapping for FPGAs such as Chortle-d[14] and Flowmap[3] aim to optimize the depth of the mapped solution without consideration of interconnect delay. Later works such as Flowmap-d[7], Bias-Clus[4] and EdgeMap consider interconnect delays during mapping, but do not take into consideration the effects of their mapping solution on the final placement. Our work focuses on the interaction between the mapping and placement stages. First, the interconnect delay information is estimated from the placement, and used during the labeling process. A placement-based mapping solution which considers both global cell congestion and local cell congestion is then developed. Finally, a legalization step and detailed placement is performed to realize the design. We have implemented our algorithm in a LUT based FPGA technology mapping package named PDM (Placement-Driven Mapping) and tested the implementation on a set of MCNC benchmarks. We use the tool VPR[1][2] for placement and routing of the mapped netlist. Experimental results show the longest path delay on a set of large MCNC benchmarks decreased by 12.3% on the average.


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
 
4
A. Mathur and C. L. Liu. "Performance-driven technology mapping for lookup-table based FPGAs using the general delay model," Proceedings of International ACM/SIGDA Workshop on FPGAs, Feb 1994.
 
5
 
6
J. Cong and Y. Ding, "On area/depth trade-off in LUT-based FPGA technology mapping," IEEE Transactions on VLSI Systems, Vol. 2, June 1994.
 
7
J. Cong, Y. Ding, T. Gao and K. C. Chen, "LUT-based FPGA technology mapping under arbitrary net-delay model," Computers and Graphics, vol. 18, no. 4, pp. 507--516, 1994.
8
 
9
10
 
11
E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton and A. Sangiovanni-Vincentelli, "SIS: A system for sequential circuit synthesis", Memorandum No. UCB/ERL M92/41, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, May 1992.
12
 
13
 
14
R. J. Francis, J. Rose and Z. Vranesic, "Technology mapping of lookup table-based FPGAs for performance," Proceedings of IEEE International Conference on CAD, pp. 568--571, Nov. 1991.

CITED BY  9

Collaborative Colleagues:
Joey Y. Lin: colleagues
Ashok Jagannathan: colleagues
Jason Cong: colleagues