郝亚男, 杨海钢. 基于冗余寄存器分类的时序网络面积优化算法[J]. 微电子学与计算机, 2012, 29(7): 35-41.
引用本文: 郝亚男, 杨海钢. 基于冗余寄存器分类的时序网络面积优化算法[J]. 微电子学与计算机, 2012, 29(7): 35-41.
HAO Ya-nan, YANG Hai-gang. Area Optimization Algorithm in Sequential Logic Based on Classification of Redundant Registers[J]. Microelectronics & Computer, 2012, 29(7): 35-41.
Citation: HAO Ya-nan, YANG Hai-gang. Area Optimization Algorithm in Sequential Logic Based on Classification of Redundant Registers[J]. Microelectronics & Computer, 2012, 29(7): 35-41.

基于冗余寄存器分类的时序网络面积优化算法

Area Optimization Algorithm in Sequential Logic Based on Classification of Redundant Registers

  • 摘要: 本文根据时序网络中存在冗余的特点,提出将冗余寄存器分为三类:在所有可达状态空间输出端逻辑值恒为常数的寄存器、输入端相同的寄存器和对原始输出端逻辑值无影响的寄存器;并提出了一种基于AIGs (And-In-verter Graphs)的移除冗余寄存器的面积优化算法.将三值模拟、寄存器共享和COI (Cone of Influence)化简三种方法结合实现冗余寄存器的消除,达到减少寄存器数和节点数,优化时序网络面积的目的.实验结果表明,本算法可以使寄存器规模平均下降23%,节点数平均减少26%.

     

    Abstract: This paper presents a classification of the redundant registers, and provides three kinds of redundancy removal sequential optimization techniques according the characteristic of each kind of redundant registers.We classify these redundant registers into three categories: the first one is the constant register whose output value in all the reachable state space is always constant value, and the second one is those registers have the same inputs, and the third one is those registers have no influence for all the Primary Output value in the circuit.Based on AIGs (And-Inverter Graphs), Three-Valued simulation, sharing registers and COI reduction are combined together to realize the removal of the three kinds of redundant registers.It can reduce the numbers of the registers and logic gates to optimize the area of the sequential network.Experiments show that the presented algorithm can get an average reduction of registers by 23% and logic gates by 26% respectively.

     

/

返回文章
返回