Обеспечение тестируемости задержек путей при синтезе схем покрытием BDD-графов
Матросова Анжела Юрьевна, Кудин Дмитрий Владимирович, Николаева Екатерина Александровна et al. · Вестник Томского государственного университета. Управление, вычислительная техника и информатика · 2013
Circuits obtained by covering ROBDD and Free BDD nodes with special gate subcircuits are considered. Formulae derived from their structural descriptions are investigated. Based on the results of investigations algorithms of deriving test pairs for robust testable PDFs and validatable non robust testable PDFs of such circuits are developed. It is found out that delay of each circuit path is detectable. Possibilities of cutting calculations under finding the longest circuit paths and compact description of the longest paths are discussed.
Cited by 0 works.