Testing of multi-output combinational circuits when reactions on test patterns are known | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2024. № 69. DOI: 10.17223/19988605/69/14

Testing of multi-output combinational circuits when reactions on test patterns are known

Deriving test sequences for multi-output combinational circuits is usually connected with applying test patterns on input circuit variables, so that the reaction on each test pattern differs at least by one output from correct one. Finding the suitable reactions on test input patterns may be used when deriving test sequences is oriented to cut power dissipation or to facilitate finding the circuit faults. The precise algorithm of deriving all input test patterns together with their reactions that differs fault and fault free circuits is suggested. It is based on applying operations on ROBDDs depending on only input circuit variables, only output circuit variables and both input and output circuit variables. Some possibilities of using input test patterns together with their reactions for debugging are discussed. Contribution of the authors: the authors contributed equally to this article. The authors declare no conflicts of interests.

Download file
Counter downloads: 4

Keywords

combinational circuits, test sequences, ROBDDs

Authors

NameOrganizationE-mail
Matrosova Anzhela Yu.Tomsk State Universitymau11@yandex.ru
Savenkova Marina M.Tomsk State Universitymarina1412_11@mail.ru
Provkin Viktor A.Tomsk State Universityprowkan@mail.ru
Sukhoruchenko Ksenia A.Tomsk State Universityksenia_s.a@bk.ru
Всего: 4

References

Провкин В.А., Матросова А.Ю. Графовые представления множеств всех достижимых реакций комбинационной схемы // Вестник Томского государственного университета. Управление, вычислительная техника и информатика. 2022. № 61. С. 128-138.
Провкин В.А. Построение множества всех достижимых реакций комбинационных схем // Математическое и программное обеспечение информационных, технических и экономических систем: материалы IX Междунар. науч. конф., Томск, 2628 мая 2022 г. Томск: Изд-во Том. ун-та, 2022. С. 99-108.
Bryant R.E. Graph-Based Algorithms for Boolean Function Manipulation // IEEE Transactions on Computers. 1986. V. C-35, is. 8. P. 677-691.
ISCAS'89 Benchmarks // Digital Design & Dependability Research Group. URL: https://ddd.fit.cvut.cz/www/prj/Benchmarks (accessed: 25.05.2024).
Simple Blifparser. URL: https://github.com/mario33881/blifparser (Дата обращения 25.05.2024).
DD package // Github.com. URL: https://github.com/tulip-control/dd (accessed: 25.05.2024).
The CUDD package, BDD, ADD Tutorial and examples // David Kebo Houngninou. URL: https://www.davidkebo.com/cudd#cudd1 (accessed: 25.05.2024).
SIS // Matteo Iervasi: embedded systems engineer. URL: https://jackhack96.github.io/logic-synthesis/sis.html#overview (accessed: 25.05.2024).
 Testing of multi-output combinational circuits when reactions on test patterns are known | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2024. № 69. DOI: 10.17223/19988605/69/14

Testing of multi-output combinational circuits when reactions on test patterns are known | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2024. № 69. DOI: 10.17223/19988605/69/14

Download full-text version
Counter downloads: 128