Comments on "Novel totally self-checking Berger checker designs based on generalized Berger code partitioning
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 51 (6) , 735-736
- https://doi.org/10.1109/tc.2002.1009156
Abstract
For original paper see ibid., vol.42, no.8, p.1020-4 (1994). T.R.N. Rao et al. (1994) proposed a totally self-checking (TSC) 2-output checker for Berger codes with I=2/sup r-1/ information bits. The article shows that their checker may not be self-testing, as claimed. Hence, the circuit proposed by S.J. Piestrak (2002) is the first correct solution of this design problem.Keywords
This publication has 3 references indexed in Scilit:
- Design method of a class of embedded combinational self-testing checkers for two-rail codesIEEE Transactions on Computers, 2002
- Novel totally self-checking Berger code checker designs based on generalized Berger code partitioningIEEE Transactions on Computers, 1993
- Efficient modular design of TSC checkers for m-out-of-2m codesIEEE Transactions on Computers, 1988