Clock skew minimization during FPGA placement

被引:7
作者
Zhu, KZ [1 ]
Wong, DF [1 ]
机构
[1] UNIV TEXAS, DEPT COMP SCI, AUSTIN, TX 78712 USA
关键词
clock skew; FPGA; placement;
D O I
10.1109/43.602474
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Unlike traditional ASIC technologies, the geometric structures of clock trees in a field-programmable gate array (FPGA) are usually fixed and cannot be changed for different circuit designs, Furthermore, the clock pins are connected to the clock trees via programmable switches. As a result, the load capacitances of a clock tree may be changed, depending on the utilization and distribution of logic modules in an FPGA. It is possible to minimize clock skew by carefully distributing the load capacitances or, equivalently, the logic modules used for the circuit design implementation. In this paper we present an algorithm for selecting logic modules used for circuit placement such that the clock skew is minimized, The algorithm can be applied to a variety of clock tree architectures, Including those used in the major commercial FPGA's. The algorithm can also be extended to handle buffered clock trees and multiple clock trees, Experimental results show that the algorithm can reduce clock skews significantly as compared with the traditional placement algorithms which do not consider clock skew minimization.
引用
收藏
页码:376 / 385
页数:10
相关论文
共 15 条
[1]  
*ACT CORP, 1993, ACT 3 FIELD PROGR GA
[2]  
*ACT CORP, 1992, ACT FAM FIELD PROGR
[3]  
AHRENS M, 1990, P CUST INT CIRC C
[4]  
*AT T MICR, 1993, ADV DATA SHEET FEB
[5]  
Bakoglu H., 1990, CIRCUITS INTERCONNEC
[6]   A PROCEDURE FOR PLACEMENT OF STANDARD-CELL VLSI CIRCUITS [J].
DUNLOP, AE ;
KERNIGHAN, BW .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (01) :92-98
[8]  
GAMAL AB, 1989, IEEE J SOLID-ST CIRC, V24, P394
[9]  
HSIEH HC, 1990, P CUST INT CIRC C
[10]  
MARPLE D, 1992, P 1 INT ACM SIGDA WO, P39