Synthesis of test sequences with a given switching activity

DOI10.1134/S0005117922020114MaRDI QIDQ2139488zbMATH OpenOpenAlexFDO

Authors Vyacheslav Yarmolik, N. A. Shevchenko

Publication date 17 May 2022

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117922020114

zbMATH Keywords

test sequenceswitching activityself-testing of computing systems

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Synthesis of transformers of pseudorandom codes for testing digital schemes
• Test sequence construction using minimum information on the tested system
• Design of universal test sequences for VLSI
• Synthesis of pseudorandom test pattern generators
• Test generation of the digital circuits based on the genetic algorithms

Cites work

• scientific article; zbMATH DE number 3898955 (Why is no real title available?)
• scientific article; zbMATH DE number 1120796 (Why is no real title available?)
• A Survey of Combinatorial Gray Codes
• An Adjacent Switching Activity Metric under Functional Broadside Tests
• An economic method of computing LPτ-sequences
• Antirandom test vectors for BIST in hardware/software systems
• Controlled random tests
• Fast algorithms for genegrating integer partitions
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The repeated nondestructive march tests with variable address sequences

This page was built for publication: Synthesis of test sequences with a given switching activity

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