Design of Fast Self-Testing Checkers for a Class of Berger Codes

S.J. Piestrak

doi:10.1109/TC.1987.1676949

Publication
1987
Issue No. 5 - May
Abstract - Design of Fast Self-Testing Checkers for a Class of Berger Codes

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by S.J. Piestrak

Design of Fast Self-Testing Checkers for a Class of Berger Codes

May 1987 (vol. 36 no. 5)

pp. 629-634

	ASCII Text	x
	S.J. Piestrak, "Design of Fast Self-Testing Checkers for a Class of Berger Codes," IEEE Transactions on Computers, vol. 36, no. 5, pp. 629-634, May, 1987.

	BibTex	x
	@article{ 10.1109/TC.1987.1676949, author = {S.J. Piestrak}, title = {Design of Fast Self-Testing Checkers for a Class of Berger Codes}, journal ={IEEE Transactions on Computers}, volume = {36}, number = {5}, issn = {0018-9340}, year = {1987}, pages = {629-634}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676949}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - Design of Fast Self-Testing Checkers for a Class of Berger Codes IS - 5 SN - 0018-9340 SP629 EP634 EPD - 629-634 A1 - S.J. Piestrak, PY - 1987 KW - unordered codes KW - Berger code KW - concurrent error detection KW - fault detection KW - m-out-of-n code checkers KW - self-checking circuits KW - self-testing checkers KW - unidirectional errors VL - 36 JA - IEEE Transactions on Computers ER -

S.J. Piestrak, Department of Computer Science, University of Georgia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676949

The Berger codes are optimal separable codes that detect all undirectional errors. In this correspondence a new procedure of designing self-testing checkers (STC's) for codes with I information bits, where I = {2^K-2, 2^K-l} and I = 3, is proposed. I = 3. The new checker is basically composed of u = ?(I + 1)/2? STC's for m-out-of-n codes with n = I + 1 and m = 2p + 1, O = p = u

Index Terms:

unordered codes, Berger code, concurrent error detection, fault detection, m-out-of-n code checkers, self-checking circuits, self-testing checkers, unidirectional errors

Citation:

S.J. Piestrak, "Design of Fast Self-Testing Checkers for a Class of Berger Codes," IEEE Transactions on Computers, vol. 36, no. 5, pp. 629-634, May 1987, doi:10.1109/TC.1987.1676949

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.