Arithmetic spectrum applied to fault detection for combinational networks

Heidtmann, Klaus D.

doi:10.1109/12.76409

Cited by 46 publications

(15 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in refs. [5,9] The testing scheme offered in this paper is an exhaustive testing scheme. Like other exhaustive testing schemes [7,9] the present scheme will work well for combinational network having n ≤ 25, where n is the total number of inputs of the network.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter

Bhattacharjee¹

2009

International Journal of Computer Mathematics

View full text Add to dashboard Cite

This paper reports on the development of a novel scheme as an alternative to Susskind's method [A.K. Susskind, Testing by verifying Walsh coefficients, Proceedings of the 11th Annual Symposium on fault-tolerant computing, June 1981, pp. 206-208.] for detection of struck-at faults in combinational logic circuits. The main idea in the present scheme is to extend an existing design of the combinational network under test in minterm format by some logic checking the correctness of all input-output mappings by computing only one novel parameter after cycling through all 2 n input combinations of a circuit with n inputs. Thus the present scheme uses 2 n n-bit input patterns once to a circuit while Susskind's method uses twice that many. So it provides substantially less work than that needed in Susskind's method. Furthermore, the tester needed to implement the present scheme is a simplified version of that needed in Susskind's method.

show abstract

Section: Resultsmentioning

confidence: 99%

“…To obviate the difficulties encountered in the classical schemes of testing digital network, several approaches [2,4,5,7,9] have been subsequently reported in the literature. The transition count testing [4] reduces the storage requirement to a considerable extent, but finding the proper test input sequence is difficult in this technique.…”

Section: Introductionmentioning

confidence: 99%

Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter

Bhattacharjee¹

2009

International Journal of Computer Mathematics

View full text Add to dashboard Cite

show abstract

“…Detailed relations between Arithmetic and Haar functions were given in [24]. Heidtman proposed an approach to derive the signatures for stuck-at faults in irredundant combinational networks by using Arithmetic coefficients of the Arithmetic polynomial expansion [2]. Rahardja and Falkowski [25] have shown that Arithmetic polynomial logic is advantageous over the standard zero polarity Arithmetic transform used by Heidtman in testing.…”

Section: Introductionmentioning

confidence: 99%

Matrix decomposition and butterfly diagrams for mutual relations between Hadamard-Haar and arithmetic spectra

Falkowski

Yan

2006

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

The mutual relationships between Hadamard-Haar and Arithmetic transforms and their corresponding spectra in the form of matrix decomposition as layered vertical and horizontal Kronecker matrices are discussed here together with their proofs, fast algorithms, and computational costs. The new relations apply to an arbitrary dimension of the transform matrices and allow performing direct conversions between Arithmetic and Hadamard-Haar functions and their corresponding spectra. In addition, analysis of butterfly diagrams for these new relations is also introduced and it is shown that they are more efficient than the matrix decomposition method.

show abstract

“…Two closely related transforms are frequently used in logic design and testing. They are the Reed-Muller transform based on the Galois Field [GF (2)] and the arithmetic transform performed in standard arithmetic [1]- [3], [7], [9], [16], [17], [19], [21]- [23], [26], [28], [39], [41], [42], [45]. The inverse of arithmetic transform when applied directly to the functional data is called an adding transform [10].…”

Section: Introductionmentioning

confidence: 99%

Family of Fast Linearly Independent Ternary Arithmetic Transforms

Falkowski

2004

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

In this paper, the family of fast linearly independent ternary arithmetic (LITA) transforms, which possesses fast forward and inverse butterfly diagrams, has been identified. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices. The LITA transforms, which require horizontal or vertical permutations to have fast transforms are also discussed. Computational costs of the calculation for presented transforms are also discussed and compared with multipolarity ternary arithmetic transform for ternary benchmark functions.

show abstract

Arithmetic spectrum applied to fault detection for combinational networks

Cited by 46 publications

References 16 publications

Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter

Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter

Matrix decomposition and butterfly diagrams for mutual relations between Hadamard-Haar and arithmetic spectra

Family of Fast Linearly Independent Ternary Arithmetic Transforms

Contact Info

Product

Resources

About