
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.J. Piestrak, "Design Method of a Class of Embedded Combinational SelfTesting Checkers for TwoRail Codes," IEEE Transactions on Computers, vol. 51, no. 2, pp. 229234, February, 2002.  
BibTex  x  
@article{ 10.1109/12.980010, author = {S.J. Piestrak}, title = {Design Method of a Class of Embedded Combinational SelfTesting Checkers for TwoRail Codes}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {2}, issn = {00189340}, year = {2002}, pages = {229234}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.980010}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Design Method of a Class of Embedded Combinational SelfTesting Checkers for TwoRail Codes IS  2 SN  00189340 SP229 EP234 EPD  229234 A1  S.J. Piestrak, PY  2002 KW  Berger code KW  concurrent error detection KW  embedded circuit KW  inverterfree circuit KW  selftesting checker KW  totally selftesting circuit KW  tworail code. VL  51 JA  IEEE Transactions on Computers ER   
This paper tackles the open problem of designing combinational selftesting checkers (STCs) for Kpair 2rail codes which are selftesting, even by a subset of codewords, such that some input lines are 0 (or 1) for only one input codeword. The checker presented here has both theoretical and practical importance. It is useful, e.g., to build STCs for other systematic error detecting codes like Berger codes with I=2^{k1} data bits and arithmetic codes with the check base A=2^{k1}+1, K=3, 4, 5,....It also allows the designers to build functional totally selfchecking circuits with 100 percent fault coverage in which such 2rail codes could not have been used otherwise.
[1] W.C. Carter and P.R. Schneider, “Design of Dynamically Checked Computers,” Proc. IFIP Conf., pp. 878883, Aug. 1968.
[2] D.A. Anderson and G. Metze, “Design of Totally SelfChecking Check Circuits formOutofnCodes,” IEEE Trans. Computers, vol. 22, no. 3, pp. 263269, Mar. 1973.
[3] M.J. Ashjaee and S.M. Reddy, “On Totally SelfChecking Checkers for Separable Codes,” IEEE Trans. Computers, vol. 26, no. 8, pp. 737744, Aug. 1977.
[4] J.F. Wakerly, Error Detecting Codes, SelfChecking Circuits and Applications. New York: NorthHolland, 1978.
[5] S.J. Piestrak, “SelfTesting Checkers for All Arithmetic Codes with Any Check Base$A$,” Proc. '91 PRFTS—The 1991 Pacific Rim Int'l Symp. FaultTolerant Systems, pp. 162167, Sept. 1991.
[6] M.A. Marouf and A.D. Friedman, “Design of SelfChecking Checkers for Berger Codes,” Digest Papers Eighth Int'l FaultTolerant Computing Symp., pp. 179184, June 1978.
[7] S.J. Piestrak, “Design of Fast SelfTesting Checkers for Berger Codes,” IEEE Trans. Computers, vol. 36, no. 5, pp. 629634, May 1987.
[8] S.J. Piestrak,"The Minimal Test Set for Sorting Networks and the Use of Sorting Networks in SelfTesting Checkers for Unordered Codes," Digest of Papers 20th Int'l FTC Symp., Newcastle upon Tyne, U.K. pp. 457464, June 1990.
[9] S.J. Piestrak, Design of SelfTesting Checkers for Unidirectional Error Detecting Codes, Scientific Papers of the Inst. of Technological Cybernetics of the Technnical Univ. of Wroclaw, no. 92, Ser.: Monographs no. 24, Oficyna Wyd. Polit. Wrocl. 1995.
[10] S.J. Piestrak, “Design of Encoders and SelfTesting Checkers for Some Systematic Unidirectional Error Detecting Codes,” J. Microelectronic Systems Integration, vol. 5, no. 4, pp. 247260, 1997.
[11] S.J. Piestrak, “Design of TSC CodeCisjoint InverterFree PLAs for Separable Unordered Codes,” Proc. Int'l Conf. Computer Design (ICCD '94), pp. 128131, Oct. 1994.
[12] J. Khakbaz and E.J. McCluskey, “SelfTesting Embedded Parity Checkers,” IEEE Trans. Computers, vol. 33, no. 8, pp. 753756, Aug. 1984.
[13] D. Nikolos, “SelfTesting Embedded TwoRail Checkers,” J. Electronic Testing: Theory and Applications, vol. 12, no. 1, pp. 6979, 1998.
[14] F. Özgüner, “Design of Totally SelfChecking Embedded TwoRail Code Checkers,” Electronics Letters, vol. 27, pp. 382384, Feb. 1991.
[15] E. Fujiwara and K. Matsuoka, "A SelfChecking Generalized Prediction Checkers and Its Use for BuiltIn Testing," IEEE Trans. Computers, vol. 36, no. 1, pp. 8693, Jan. 1987.
[16] T.R.N. Rao, G.L. Feng, M.S. Kolluru, and J.C. Lo, “Novel Totally SelfChecking Berger Checker Designs Based on Generalized Berger Code Partitioning,” IEEE Trans. Computers, vol. 42, no. 8, pp. 10201024, Aug. 1993; see also Correction in IEEE Trans. Computers, vol. 43, no. 5, p. 640, May 1994.
[17] S.J. Piestrak, “Comments on 'Novel Totally SelfChecking Berger Checker Designs Based on Generalized Berger Code Partitioning',” IEEE Trans. Computers, to appear.
[18] J.E. Smith, “The Design of Totally SelfChecking Check Circuits for a Class of Unordered Codes,” J. Design Automation FaultTolerant Computers, vol. 2, pp. 321342, Oct. 1977.
[19] M. Diaz et al., “Unified Design of SelfChecking and FailSafe Combinational Circuits and Sequential Machines,” IEEE Trans. Computers, vol. 28, no. 3, pp. 276281, Mar. 1979.
[20] S.J. Piestrak, “PLA Implementation of Totally SelfChecking Circuits UsingmOutofnCodes,” Proc. Int'l Conf. Computer Design (ICCD '85) pp. 777781, Oct. 1985.
[21] S.J. Piestrak, “Design of HighSpeed and CostEffective SelfTesting Checkers for LowCost Arithmetic Codes,” IEEE Trans. Computers, vol. 39, no. 3, pp. 360374, Mar. 1990.
[22] S.J. Piestrak, “General Design Principles of SelfTesting CodeDisjoint PLAs,” Proc. ATS '93—Second Asian Test Symp., pp. 287292, Nov. 1993.
[23] S.J. Piestrak, “Design Method of SelfTesting Checkers for 1OutofnCodes,” Proc. FTSD 6—Sixth Int' Conf. FaultTolerant Systems and Diagnostics, pp. 5763, Sept. 1983.