Abstract | ||
---|---|---|
Signature analysis has been used widely for fault detection as a part of Built-In Self Test (BIST). In this paper we show how signature analysis can be used not only for fault detection but also for identification of multiple errors produced by faults in the circuits under test. We construct Signature Analysis Registers (SARs) to detect and identify any specified number of errors in the input polynomials by choosing proper characteristic polynomials, To detect and identify r errors in an input bit stream of m bits, we use a polynomial g(r)(x) = 1cm (f(1)(x), f(3)(x),...,f(2r-1)(x)) as the characteristic polynomial for the SAR for any polynomial f(1)(x), where 1cm represents the least common multiple of polynomials f(i)(x) = Res(t)(f(1)(t), x-t(i)), i = 3,...,2r-1 Res(t) denotes the t-Resultant, and m is less than the order of f(1)(x). Given a faulty signature produced by an SAR constructed as described, we present an algorithm for the identification of the actual error bits in the input polynomial to the SAR. We also extend the use of BCH codes for error detection and correction to include nonprimitive polynomials. |
Year | DOI | Venue |
---|---|---|
1995 | 10.1007/BF00995313 | J. Electronic Testing |
Keywords | Field | DocType |
characteristic polynomial,error correction code,fault detection | Characteristic polynomial,Polynomial,Fault detection and isolation,Computer science,Least common multiple,Algorithm,Error detection and correction,Self test,Bitstream,Circuit under test | Journal |
Volume | Issue | ISSN |
7 | 3 | 0923-8174 |
Citations | PageRank | References |
32 | 2.17 | 11 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
T. Raju Damarla | 1 | 36 | 2.93 |
Charles E. Stroud | 2 | 470 | 41.17 |
Avinash Sathaye | 3 | 34 | 3.73 |