【24h】

Constrained clock shifting for field programmable gate arrays

机译:现场可编程门阵列的受限时钟移位

获取原文
获取原文并翻译 | 示例

摘要

Circuits implemented in FPGAs have delays that are dominated by its programmable interconnect. This interconnect provides the ability to implement arbitrary connections. However, it contains both highly capacitive and resistive elements. The delay encountered by any connection depends strongly on the number of interconnect elements used to route the connection. These delays are only completely known after the place and route phase of the CAD flow. We propose the use of Clock Shifting optimization techniques to improve the clock frequency as a post place and route step.Clock Shifting Optimization is a technique first formalized in [4]. It is a cycle-stealing algorithm that allows one to reduce the critical path delay of a synchronous circuit by shifting the clock signals at each register. This technique allows late arriving signals to be sampled at a later point in time by intentionally introducing a skew on the clock input of the sampling register. Typical FPGAs contain a number of specialpurpose global clock networks that distribute clock signals to every register in the chip. Unused global clock lines in FPGAs can be used to distribute a finite set of clock skews to the entire circuit. We propose an efficient integer programming method to find the optimal circuit improvement for a finite set of clock skews. This technique is modified to consider inherent uncertainties present in the timing models. The uncertainty controls the aggressiveness of the optimizations as we must take great care in ensuring functionality for any range of possible timing characteristics.Our results confirm intuition that more aggressive speed optimizations can be performed as timing models become more accurate. We also show that providing 4 skewed versions of the nominal clock signal results in the best delay--area tradeoff. This result is evocative as it may suggest future FPGA architectures that contain greater numbers of global clock lines, as we tradeoff gains in speed for greater power requirements from increased clock network flexibility.
机译:用FPGA实现的电路的延迟主要由其可编程互连决定。该互连提供了实现任意连接的能力。但是,它同时包含高电容性和电阻性元件。任何连接遇到的延迟在很大程度上取决于用于路由连接的互连元素的数量。仅在CAD流程的布局和布线阶段之后才完全知道这些延迟。我们建议使用时钟移位优化技术来提高时钟频率,作为后期布局和路由步骤。时钟移位优化是最早在[4]中正式化的技术。这是一种周期窃取算法,该算法允许通过移位每个寄存器的时钟信号来减少同步电路的关键路径延迟。通过有意在采样寄存器的时钟输入上引入偏斜,该技术允许在较晚的时间点对延迟到达的信号进行采样。典型的FPGA包含许多专用的全局时钟网络,这些时钟网络将时钟信号分配到芯片中的每个寄存器。 FPGA中未使用的全局时钟线可用于将有限的一组时钟偏斜分布到整个电路。我们提出了一种有效的整数编程方法,以针对有限的一组时钟偏斜找到最佳的电路改进。修改此技术以考虑时序模型中存在的固有不确定性。不确定性控制着优化的积极性,因为我们必须非常注意确保任何可能的时序特征都具有功能性。我们的结果证实了直觉,即随着时序模型变得更加准确,可以执行更积极的速度优化。我们还表明,提供4个偏斜版本的标称时钟信号会导致最佳的延迟-面积折衷。该结果令人回味无穷,因为它暗示了未来的FPGA架构将包含更多的全局时钟线,因为我们需要权衡速度的提高,以提高时钟网络的灵活性来满足更高的功耗要求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号