A New Design Method for m-Out-of-n TSC Checkers
- 1 March 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (3) , 273-283
- https://doi.org/10.1109/TC.1983.1676219
Abstract
The paper presents a new method for designing efficient TSC checkers for m-out-of n codes. The method is based on the partitioning of the input code variables into an arbitrary number of r classes. The paper establishes the necessary design conditions that must hold among m, n and r. The checker is basically composed of an m/n to l/z subchecker concatenated with an l/z to 1/2 subchecker. A cost analysis performed reveals that the most economical checkers are obtained for values of r equal to 3, or 4 for the majority of m/n codes with n ≤ 4m. Comparison with earlier designs reveals impressive improvement both in logic complexity and testing complexity.Keywords
This publication has 4 references indexed in Scilit:
- Efficient Design of Self-Checking Checker for any m-Out-of-n CodeIEEE Transactions on Computers, 1978
- Note on Self-Checking CheckersIEEE Transactions on Computers, 1974
- Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic FunctionsIEEE Transactions on Computers, 1974
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973