Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Deterministic testing"'
Autor:
Roei Tell
Publikováno v:
computational complexity. 28:259-343
This work studies the question of quantified derandomization, which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified derandomization problem is the following: For a circuit class $${\mathcal{C}}$$ and a parameter B=B(n),
Autor:
Wu-Tung Cheng, Sudhakar M. Reddy, Fong-Jyun Tsai, Kuen-Jong Lee, Yu Huang, Mark Kassab, Chong-Siao Ye, Janusz Rajski
Publikováno v:
ETS
A novel method to efficiently and accurately prognosticate the pattern count at different input compression ratios with the Embedded Deterministic Test (EDT) compression technology is proposed. With this method the total ATPG run time can be signific
Autor:
Tsutomu Inamoto, Yoshinobu Higami
Publikováno v:
2019 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC).
This study displays preliminary results on a simple technique to improve fault coverages in the BIST technology. The technique assumes that a circuit which implements an ANN can be used with the target circuit, and effective test patterns are given b
Autor:
Tománek, Jakub
This study explores the possibilities for reducing the number of pins needed for scan mode interface. In the first part of this paper the existing solutions and methods that are usable for this purpose are described. Specific four pin, three pin, two
Externí odkaz:
http://www.nusl.cz/ntk/nusl-320175
Publikováno v:
International Journal of Digital Content Technology and its Applications. 4:88-96
As the number of specified bits of different test patterns varies widely in a deterministic test cube, all test patterns are concatenated to a data flow. The original test data can be re-divided by 2 to the power of integer according to the successfu
Publikováno v:
Journal of Electronic Testing. 26:443-451
In this work, a new method to design a mixed-mode Test Pattern Generator (TPG) based only on a simple and single Linear Feedback Shift Register (LFSR) is described. Such an LFSR is synthesized by Berlekamp---Massey algorithm (BMA) and is capable of g
Autor:
Irith Pomeranz, Sudhakar M. Reddy
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 17:45-54
Test generation procedures attempt to assign values to the inputs of a circuit so as to detect target faults. We investigate a complementary view whereby the goal is to avoid the assignment of certain input values in order not to prevent faults from
Autor:
Dongsup Song, Sungho Kang
Publikováno v:
IEICE Transactions on Information and Systems. :354-357
In this paper, we propose a new clustered reconfigurable interconnect network (CRIN) BIST that can improve the embedding probabilities of random-pattern-resistant-patterns. A simulated annealing based algorithm that maximizes the embedding probabilit
Autor:
Nur A. Touba, K.J. Balakrishnan
Publikováno v:
Journal of Systems Architecture. 50:247-256
This paper describes a new compression/decompression methodology for using an embedded processor to test the other components of a system-on-a-chip (SoC). The deterministic test vectors for each core are compressed using matrix-based operations that