An efficient merging scheme for prescribed skew clock routing

17Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In ultra-deep submicron very large-scale integration (VLSI) designs, clock network layout plays an increasingly important role on determining circuit quality indicated by timing, power consumption, cost, power-supply noise, and tolerance to process variations. In this brief, a new merging scheme is proposed for prescribed nonzero skew routings which are useful in reducing clock cycle time, suppressing power-supply noise, and improving tolerance to process variations. This technique is simple and easy to implement for practical applications. Experimental results on benchmark circuits with both buffered and unbuffered routings exhibit large improvement on wirelength and buffer cost compared with other existing works. © 2005 IEEE.

Cite

CITATION STYLE

APA

Chaturvedi, R., & Hu, J. (2005). An efficient merging scheme for prescribed skew clock routing. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 13(6), 750–754. https://doi.org/10.1109/TVLSI.2005.848821

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free