Sciweavers

624 search results - page 11 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
CC
2007
Springer
158views System Software» more  CC 2007»
14 years 9 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
VTS
1997
IEEE
133views Hardware» more  VTS 1997»
15 years 1 months ago
ATPG for scan chain latches and flip-flops
A new approach for testing the bistable elements (latches and flip-flops) in scan chain circuits is presented. In this approach, we generate test patterns that apply a checking ex...
Samy Makar, Edward J. McCluskey
DATE
2000
IEEE
86views Hardware» more  DATE 2000»
15 years 1 months ago
Analysis and Minimization of Test Time in a Combined BIST and External Test Approach
In this paper, an analysis of test time by CBET (which is an acronym for Combination of BIST and External Test) test approach is presented. The analysis validates that CBET test a...
Makoto Sugihara, Hiroto Yasuura, Hiroshi Date
DAC
2001
ACM
15 years 10 months ago
An Algorithm for Bi-Decomposition of Logic Functions
We propose a new BDD-based method for decomposition of multi-output incompletely specified logic functions into netlists of two-input logic gates. The algorithm uses the internal ...
Alan Mishchenko, Bernd Steinbach, Marek A. Perkows...
ENGL
2007
180views more  ENGL 2007»
14 years 9 months ago
Reordering Algorithm for Minimizing Test Power in VLSI Circuits
— Power consumption has become a crucial concern in Built In Self Test (BIST) due to the switching activity in the circuit under test(CUT). In this paper we present a novel metho...
K. Paramasivam, K. Gunavathi