Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
On fault detection in CMOS logic networks
DAC '83 Proceedings of the 20th Design Automation Conference
Test generation for MOS circuits using D-algorithm
DAC '83 Proceedings of the 20th Design Automation Conference
Automatic test generation for stuck-open faults in CMOS VLSI
DAC '81 Proceedings of the 18th Design Automation Conference
Multiple Stuck-Open Fault Detection in CMOS Logic Circuits
IEEE Transactions on Computers - Fault-Tolerant Computing
A new approach to derive robust sets for stuck-open faults in CMOS combinational logic circuits
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Journal of Electronic Testing: Theory and Applications
Transistor level test generation for MOS circuits
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
IEEE Transactions on Computers
A C-testable modified Booth's array multiplier
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
EURO-DAC '90 Proceedings of the conference on European design automation
ITC'84 Proceedings of the 1984 international test conference on The three faces of test: design, characterization, production
On CMOS totally self-checking circuits
ITC'84 Proceedings of the 1984 international test conference on The three faces of test: design, characterization, production
Hi-index | 0.00 |
A procedure to derive gate level equivalent circuits for CMOS combinational logic circuits is given. The procedure leads to a model containing AND, OR and NOT gates. Specifically it does not require memory elements as does an earlier model and also uses fewer gates. It is shown that tests for classical stuck-at-0 and stuck-at-1 faults in the equivalent circuit can be used to detect line stuck-at, stuck-open and stuck-on faults in the modeled CMOS circuit.