Abstract
This paper extends the design method of self-testing checkers (STCs) for some m-out-of-n (m/n) codes, proposed recently in IEEE Trans. Comput., 1995 by Dimakopoulos et al. The checkers are built using a pair of parallel counters (composed of full-adders and half-adders) with a total of n inputs and a 2-rail STC. We show here how to build this type of checkers for a number of m/n codes for which previous methods failed.
Similar content being viewed by others
References
W.C. Carter and P.R. Schneider, “Design of Dynamically Checked Computers,” Proc. IFIP Conf., Edinburgh, Scotland, Aug. 1968, pp. 878–883.
D.A. Anderson and G. Metze, “Design of Totally Self-Checking Check Circuits for m-out-of-n Codes,” IEEE Trans. Comput., Vol. C-22, pp. 263–269, March 1973.
S.J. Piestrak, “The Minimal Test Set for Sorting Networks and the Use of Sorting Networks in Self-Testing Checkers for Unordered Codes,” Dig. Pap. FTCS-20, Newcastle upon Tyne, UK, June 1990, pp. 457–464.
V.V. Dimakopoulos et al., “On TSC Checkers for m-out-of-n Codes,” IEEE Trans. Comput., Vol. 44, pp. 1055–1059, Aug. 1995.
C. Efstathiou and C. Halatsis, “Efficient Modular Design of m-out-of-2m TSC Checkers, form = 2K-1, K > 2,” Electron. Lett., Vol. 21, pp. 1082–1084, Nov. 1985.
A. Paschalis, “Efficient Structured Design of Totally Self-Checking M-out-of-N Code Checkers with N >2M and M = 2K–1,” Int. J. Electronics, Vol. 77, pp. 251–257, Aug. 1994.
A.M. Paschalis, D. Nikolos, and C. Halatsis, “Efficient Modular Design of TSC Checkers for m-out-of-n Codes,” IEEE Trans. Comput., Vol. C-37, pp. 301–309, March 1988.
S.J. Piestrak, “Design Method of Totally Self-Checking Checkers for m-out-of-n Codes,” Dig. Pap. FTCS-13, Milan, Italy, pp. 162–168, June 1983.
S.J. Piestrak, “Design of Fast Self-Testing Checkers for mout-of-2m and m-out-of-(2m ± 1) Codes,” Int. J. Electronics, Vol. 74, pp. 177–199, Feb. 1993.
S.J. Piestrak, “Design of Self-Testing Checkers for Unidirectional Error Detecting Codes,” Scientific Papers of Inst. of Techn. Cybern. of Techn. Univ. of Wroc•aw, No. 92, Ser.: Monographs No. 24, Oficyna Wyd. Polit. Wroc•, Wroc•aw, 1995, p. 112.
S.J. Piestrak, “Design of Minimal-Level PLA Self-Testing Checkers for m-out-of-n Codes,” IEEE Trans. Very large Scale Integration (VLSI) Systems, Vol. 4, pp. 264–272, June 1996.
V.V. Sapozhnikov and Vl.V. Sapozhnikov, “Universal Algorithm for Synthesizing Self-Checking Testers for Constant-Weight Codes,” Probl. Inf. Transm., Vol. 20, No. 2, pp. 128–137, 1984.
V.V. Sapozhnikov and Vl.V. Sapozhnikov, “Self-Checking Checkers for Balanced Codes,” Autom. Remote Control, Vol. 53, pp. 321–348, March 1992.
J.E. Smith, “The Design ofTotally Self-Checking Check Circuits for a Class of Unordered Codes,” J. Des. Autom. Fault-Tolerant Comput., Vol. 2, pp. 321–342, Oct. 1977.
S.J. Piestrak, “Self-Checking Design in Eastern Europe,” IEEE Design and Test of Computers, Special Issue on Design and Test in Eastern Europe, Vol. 13, pp. 16–25, Spring 1996.
M.A. Marouf and A.D. Friedman, “Design of Self-Checking Checkers for Berger Codes,” Dig. Pap. FTCS-8, Toulouse, France, June 1978, pp. 179–184.
A. Chatterjee and J.A. Abraham, “On the C-Testability of Generalized Counters,” IEEE Trans. Comp.-Aided Des., Vol. CAD-6, pp. 713–726, Sept. 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Piestrak, S.J. Design of Self-Testing Checkers for m-out-of-n Codes Using Parallel Counters. Journal of Electronic Testing 12, 63–68 (1998). https://doi.org/10.1023/A:1008273606127
Issue Date:
DOI: https://doi.org/10.1023/A:1008273606127