Clock Skew Optimization for Peak Current Reduction

  • L. Benini
  • P. Vuillod
  • A. Bogliolo
  • G. De Micheli

Abstract

The presence of large current peaks on the power and ground lines is a serious concern for designers of synchronous digital circuits. Current peaks are caused by the simultaneous switching of highly loaded clock lines and by the signal propagation through the sequential logic elements. In this work we propose a methodology for reducing the amplitude of the current peaks. This result is obtained by clock skew optimization. We propose an algorithm that, for a given clock cycle time, determines the clock arrival time at each flip-flop in order to minimize the current peaks while respecting timing constraint. Our results on benchmark circuits show that current peaks can be reduced without penalty on cycle time and average power dissipation. Our methodology is therefore well-suited for low-power systems with reduced supply voltage, where low noise margins are a primary concern.

Keywords

Expense Lution Guaran 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Friedman (Ed.), Clock Distribution Networks in VLSI Circuits and Systems, IEEE Press, 1995.Google Scholar
  2. 2.
    R. Tsay, “An exact zero-skew clock routing algorithm,” IEEE Transactions on CAD of Integrated Circuits and Systems, Vol. 12, No. 2, pp. 242–249, Feb. 1993.MathSciNetCrossRefGoogle Scholar
  3. 3.
    J.-D. Cho and M. Sarrafzadeh, “A buffer distribution algorithm for high performance clock net optimization,” IEEE Transactions on VLSI Systems, Vol. 3, No. 1, pp. 84–97, March 1995.CrossRefGoogle Scholar
  4. 4.
    N.-C. Chou et al., “On general zero-skew clock net construction,” IEEE Transactions on VLSI Systems, Vol. 3, No. 1, pp. 141–146, March 1995.CrossRefGoogle Scholar
  5. 5.
    Actel, FPGA Databook and Design Guide, 1994.Google Scholar
  6. 6.
    T. Szymanski, “Computing optimal clock schedules,” Pmceedings of the Design Automation Conference, pp. 399–404, 1992.Google Scholar
  7. 7.
    J. Fishburn, “Clock skew optimization,” IEEE Transactions on Computers, Vol. 39, No. 7, pp. 945–951, July 1990.CrossRefGoogle Scholar
  8. 8.
    N. Shenoy, R. Brayton, and A. Sangiovanni-Vincentelli “Graph algorithms for clock schedule optimization,” Proceedings of the International Conference on Computer-Aided Design, pp. 132–136, 1992.Google Scholar
  9. 9.
    K. Sakallah, T. Mudge, and O. Olukotun, “Analysis and design of latch-controlled synchronous digital circuits,” IEEE Transactions on CAD of’Integrated Circuits and Systems, Vol. 1 I, No. 3, pp. 322–333, March 1992.CrossRefGoogle Scholar
  10. 10.
    T. Burks and K. Sakallah, “Min-max linear programming and the timing analysis of digital circuits,” Proceedings of the International Conference on Computer-Aided Design, pp. 152–155, 1993.Google Scholar
  11. 11.
    J. Xi and W. Dai, “Useful-skew clock routing with gate sizing for low power design,” Proceedings of the Design Automation Conference, pp. 383–388, 1996.Google Scholar
  12. 12.
    S. Chowdury and J. Barkatullah, “Estimation of maximum currents in MOS IC logic circuits,” IEEE Transaction on CAD of Integrated Circuits and Systems, Vol. 9, No. 6, pp. 642–654, 1990.CrossRefGoogle Scholar
  13. 13.
    J. Neves and E. Friedman, “Design methodology for synthesizing clock distribution networks exploiting nonzero localized clock skew,” IEEE Transactions on VLSI systems, Vol. 4, No. 2, pp. 286–291, June 1996.CrossRefGoogle Scholar
  14. 14.
    E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehard and Winston, 1976.MATHGoogle Scholar
  15. 15.
    K. Murty, Linear Programming, Wiley, 1983.Google Scholar
  16. 16.
    A. Bogliolo, L. Benini, and B. Riccò, “Power estimation of cell-based CMOS circuits,” Proceedings of the Design Automation Conference, pp. 433–438, 1996.Google Scholar
  17. 17.
    R. Horst and P. Pardalos (Ed.), Handbook of Global Optimization, Kluwer, 1995.MATHGoogle Scholar
  18. 18.
    D. Goldberg, “Genetic algorithms in search,” Optimization and Machine Learning, Addison-Wesley, 1989.Google Scholar
  19. 19.
    M. Horowitz, “Clocking strategies in high performance processors,” Symposium on VLSI Circuits Digest of Technical Papers, pp. 50–53, 1996.Google Scholar
  20. 20.
    J. Yoo and G. Gopalakrishnan et al., “High speed counterflowclocked pipelining illustrated on the design of HDTV sub-band vector quantizer chips,” Advanced Research on VLSI, Chapel Hill, 1995, pp. 112–118.Google Scholar
  21. 21.
    J. Xi and W. Dai, “Buffer insertion and sizing under process variations for low power clock distribution,” Proceedings of the Design Automation Conference, pp. 491–496, 1995.Google Scholar
  22. 22.
    Meta-Software Inc., Hspice User Manual,v. H9001, 1990.Google Scholar
  23. 23.
    A. Bogliolo, L. Benini, G. De Micheli, and B. Riccò, “Gate-level current waveform simulation,” International Symposium on Low Power Electronics and Design, pp. 109–112, 1996.Google Scholar
  24. 24.
    J. Grefenstette, A User’s Guide to GENESIS, 1990.Google Scholar
  25. 25.
    S. Yang, “Logic synthesis and optimization benchmarks user guide. Version 3.0,” MCNC Technical Report, 1991.Google Scholar
  26. 26.
    R. Brodersen (Ed.), Anatomy of a Silicon Compiler, Kluwer, 1992.Google Scholar
  27. 27.
    Epic Design Technology, Inc., PowerMill, v. 3. 3, 1995.Google Scholar
  28. 28.
    R. San Martin and J. Knight, “Power-profiler: Optimizing ASICs power consumption at the behavioral level,” Proceedings of the Design Automation Conference, pp. 42–47, 1995.Google Scholar
  29. 29.
    T. Szymanski and N. Shenoy, “Verifying clock schedules,” Proceedings of the International Conference on Computer-Aided Design, pp. 124–131, 1992.Google Scholar
  30. 30.
    T. Burd, “Low-power CMOS library design methodology,” M.S. Report, University of California, Berkeley, UCB/ERL M94 /89, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • L. Benini
    • 1
  • P. Vuillod
    • 1
  • A. Bogliolo
    • 1
    • 2
  • G. De Micheli
    • 1
  1. 1.Computer Systems LaboratoryStanford UniversityStanfordUSA
  2. 2.DEIS, Università di BolognaItaly

Personalised recommendations