ACM Home Page
Please provide us with feedback. Feedback
Simultaneous logic decomposition with technology mapping in FPGA designs
Full text PdfPdf (276 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: 48 - 55  
Year of Publication: 2001
ISBN:1-58113-341-3
Authors
Gang Chen  Computer Science Department, University of California, Los Angeles, CA
Jason Cong  Computer Science Department, 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): 2,   Downloads (12 Months): 20,   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.360298
What is a DOI?

ABSTRACT

Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact of logic decomposition on delay and area of the technology mapping solutions is not well understood. In this paper, we present an algorithm named SLDMap that performs delay-minimized technology mapping on a large set of decompositions and simultaneously controls the mapping area under delay constraints. Our study leads to two conclusions: (1) For depth minimization, the best algorithms in conventional flow (dmig + CutMap) produce satisfactory results with a short runtime, even with a fixed decomposition; (2) When all the structural decompositions of the 6-bounded Boolean network are explored, SLDMap consistently outperforms the state-of-the-art separate flow (dmig + CutMap) by 12% in depth and 10% in area on average; it also consistently outperforms the state-of-the-art combined approach dogma by 8% in depth and 6% in area on 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
R. Murgai, N. Shenoy, R. K. Brayton and A. Sangiovanni- Vincentelli, Performance Directed Synthesis For Table Lookup Programmable Gate Arrays, IEEE International Conference on CAD, 1991, pp. 572-575.
 
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 Computer-Aided Design of Integrated Circuits And Systems, 1994, vol. 13, no. 1, pp. 1-12.
 
6
J. Cong and Y. Ding, On Area/Delay Trade-off in LUT-based FPGA Technology Mapping, IEEE Trans. on VLSI Systems, June 1994, vol. 2, no. 2, pp. 137-148.
7
 
8
A. Farrahi and M. Sarrafzadeh, Complexity of the Lookup-Table Minimization Problem for FPGA Technology Mapping, IEEE Trans. on Computer-Aided Design of Integrated Circuits And Systems, 1994, vol. 13, no. 11, pp. 1319-1332.
9
 
10
 
11
E. Lehman, Y. Watanabe, J. Grodstein and H. Harkness, Logic Decomposition during Technology Mapping, IEEE Trans. on Computer-Aided Design of Integrated Circuits And Systems, 1997, vol. 16, no. 8, pp. 813-834.
12
 
13
E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton and A. Sangiovanni-Vincentelli, SIS: A System for Sequential Circuit Synthesis, Electronics Research Laboratory, Memorandum No. UCB/ERL M92/41, 1992.
14
 
15
G. Chen and J. Cong, Simultaneous Logic Decomposition with Technology Mapping in FPGA Designs, UCLA Computer Science Department Technical Report CSD-200030.
16
 
17