ACM Home Page
Please provide us with feedback. Feedback
SPFD-based global rewiring
Full text PdfPdf (266 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays table of contents
Monterey, California, USA
Session: Physical Design table of contents
Pages: 77 - 84  
Year of Publication: 2002
ISBN:1-58113-452-5
Authors
Jason Cong  UCLA, Los Angeles, CA
Yizhou Lin  UCLA, Los Angeles, CA
Wangning Long  UCLA, Los Angeles, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Citation Count: 6
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/503048.503060
What is a DOI?

ABSTRACT

This paper presents the theory and algorithm for SPFD-based global rewiring (SPFD-GR). SPFD-GR allows us to globally replace a target wire with some alternative wire possibly far away from the target. It successfully overcomes the limitations of the existing SPFD-based local rewiring algorithm (SPFD-LR), which can only replace a wire with another wire that has the same destination node. In order to perform SPFD-based global rewiring, we developed the theory and algorithm for solving a fundamental problem in SPFD-based rewiring: Given the in-pin functions of a node and the SPFD at the node's out-pin, is there a way to modify the node's internal function so that the SPFD at the node's out-pin can be satisfied? Combined with a state-of-the-art partitioning algorithm, SPFD-GR scales well to large circuits with good synthesis quality. Our SPFD-based rewiring algorithm is ideal for LUT-based FPGAs, where the node's internal function can be changed freely without any area or delay penalty. Extensive experimental results show that for LUT-based FPGAs, the rewiring ability of SPFD-GR (in terms of the number of wires that have alternative wires) is 1.45, and 3 times that of SPFD-LR and an ATPG-based rewiring algorithm (with a preliminary experimental flow), respectively, while the run time is quite acceptable. When applied to the post-mapping area reduction for large LUT-based FPGAs under circuit depth restriction, SPFD-GR achieves 17.1% average area reduction, with no or little delay increase.


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, Quartus II Software Overview, http:// www.altera.com/products/software/quartus2/qts-index.html.
 
2
L. A. Entrena and K.-T. Cheng. Combinational and Sequential Logic Optimization by Redundancy Addition and Removal. IEEE Transaction on CAD of ICS, Vol. 14, No. 7, pp. 909-916, July 1995.
 
3
R. K. Brayton. Understanding SPFDs: A New Method for Specifying Flexibility. In International Workshop on Logic Synthesis, 1997.
4
 
5
S.-C. Chang, M Marek-Sadowska, and K-T Cheng. Perturb and Simplify: Multilevel Boolean Network Optimizer. IEEE Trans CAD of ICAS, Vol. 15, No. 12, Dec 1996, pp. 1494 - 1504.
 
6
S.-C. Chang, K.-T. Cheng, N.-S. Woo, and M. Marek- Sadowska. Postlayout rewiring using alternative wires. IEEE Transaction on CAD of ICS, Vol. 16, No.6, p.587-96, June 1997.
 
7
 
8
P. Chong, Y. Jiang, S. Khatri, F. Mo, S. Sinha, and R. Brayton. Don't Care Wires in Logical/Physical Design. In International Workshop on Logic Synthesis, pp. 1- 9, 2000.
9
10
11
12
13
14
 
15
 
16
E. Sentovich, et. al. SIS: A System for Sequential Circuit Synthesis. Memorandum No. UCB/ERL M92/41, Dept. EECS, UC Berkeley, 1992.
17
 
18
Fabio Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. Technique Report, Dept. of ECE, Univ. of Colorado at Boulder, 1998.
 
19
 
20
 
21
 
22
J. Cong, Y. Lin, W. Long. SPFD-based Global Rewiring. In UCLA CSD Tech. Report. No.010043. Dec. 2001.


Collaborative Colleagues:
Jason Cong: colleagues
Yizhou Lin: colleagues
Wangning Long: colleagues