ACM Home Page
Please provide us with feedback. Feedback
Optimizing sequential cycles through Shannon decomposition and retiming
Full text PdfPdf (204 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings table of contents
Munich, Germany
SESSION: Sequential optimisation, clocking and Boolean matching table of contents
Pages: 1085 - 1090  
Year of Publication: 2006
ISBN:3-9810801-0-6
Authors
Cristian Soviani  Columbia University, New York
Olivier Tardieu  Columbia University, New York
Stephen A. Edwards  Columbia University, New York
Sponsors
: The EDA Consortium
EDAA : European Design and Automation Association
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Optimizing sequential cycles is essential for many types of high-performance circuits, such as pipelines for packet processing. Retiming is a powerful technique for speeding pipelines, but it is stymied by tight sequential cycles. Designers usually attack such cycles by manually combining Shannon decomposition with retiming---effectively a form of speculation---but such manual decomposition is error-prone.We propose an efficient algorithm that simultaneously applies Shannon decomposition and retiming to optimize circuits with tight sequential cycles. While the algorithm is only able to improve certain circuits (roughly half of the benchmarks we tried), the performance increase can be dramatic (7%--61%) with only a modest increase in area (3%--12%). The algorithm is also fast, making it a practical addition to a synthesis flow.


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. L. Berman, D. J. Hathaway, A. S. LaPaugh, and L. Trevillyan. Efficient techniques for timing correction. In Proc. ISCAS, pages 415--419, 1990.
 
2
3
 
4
C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1):5--35, 1991.
 
5
S. Malik, E. M. Sentovich, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Retiming and resynthesis: Optimizing sequential networks with combinational techniques. IEEE Transactions on CAD, 10(1):74--84, 1991.
6
 
7
P. C. McGeer, R. K. Brayton, A. L. Sangiovanni-Vincentelli, and S. K. Sahni. Performance enhancement through the generalized bypass transform. In ICCAD, pages 184--187, 1991.
8
9
 
10
E. M. Sentovich et al. SIS: A system for sequential circuit synthesis. Technical report, UCB/ERL M92/41, 1992.
 
11
 
12
K. J. Singh, A. R. Wang, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Timing optimization of combinational logic. In Proceedings of ICCAD, pages 282--285, 1988.
 
13
H. Touati, H. Savoj, and R. K. Brayton. Delay optimization of combinational logic circuits by clustering and partial collapsing. In Proceedings of ICCAD, pages 188--191, 1991.
 
14
H. Touati, N. Shenoy, and A. L. Sangiovanni-Vincentelli. Retiming for table-lookup field-programmable gate arrays. In Proc. Intl. Workshop FPGAs, pages 89--93, 1992.
Collaborative Colleagues:
Cristian Soviani: colleagues
Olivier Tardieu: colleagues
Stephen A. Edwards: colleagues