ACM Home Page
Please provide us with feedback. Feedback
An improved algorithm for minimum-area retiming
Full text PdfPdf (131 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 2 - 7  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Naresh Maheshwari  Department of Electrical & Computer Engineering, Iowa State University, Ames, IA
Sachin S. Sapatnekar  Department of Electrical & Computer Engineering, Iowa State University, Ames, IA
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 15
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/266021.266025
What is a DOI?

ABSTRACT

The concept of improving the timing behavior of a circuit by relocatingflip-flops is called retiming and was first presented by Leisersonand Saxe. The ASTRA algorithm proposed an alternativeview of retiming using the equivalence between retiming and clockskew optimization. This work defines the relationship betweenthe Leiserson-Saxe and the ASTRA approaches and utilizes it tosolve the problem of retiming for minimum area. The new algorithm,Minaret, uses the linear programming formulation of theLeiserson-Saxe approach. The underlying philosophy of the ASTRAapproach is incorporated to reduce the number of variablesand constraints in the linear program. This reduction in the sizeof the linear program makes Minaret space and time efficient, enablingminimum area retiming of circuits with over 56,000 gates inunder 15 minutes.


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
C. Leiserson, F. Rose, and J. B. Saxe, "Optimizing synchronous circuitry by retiming," in Proceedings of the 3rd Caltech Conference on VLSI, pp. 87-116, 1983.
 
2
C. E. Leiserson and J. B. Saxe, "Retiming synchronous circuitry," Algorithmica, vol. 6, pp. 5-35, 1991.
 
3
A. Ishii, C. E. Leiserson, and M. C. Papaefthymiou, "Optimizing two-phase, level-clocked circuitry," in Advanced Research in VLSI and Parallel Systems: Proceedings of the 1992 Brown/MIT Conference, pp. 246-264, 1992.
 
4
B. Lockyear and C. Ebeling, "Optimal retiming of levelclocked circuits using symmetric clock schedules," IEEE Transactions on Computer-Aided Design, vol. 13, pp. 1097- 1109, Sept. 1994.
5
 
6
G. Even, I. Y. Spillinger, and L. Stok, "Retiming revisited and reversed," IEEE Transactions on Computer-Aided Design, vol. 15, pp. 348-357, Mar. 1996.
 
7
 
8
9
 
10
S. S. Sapatnekar and R. B. Deokar, "Utilizing the retiming skew equivalence in a practical algorithm for retiming large circuits," IEEE Transactions on Computer-Aided Design, vol. 15, pp. 1237-1248, Oct. 1996.
 
11
 
12
 
13
 
14
 
15

CITED BY  15

Collaborative Colleagues:
Naresh Maheshwari: colleagues
Sachin S. Sapatnekar: colleagues