Sequential logic minimization based on functional testability
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 207-211
- https://doi.org/10.1109/edtc.1995.470391
Abstract
This paper presents a methodology for sequential logic minimization based on a functional testing approach. A new class of sequentially redundant faults, called functionally redundant, is defined. Such faults are determined by analyzing the functional description of a circuit; their identification and removal is the main topic of the paper. We show that by comparing the gate-level implementation of a circuit with its functional description, it is possible to produce fully testable circuits by spending a fraction of the time usually necessary for applying standard redundancies removal algorithms working at the gate level.<>Keywords
This publication has 7 references indexed in Scilit:
- Extracting local don't cares for network optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Observability relations and observability don't caresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implicit state enumeration of finite state machines using BDD'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Irredundant sequential machines via optimal logic synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- On the Acceleration of Test Generation AlgorithmsIEEE Transactions on Computers, 1983