Abstract
The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagation delay and the shortest propagation delay from primary inputs to primary outputs. The objective of this paper is to minimize the amount of delay inserted while achieving the shortest clock period.
Inserting delay buffers is done after traditional delay optimization. We propose an optimal algorithm based on a novel linear programming formulation. Our algorithm can also be used to solve similar delay buffer problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S.W. Cheng, H.C. Chen, David H.C. Du and A. Lim, The Role of Long and Short Paths in Circuit Performance Optimization, 29th ACM/IEEE Design Automation Conference, pages 543–548, 1992.
X. Hu, R.G. Harber, S.C. Bass, Geo. Minimizing the number of Delay Buffers in the Synchronization of Pipelined Systems. 28th ACM/IEEE Design Automation Conference, pages 758–763, 1991.
S.Z. Sun, David H.C. Du, Y.C. Hsu and H.C. Chen. On valid Clocking for Combinational Circuits. Will appear in the proceedings of International Conference on Computer Design, 94.
Narendra V. Shenoy, R. K. Brayton, A. L. Sangiovanni-Vincentelli, Minimum Padding to Satisfy Short Path Constraints. In the proceedings of the International Conference on Computer-Aided Design, pages 156–161, 1993
S.Z. Sun, David H. C. Du, G.L. Xue. Efficient Algorithms for Delay Buffers Minimization Problem. Submitted to International Conference on Computer-Aided Design, 94.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, S., Du, D.H.C., Xue, G. (1994). Achieving the shortest clock period by inserting the minimum amount of delay. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_236
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_236
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive