ACM Home Page
Please provide us with feedback. Feedback
Simultaneous depth and area minimization in LUT-based FPGA mapping
Full text PdfPdf (72 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays table of contents
Monterey, California, United States
Pages: 68 - 74  
Year of Publication: 1995
ISBN:0-89791-743-X
Authors
Jason Cong  Department of Computer Science, University of California, Los Angeles, CA
Yean-Yow Hwang  Department of Computer Science, University of California, Los Angeles, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 37,   Citation Count: 28
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/201310.201322
What is a DOI?

ABSTRACT

In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization during the mapping process by computing min-cost min-height K-feasible cuts for critical nodes for depth minimization and computing min-cost K-feasible cuts for non-critical nodes for area minimization. CutMap guarantees depth-optimal mapping solutions in polynomial time as the FlowMap algorithm but uses considerably fewer K-Luts. We have implemented CutMap and tested it on the MCNC logic synthesis benchmarks. For depth-optimal mapping solutions, CutMap uses 15% fewer K-LUTs than FlowMap. We also tested CutMap followed by the depth relaxation routines in FlowMap_r algorithm, which achieves area minimization by depth relaxation. CutMap followed FlowMap_r performs better than FlowMap_r.


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.

 
BrRS87
Brayton, R. K., R. Rudell, and A. L. Sangiovanni-Vincentelli, "MIS: A Multiple- Level Logic Optimization," IEEE Transactions on CAD, pp. 1062-1081, Nov. 1987.
 
ChCD92
 
CoDi93b
 
CoDi94a
Cong, J. and Y. Ding, "An Optimal Technology Mapping Algorithm fo Delay Optimization in Lookup-Table Based FPGA Designs," IEEE Trans. on Computer-Aided Design, Vol. 13, pp. 1-12, Jan. 1994.
 
CoDi94b
Cong, J. and Y. Ding, "On Area/Depth Tradeoff in LUT-Based FPGA Technology Mapping," IEEE Trans. on VLSI Systems, Vol. 2, June 1994.
 
CoHw95
Cong, J. and Y.-Y. Hwang, "Simultaneous Depth and Area Minimization in LUT-based FPGA Mapping," in UCLA Computer Science Department Technical Report CSD-950001, , Los Angeles, CA (January 1995).
CoLB94
 
FaMa93
Farrahi, A. and M. Sarrafzadeh, "On the Lookup-Table Minimization Problem for FPGA Technology Mapping," in Tech. Report 93-AC-102, , Department of EECS, Northwestern University (July 1993).
FrRC90
 
FrRV91b
Francis, R. J., J. Rose, and Z. Vranesic, "Technology Mapping for Delay Optimization of Lookup Table-Based FPGAs," MCNC Logic Synthesis Workshop, 1991.
Ka91a
LaPV93
MuNS90
 
MuSB91
Murgai, R., N. Shenoy, R. K. Brayton, and A. S angiov anni- V inc ente lli, ' 'Performance Directed Synthesis for Table Look Up Programmable Gate Arrays," Prec. IEEE Int'l Conf. on Computer-Aided Design, pp. 572- 575, Nov. 1991.
 
ScKC92

CITED BY  29
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Jason Cong: colleagues
Yean-Yow Hwang: colleagues

Peer to Peer - Readers of this Article have also read: