A Minimum Test Set for Multiple Fault Detection in Ripple Carry Adders
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (7) , 891-895
- https://doi.org/10.1109/TC.1987.1676985
Abstract
Previous papers have shown that a ripple carry adder composed of several full adder cells can be completely tested by a minimum test set of size 8 independent of the number of cells in the ripple carry adder under single faulty cell assumption. The fault model assumed is that faults in a cell can change the cell behavior in any arbitrary way, as long as the cell remains a combinational circuit. In this paper, we assume that any number of cells can be faulty at any time. A minimum test set of size 11 which can detect arbitrary length ripple carry adders under this fault model is presented. For general (N, p) adders in which each cell is a p-bit adder, a minimum test set of size 3 × 22P − 1 is also presented.Keywords
This publication has 10 references indexed in Scilit:
- The Design of Easily Testable VLSI Array MultipliersIEEE Transactions on Computers, 1984
- Design of Testable Structures Defined by Simple LoopsIEEE Transactions on Computers, 1981
- A Testable Design of Iterative Logic ArraysIEEE Transactions on Computers, 1981
- A Functional Approach to Testing Bit-Sliced MicroprocessorsIEEE Transactions on Computers, 1981
- Diagnosis of Faults in Linear Tree NetworksIEEE Transactions on Computers, 1977
- Truth-Table Verification of an Iterative Logic ArrayIEEE Transactions on Computers, 1976
- Multiple Fault Detection in Arrays of Combinational CellsIEEE Transactions on Computers, 1975
- Easily Testable Iterative SystemsIEEE Transactions on Computers, 1973
- Fault Detection in Iterative Logic ArraysIEEE Transactions on Computers, 1971
- Testing for faults in combinational cellular logic arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967