ACM Home Page
Please provide us with feedback. Feedback
General modeling and technology-mapping technique for LUT-based FPGAs
Full text PdfPdf (1.49 MB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays table of contents
Monterey, California, United States
Pages 43-49  
Year of Publication: 1997
ISBN:0-89791-801-0
Authors
Amit Chowdhary  Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
John P. Hayes  Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 14,   Citation Count: 3
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/258305.258311
What is a DOI?

ABSTRACT

We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables (LUTs) and can yield optimal solutions. The connections between LUTs of a logic block are modeled by virtual switches, which define a set of multiple-LUT blocks (MLBs) called an MLB-basis. We identify the MLB-bases for various commercial logic blocks. Given a n MLB-basis, we formulate FPGA mapping as a mixed integer linear programming (MILP) problem to achieve both the generality and the optimality objectives. We solve the MILP models using a general-purpose MILP solver, and present the results of mapping some ISCAS.85 benchmark circuits with a variety of commercial FPGAs. Circuits of a few hundred gates can be mapped in reasonable time using the MILP approach directly. Larger circuits can be handled by partitioning them prior to technology mapping. We show that optimal or provably near-optimal solutions can be obtained for the large ISCAS.85 benchmark circuits using partitions defined by their high-level functions.


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
Altera Inc. The Altera FPGA Data Book, Sunnyvale, CaliL, 1993.
 
2
AT&T Inc. The AT~4T FPGA Data Book, Allentown, Pa., 1995.
 
3
 
4
 
5
J. Cong and Y. Ding. FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs. IEEE Trans. on CAD, 13(1):1-11, Jan. 1994.
 
6
CPLEX Optimization Inc. CPLEX documentation, 1990.
 
7
E. Detjens et ak Technology mapping in MIS. Proc. Int'l Conf. on CAD, pp. 116-119, 1987.
8
 
9
 
10
A. Sangiovanni-Vincentelli, A. El Carnal, and J. Rose. Synthesis methods for field programmable gate arrays. Proc. of IEEE, pp. 1057-1083, July 1993.
 
11
XiHnx Inc. The Programmable Logic Data Book, Santa Clara, Calif., 1994.


Collaborative Colleagues:
Amit Chowdhary: colleagues
John P. Hayes: colleagues