Design of universal test sequences for VLSI

DOI10.1109/TIT.1985.1057003MaRDI QIDQ3220498zbMATH OpenFDO

Authors Abraham Lempel, Martin Cohn

Publication date 1985

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Recommendations

• Vector sets for exhaustive testing of logic circuits
• Design of test sequences for VLSI self-testing using LFSR
• Publication:3770451
• A regular method for test sequence design. Correctness of the checking sequence
• Designing tests for automata networks from signal sequences. II. Networks without feedback

Cited in

(12)

• A design of programmable logic arrays with universal tests
• Test schedules for VLSI circuits having built-in test hardware
• scientific article; zbMATH DE number 4023204 (Why is no real title available?)
• scientific article; zbMATH DE number 4029454 (Why is no real title available?)
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• Design of test sequences for VLSI self-testing using LFSR
• Universal Address Sequence Generator for Memory Built-in Self-test*
• The pseudorandom sequence of arrays
• Exhaustive testing of almost all devices with outputs depending on limited number of inputs
• Vector sets for exhaustive testing of logic circuits
• An adaptive heuristic algorithm for VLSI test vectors selection
• A regular method for test sequence design. Correctness of the checking sequence

This page was built for publication: Design of universal test sequences for VLSI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220498)