PLA Implementation of k-out-of-n Code TSC Checker
- 1 June 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (6) , 583-588
- https://doi.org/10.1109/tc.1984.1676487
Abstract
PLA implementations of totally self-checking (TSC) checkers for k-out-of-n codes, where 2 ≤k ≤ n -2, are presented. For k-out-of-2k, k-out-of-2k + 1, k + 1-out-of-2k + 1, and k ± 1-out-of-2k codes, TSC checkers are designed using only one PLA. TSC checkers for all other codes are designed using 2 PLA's, and in fact the second PLA is very small for most of the codes.Keywords
This publication has 10 references indexed in Scilit:
- Comments on "Novel totally self-checking Berger checker designs based on generalized Berger code partitioningIEEE Transactions on Computers, 2002
- Fast and Efficient Totally Self-Checking Checkers for m-out-of-(2m ± 1) CodesIEEE Transactions on Computers, 1983
- A New Design Method for m-Out-of-n TSC CheckersIEEE Transactions on Computers, 1983
- Efficient Design of Self-Checking Checker for any m-Out-of-n CodeIEEE Transactions on Computers, 1978
- A Totally Self-Checking 1-Out-of-3 CheckerIEEE Transactions on Computers, 1978
- Note on Self-Checking CheckersIEEE Transactions on Computers, 1974
- Partially Self-Checking Circuits and Their Use in Performing Logical OperationsIEEE Transactions on Computers, 1974
- Complete Test Sets for Logic FunctionsIEEE Transactions on Computers, 1973
- Universal Test Sets for Logic NetworksIEEE Transactions on Computers, 1973
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973