Latch redundancy removal without global reset

For circuits where there may be latches with no reset line, we show how to replace some of them with combinational logic. All previous work in sequential optimization by latch removal assumes a designated initial state. Without this assumption, the design can power up in any state and earlier techniques are not applicable. We present an algorithm for identifying and replacing redundant latches by combinational logic such that no environment of the design can detect the change. The new design preserves the steady state behavior as well as all initializing sequences of the old design. We report experimental results on benchmark circuits and demonstrate savings in area without adverse impact on delay.

[1]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[3]  Bill Lin.  Efficient symbolic support manipulation , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[4]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[5]  Robert K. Brayton,et al.  The Validity of Retiming Sequential Circuits , 1995, 32nd Design Automation Conference.

[6]  Robert K. Brayton,et al.  Exploiting power-up delay for sequential optimization , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[7]  Robert K. Brayton,et al.  Multi-level synthesis for safe replaceability , 1994, ICCAD '94.

[8]  David E. Long,et al.  Identifying sequential redundancies without search , 1996, DAC '96.

[9]  Janusz Rajski,et al.  On Test Set Preservation of Retimed Circuits , 1995, 32nd Design Automation Conference.

[10]  Fabio Somenzi,et al.  Redundancy identification and removal based on implicit state enumeration , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[11]  A. Richard Newton,et al.  Don't care minimization of multi-level sequential logic networks , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[12]  Olivier Coudert,et al.  New ideas on symbolic manipulations of finite state machines , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[13]  R. Brayton,et al.  Efficient Formal Design Verification : Data Structure + Algorithms , 1994 .

[14]  Robert K. Brayton,et al.  Heuristic Minimization of BDDs Using Don't Cares , 1994, 31st Design Automation Conference.

[15]  A. Richard Newton,et al.  Exact Redundant State Registers Removal Based on Binary Decision Diagrams , 1991, VLSI.

[16]  Robert K. Brayton,et al.  Observability relations and observability don't cares , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[17]  G. Erard Berry.  Optimized Controller Synthesis Using Esterel , 1993 .

[18]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.