Previous | [1] | [2] | [3] | [4] | [5] | [6] | [7] | [8] | [9] | [10] |

TSC Berger-Code Checker Design for 2

**Wen-Feng Chang and Cheng-Wen Wu ^{*}**

National Tsing Hua University

Hsinchu, Taiwan 300, R.O.C.

Berger code (BC) is an optimal separable code which can detect all single stuck-at and unidirectional faults. The traditional BC checker is not totally self-checking (TSC) when *k* = 2^{r-1}, where *k* is the number of information bits in a code word, and *r* is the number of check bits. The case in which *k* = 2^{r-1}, however, is important and practical since information words in most digital systems are in the form of a power of 2. This problem was solved recently by Rao *et al.*, who proposed a TSC BC checker based on the concept of a generalized BC partition technique. We extend their work and propose two TSC BC checkers for *k* = 2^{r-1} by modifying the conventional BC checker. The first design adds to it a pair of 1/2-code inputs and a two-rail-code checker. The second method includes a periodic input and produces a periodic output. Compared with the results of Rao *et al.*, our checkers require less hardare overhead and check time.

Keywords: Berger code, concurrent error detection, on-line testing, totally-self-checking checker, two-rail code.

Retrieve PDF document (**199905_08.pdf** : 95,298 bytes)

Received October 7, 1997; received April 21, 1998; accepted June 8, 1998.

Communicated by Chi Sung Laih.