The unconstrained clock skew scheduling is practically limited due to the difficulties in implementing a wide spectrum of dedicated clock delays in a reliable manner. This results in a significant limitation of the optimization potential. As an alternative multi domain clock skew scheduling technique with dedicated clock buffer will be implemented. In this paper, an algorithm to determine the minimum number of clock domains to be used for multi domain clock skew scheduling is presented. The experimental results show the optimized clock period, dynamic power consumption implemented on digital logic part of telephone answering machine.

1. Min Ni and Seda Ogrenci Memik, Senior Member, IEEE, “A fast heuristic algorithm for multi domain clock skew scheduling” . IEEE Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 18, No. 4, April 2010
2. R.B.Deokar and S.S.Sapatnekar, “A graph-theoretic approach to clock skew optimization,” in Proc. Int. Symp. Circuits Syst., 1994, pp.407–410.
3. J.P.Fishburn, “Solving a system of difference constraints with variables restricted to a finite set,” Inf. Process. Lett., vol. 82, no. 3, pp.143–144, May 2002
4. J.P.Fishburn, “Clock skew optimization,” IEEE Trans. Comput., vol.39, no. 7, pp. 945–951, Jul. 1990.
5. S. Huang, C. Chang, and Y. Nieh, “Fast multi-domain clock skew scheduling for peak current reduction,” in Proc. Asian South Pacific Des. Autom. Conf., 2006, pp. 254–259.
6. H. Jiang, K. Wang, and M. Marek-Sadowska, “Clock skew bounds estimation under power supply and process variations,” in Proc. ACM Great Lakes Symp. VLSI, 2005, pp. 332–336.
7. V. Khandelwal and A. Srivastava, “Variability-driven formulation for simultaneous gate sizing and postsilicon tunability allocation,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 27, no. 4, pp. 610–620, Apr. 2008.
8. C. Lin and H. Zhou, “Clock skew scheduling with delay padding for prescribed skew domains,” in Proc. Asian South Pacific Des. Autom. Conf., 2007, pp. 541–546.
9. L. Liu, T. Chou, A. Aziz, and D. F. Wong, “Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion,” in Int. Symp. Phys. Des., 2000, pp. 33–38.
10. K. Ravindran, A. Kuehlmann, and E. Sentovich, “Multi-domain clock skew scheduling,” in Proc. Int. Conf. Comput.-Aided Des., 2003, pp. 801–808.
11. S. Tam, R. D. Limaye, and U. N. Desai, “Clock generation and distribution for the 130-nm itanium 2 processor with 6-MB on-die 13 cache,” IEEE J. Solid-State Circuits, vol. 39, no. 4, pp. 636–642, Apr. 2004.
12. S. Tam, S. Rusu, U. N. Desai, R. Kim, J. Zhang, and I. Young, “Clock generation and distribution for the first IA-64 microprocessor,” IEEE J. Solid-State Circuits, vol. 35, no. 11, pp. 1545–1552, Nov. 2000.
13. J.Tsai, T. Chen, and C. C. Chen, “Optimal minimum-delay/area zero skew clock tree wire-sizing in pseudo-polynomial time,” in Proc. Int. Symp. Phys. Des., 2003, pp. 166–173.
14. J.Tsai, L. Zhang, and C. C. Chen, “Statistical timing analysis driven post-silicon-tunable clock-tree synthesis,” in Proc. Int. Conf. Comput.- Aided Des., 2005, pp. 575–581.
15. V.Chvatal, Linear Programming. New York: Freeman, 1983.
16. A.Vittal, H. Ha, F. Brewer, and M. Marek-Sadowska, “Clock skew optimization for ground bounce control,” in Proc. Int. Conf. Comput.-Aided Des., 1996, pp. 395–399.
17. Z. Xing and P. Banerjee, “A parallel algorithm for zero skew clock tree routing,” in Proc. Int. Symp. Phys. Des., 1998, pp. 118–123.

Clock skew domain clock skew scheduling (CSS) Low Power VLSI Synopsys Design Compiler