基于多项式符号运算的时钟周期确定新方法

A new clocking algorithm based on polynomial manipulations

采用多项式符号代数理论建立了包含时序元件的整个同步时序电路的统一多项式符号描述形式,并采用WGL(weighted general lists)模型进行多项式的符号运算.在时序电路统一多项式描述和及其WGL运算的基础上,通过对有限状态机的简化比较,提出一种完全考虑周期的时序特性的时钟周期确定算法.该方法打破了传统上认为时钟周期要不小于实际传输延迟的认识;通过对多种现有方法的实验比较,该方法可以在不增加计算复杂度的情况下比现有方法找到更精确的时钟周期;实验还表明电路正常工作的时钟周期可以在不使用流水的情况下比实际传输延迟小很多.

A new method is presented that breaks the traditional premise that cycle time should be no less than the actual delay of the circuit. A uniform polynomial representation of the whole sequential circuit adopting polynomial symbolic algebra was established, and the weighted general lists （WGL） model was used for polynomial operations. Then a new clocking algorithm considering the sequential nature of the cycle time was proposed, which is based on the uniform polynomial representation and WGL manipulations. Experimental results show that more-precise cycle times can be found by this method and that the normal cycle time may be much less than the actual delay without using pipelining.