scispace - formally typeset
Journal ArticleDOI

Circuits for pseudoexhaustive test pattern generation

Reads0
Chats0
TLDR
Implementation methods based on cyclic codes are presented for pseudoexhaustive testing of combinational logic networks with restricted output dependency, using a modified linear-feedback shift register to generate exhaustive test patterns for every output of the circuit.
Abstract
Implementation methods based on cyclic codes are presented for pseudoexhaustive testing of combinational logic networks with restricted output dependency. A modified linear-feedback shift register (LFSR) is used to generate exhaustive test patterns for every output of the circuit. All detectable, combinational faults (those that do not change a combinational circuit to a sequential circuit) in each cone of logic driving a single output are guaranteed to be detected. Examples indicate that LFSRs based on cyclic codes have lower hardware cost and shorter or comparable test lengths than other approaches. These test-pattern generators are well suited to applications where short testing time, low hardware overhead, and 100% single-stuck-at fault coverage are required. >

read more

Citations
More filters
Book

VLSI Test Principles and Architectures: Design for Testability (Systems on Silicon)

TL;DR: This book is a comprehensive guide to new DFT methods that will show the readers how to design a testable and quality product, drive down test cost, improve product quality and yield, and speed up time-to-market and time- to-volume.
Book

VLSI Test Principles and Architectures: Design for Testability

TL;DR: A comprehensive guide to new DFT methods that will show the readers how to design a testable and quality product, drive down test cost, improve product quality and yield, and speed up time to market and time-to-volume as mentioned in this paper.
Proceedings Article

Generation of Vector Patterns Through Reseeding of Multipe-Polynominal Linear Feedback Shift Registers

TL;DR: This paper proposes a new BIST scheme where the generator can operate according to a number of primitive polynomials and presents models of the encoding efficiency of this scheme and concludes that such a scheme with 16 polynmials approaches the efficiency of the scheme based on full poly- nomial programmability, essentially preserving theComputational simplicity of single reseeding.
Proceedings ArticleDOI

Bit-flipping BIST

TL;DR: A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead, and it is shown that the output of an LFSR which feeds a scan path has to be modified only at a few bits in order to transform the random patterns into a complete test set.
Book

Electronic Design Automation: Synthesis, Verification, and Test

TL;DR: EDA/VLSI practitioners and researchers in need of fluency in an "adjacent" field will find this an invaluable reference to the basic EDA concepts, principles, data structures, algorithms, and architectures for the design, verification, and test of VLSI circuits.
References
More filters
Journal ArticleDOI

Verification Testing—A Pseudoexhaustive Test Technique

TL;DR: A new approach to test pattern generation which is particularly suitable for self-test is described, which requires much less computation time and fault coverage is much higher—all irredundant multiple as well as single stuck faults are detected.
Journal ArticleDOI

Syndrome-Testable Design of Combinational Circuits

TL;DR: This paper focuses on classical testing of combinational circuits and the large storage requirement for a list of the fault-free response of the circuit to the test set.
Journal ArticleDOI

Random-pattern coverage enhancement and diagnosis for LSSD logic self-test

TL;DR: Embedded linear feedback shift registers can be used for logic component self-test and a procedure that supports net-level diagnosis for structured logic in the presence of random test-pattern generation and signature analysis is given.
Journal ArticleDOI

Pseudorandom Testing

TL;DR: Electrical circuits can be tested by applying pseudorandom patterns generated by a linear feedback shift register (LFSR) because no fault simulation is needed, and analysis of Pseudorandom testing requires the circuit detectability profile.
Journal ArticleDOI

Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing

TL;DR: A simple and efficient solution to this problem, derived from the connections between polynomials over finite fields and linear feedback shift registers, is presented and applications to the problem of VLSI self-testing are discussed and illustrated.
Related Papers (5)