Buffered Clock Tree Synthesis with Non-Zero Clock Skew Scheduling for Increased Tolerance to Process Parameter Variations
An integrated top-down design system is presented in this paper for synthesizing clock distribution networks for application to synchronous digital systems. The timing behavior of a synchronous digital circuit is obtained from the register transfer level description of the circuit, and used to determine a non-zero clock skew schedule which reduces the clock period as compared to zero skew-based approaches. Concurrently, the permissible range of clock skew for each local data path is calculated to determine the maximum allowed variation of the scheduled clock skew such that no synchronization failures occur. The choice of clock skew values considers several design objectives, such as minimizing the effects of process parameter variations, imposing a zero clock skew constraint among the input and output registers, and constraining the permissible range of each local data path to a minimum value.
The clock skew schedule and the worst case variation of the primary process parameters are used to determine the hierarchical topology of the clock distribution network, defining the number of levels and branches of the clock tree and the delay associated with each branch. The delay of each branch of the clock tree is physically implemented with distributed buffers targeted in CMOS technology using a circuit model that integrates short-channel devices with the signal waveform shape and the characteristics of the clock tree interconnect. A bottom-up approach for calculating the worst case variation of the clock skew due to process parameter variations is integrated with the top-down synthesis system. Thus, the local clock skews and a clock distribution network are obtained which are more tolerant to process parameter variations.
This methodology and related algorithms have been demonstrated on several MCNC/ISCAS-89 benchmark circuits. Increases in system-wide clock frequency of up to 43% as compared with zero clock skew implementations are shown. Furthermore, examples of clock distribution networks that exploit intentional localized clock skew are presented which are tolerant to process parameter variations with worst case clock skew variations of up to 30%.
KeywordsData Path Clock Period Feedback Path Benchmark Circuit Permissible Range
Unable to display preview. Download preview PDF.
- 1.S. Pullela, N. Menezes, J. Omar, and L.T. Pillage, “Skew and delay optimization for reliable buffered clock trees,” Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 556–562, Nov. 1993.Google Scholar
- 2.Q. Zhu, W.W.-M. Dai, and J.G. Xi, “Optimal sizing of highspeed clock networks based on distributed RC and lossy transmission line models,” Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 628–633, Nov. 1993.Google Scholar
- 3.J. Cong and K.-S. Leung, “Optimal wiresizing under the distributed elmore delay model,” Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 634–639, Nov. 1993.Google Scholar
- 5.H.B. Bakoglu, J.T. Walker, and J.D. Meindl, “A symmetric clock-distribution tree and optimized high-speed interconnections for reduced clock skew in ULSI and WSI circuits,” Proceedings of the IEEE International Conference on Computer Design, pp. 118–122, Oct. 1986.Google Scholar
- 8.S. Lin and C.K. Wong, “Process-variation-tolerant clock skew minimization,” Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 284–288, Nov. 1994.Google Scholar
- 10.E.G. Friedman, Clock Distribution Networks in VLSI Circuits and System, IEEE Press, 1995.Google Scholar
- 12.R.B. Deokar and S. Sapatnekar, “A graph-theoretic approach to clock skew optimization,” Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 407–410, May 1994.Google Scholar
- 14.J.L. Neves and E.G. Friedman, “Synthesizing distributed buffer clock trees for high performance ASICs,” Proceedings of the IEEE ASIC Conference, pp. 126–129, Sept. 1994.Google Scholar
- 16.K.A. Sakallah, T.N. Mudge, and O.A. Olukotun, “CheckTc and minTc: Timing verification and optimal clocking of synchronous digital circuits,” Proceedings of the IEEE/ACM Design Automation Conference, pp. 111–117, June 1990.Google Scholar
- 17.T.G. Szymanski, “Computing optimal clock schedules,” Proceedings of the IEEE/ACM Design Automation Conference, pp. 399–404, June 1992.Google Scholar
- 18.J.L. Neves and E.G. Friedman, “Optimal clock skew scheduling tolerant to process variations,” Proceedings of the ACM/IEEE Design Automation Conference, pp. 623–628, June 1996.Google Scholar
- 19.J.L. Neves, “Synthesis of Clock Distribution Networks for High Performance VLSUULSI-Based Synchronous Digital Systems,” Ph.D. Dissertation, University of Rochester, Dec. 1995.Google Scholar
- 20.J.L. Neves and E.G. Friedman, “Topological design of clock distribution networks based on non-zero clock skew specifications,” Proceedings of the IEEE Midwest Symposium on Circuits and Systems, pp. 461–471, Aug. 1993.Google Scholar
- 22.J.L. Neves and E.G. Friedman, “Circuit synthesis of clock distribution networks based on non-zero clock skew,” Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 4.175–4.178, May 1994.Google Scholar