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

DOI10.1109/TC.1983.1676202MaRDI QIDQ3659697zbMATH OpenOpenAlexFDO

Authors Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676202

zbMATH Keywords

primitive polynomialslinear feedback shift registersVLSI self-testing

Mathematics Subject Classification ID

Circuits, networks (94C99)

Cited in

(8)

• Partitioning circuits for improved testability
• Fault masking probabilities with single and multiple signature analysis
• Generating a PRSA with triangular symmetry
• The pseudorandom sequence of arrays
• Efficient VLSI fault simulation
• A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
• The use of linear sums in exhaustive testing
• Graph partitioning applied to the logic testing of combinational circuits

This page was built for publication: Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing

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