Novel totally self-checking Berger code checker designs based on generalized Berger code partitioning
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (8) , 1020-1024
- https://doi.org/10.1109/12.238498
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The design of fast totally self-checking Berger code checkers based on Berger code partitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An SFS Berger check prediction ALU and its application to self-checking processor designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Efficient modular design of TSC checkers for m-out-of-2m codesIEEE Transactions on Computers, 1988
- Design of Fast Self-Testing Checkers for a Class of Berger CodesIEEE Transactions on Computers, 1987
- Design and Application of Self-Testing Comparators Implemented with MOS PLA'sIEEE Transactions on Computers, 1984
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- 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
- Optimal error detection codes for completely asymmetric binary channelsInformation and Control, 1962
- A note on error detection codes for asymmetric channelsInformation and Control, 1961