Synthesis of test sequences with a given switching activity

DOI10.1134/S0005117922020114OpenAlexW4223597922MaRDI QIDQ2139488FDOQ2139488

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

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

zbMATH Keywords

test sequenceswitching activityself-testing of computing systems

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

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

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)