Design for testability of gated-clock FSMs
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 589-596
- https://doi.org/10.1109/edtc.1996.494361
Abstract
Gated clocks allow significant power savings in synchronous systems, but are generally considered an unsafe design practice because they decrease testability. In this paper we present two methodologies that guarantee full single-stuck-at testability for gated-clock finite-state machines. The first technique, increased observability, can be used in conjunction with redundancy-removal techniques to obtain fully-testable gated clock FSMs with high performance. The second technique, increased observability and controllability, is applicable to large FSMs for which redundancy removal is not possible and produces fully-testable gated-clock FSMs with a moderate decrease in performance.Keywords
This publication has 14 references indexed in Scilit:
- Sequential circuit design using synthesis and optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A 3.3V 0.6 μm BiCMOS superscalar microprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Guarded evaluation: pushing power management to logic synthesis/designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
- Power conscious CAD tools and methodologies: a perspectiveProceedings of the IEEE, 1995
- A survey of optimization techniques targeting low power VLSI circuitsPublished by Association for Computing Machinery (ACM) ,1995
- Transformation and synthesis of FSMs for low-power gated-clock implementationPublished by Association for Computing Machinery (ACM) ,1995
- Precomputation-based sequential logic optimization for low powerIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994
- PowerPC 603 microprocessor power managementCommunications of the ACM, 1994
- Redundancy identification/removal and test generation for sequential circuits using implicit state enumerationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Exact algorithms for output encoding, state assignment, and four-level Boolean minimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991