• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Formal Methods in Computer-Aided Design, 2009. FMCAD 2009 >Retiming and resynthesis with sweep are complete for sequential transformation
【24h】

Retiming and resynthesis with sweep are complete for sequential transformation

机译：完成扫描重定时和重新合成以进行顺序转换

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It has been shown that the sweep operation, which adds or removes registers not used by any output, is necessary for some sequential transformations. However, it is an open question whether retiming and resynthesis with sweep are complete. This paper proves that the operations are complete, but with one caveat: at least one resynthesis operation needs to look through the register boundary into the logic of previous cycle. We showed that this one-cycle reachability is required for retiming and resynthesis to be complete for re-encodings with different code length. This requirement comes from the fact that Boolean circuit is used for a discrete function thus its range needs to be computed by a traversal of the circuit. In theory, five operations in the order of sweep, resynthesis, retiming, resynthesis, and sweep are already complete. However, some practical limitations on resynthesis must be considered. The complexity of retiming and resynthesis verification is also discussed.
机译：关于所有顺序转换（在稳态下）重定时和重新合成的序列是否完整的研究和争论已有很长的历史。已经表明，对于某些顺序转换，需要进行增加或删除任何输出未使用的寄存器的清除操作。但是，是否有完整的重定时和扫频再合成是一个悬而未决的问题。本文证明了这些操作是完整的，但有一个警告：至少有一个重新合成操作需要通过寄存器边界来查看上一个周期的逻辑。我们证明了这种单周期可达性是重新计时和重新合成所必需的，以完成具有不同代码长度的重新编码。该要求来自以下事实：布尔电路用于离散函数，因此需要通过遍历电路来计算其范围。从理论上讲，按照扫频，重新合成，重定时，重新合成和扫频的顺序进行的五个操作已经完成。但是，必须考虑重新合成的一些实际限制。还讨论了重定时和重新合成验证的复杂性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号