Abstract
A technique for designing efficient checkers for conventional Berger code is proposed in this paper. The check bits are derived by partitioning the information bits into two blocks, and then using an addition array to sum the number of 1's in each block. The check bit generator circuit uses a specially designed 4-input 1's counter. Two other types of 1's counters having 2 and 3 inputs are also used to realize checkers for variable length information bits. Several variations of 2-bit adder circuits are used to add the number of 1's. The check bit generator circuit uses gates with fan-in of less than or equal to 4 to simplify implementation in CMOS. The technique achieves significant improvement in gate count as well as speed over existing approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.M. Berger, “A Note on Error Detecting Code for Asymmetric Channels,” Information and Control, Vol. 4, pp. 68–73, March 1961.
M.J. Ashjaee and S.M. Reddy, “Totally Self-Checking Checkers for a Class of Separable Codes,” in Proc. 12th Ann. Allerton Conf. Circuit Syst. Theory, Monticello, IL, Oct. 1974, pp. 238–242.
M.A. Marouf and A.D. Friedman, “Design of Fast Self-Checking Checkers for Berger Codes,” Proc. Int. Symp. Fault-Tolerant Computing, 1978, pp. 179–184.
S.J. Piestrak, “Design of Fast Self-Checking Checkers for a Class of Berger Codes,” IEEE Trans. on Comp., Vol. C-36, No. 5, pp. 629–634, May 1987.
S.J. Piestrak, “The Minimal Test Set for Sorting Networks and the Use of Sorting Networks in Self-Testing Checkers for Unordered Codes,” in Dig. Pap. 20th Int. Symp. on Fault-Tolerant Computing, Newcastle upon Tyne, UK, June 26–28, 1990, pp. 467–474.
T.R.N. Rao, G.L. Feng, M.S. Kolluru, and J.C. Lo, “Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning,” IEEE Trans. Comput., Vol. 42, No. 8, pp. 1020–1024, Aug., 1993.
J.C. Lo and S. Thanawastien, “The Design of Fast Totally Self-Checking Berger Code Checkers Based on Berger Code Partitioning,” in Proc. 18th Int. Symp. Falt-Tolerant Comput., June 1988, pp. 226–231.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pierce, D.A., Lala, P.K. Modular implementation of efficient self-checking checkers for the Berger code. J Electron Test 9, 279–294 (1996). https://doi.org/10.1007/BF00134692
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00134692