ACM Home Page
Please provide us with feedback. Feedback
FPGA area reduction by multi-output function based sequential resynthesis
Full text PdfPdf (456 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 45th annual Design Automation Conference table of contents
Anaheim, California
SESSION: CAD for FPGA table of contents
Pages 24-29  
Year of Publication: 2008
ISBN ~ ISSN:0738-100X , 978-1-60558-115-6
Authors
Yu Hu  University of California, Los Angeles
Victor Shih  University of California, Los Angeles
Rupak Majumdar  University of California, Los Angeles
Lei He  University of California, Los Angeles
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: IEEE/CASS/CANDE/CEDA
: The EDA Consortium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 76,   Citation Count: 2
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/1391469.1391478
What is a DOI?

ABSTRACT

We propose a new resynthesis algorithm for FPGA area reduction. In contrast to existing resynthesis techniques, which consider only single-output Boolean functions and the combinational portion of a circuit, we consider multi-output functions and retiming, and develop effective algorithms that incorporate recent improvements to SAT-based Boolean matching. Our experimental results show that with the optimal logic depth, the resynthesis considering multi-output functions reduces area by up to 0.4% compared to the one considering single-output functions, and the sequential resynthesis reduces area by up to 10% compared to combinational resynthesis when both consider multi-output functions. Furthermore, our proposed resynthesis algorithm reduces area by up to 16% compared to the best existing academic technology mapper, Berkeley ABC.


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
A. Farrahi and M. Sarrafzadeh, "Complexity of the lookup-table minimization problem for fpga technology mapping," TCAD, 1994.
2
3
 
4
V. Manohararajah, S. D. Brown, and Z. G. Vranesic, "Heuristics for area minimization in lut-based fpga technology mapping," IWLS, 2004.
 
5
 
6
"Abc: A system for sequential synthesis and verification," in http://www.eecs.berkeley.edu/alumni/abc/.
7
 
8
K. Minkovich and J. Cong, "Optimality study of logic synthesis for lut-based fpgas," FPGA, 2006.
 
9
G. D. Micheli, "Synchronous logic synthesis: algorithms for cycle-time minimization," TCAD, 1991.
 
10
A. Mishchenko, S. Chatterjee, and R. Brayton, "Dag-aware aig rewriting," DAC, 2005.
 
11
S. Malik, E. Sentovich, R. Brayton, and A. Sangiovanni-Vincentelli, "Retiming and resynthesis: Optimizing sequential networks with combinational techniques," TCAD, 1991.
 
12
R. Brayton and A. Mishchenko, "Sequential rewriting," IWLS, 2007.
 
13
14
15
16
17
 
18
19
 
20
 
21
22
 
23
C. E. Leiserson and J. B. Saxe, "Retiming synchronous circuitry," Algorithmica, 1991.
24
 
25
N. Een and N. Sorensso, http://www.cs.chalmers.se/Cs/Research/ FormalMethods/MiniSat/MiniSat.html.
 
26
MCNC, MCNC Designers' Manual, 1993.
 
27
"Iwls 2005 benchmarks," in http://iwls.org/iwls2005/benchmarks.html.
28


Collaborative Colleagues:
Yu Hu: colleagues
Victor Shih: colleagues
Rupak Majumdar: colleagues
Lei He: colleagues