Design of Testable Structures Defined by Simple Loops

DOI10.1109/TC.1981.1675718zbMATH Open0467.94029MaRDI QIDQ3921160FDOQ3921160

Authors: Jacob A. Abraham, Daniel Gajski 

Publication date: 1981

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

zbMATH Keywords

testingrecurrencesdesign automationself-checkingcellular tree structurescombinational structuresregister-transfer-level descriptions

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited In (2)

• Computations over finite monoids and their test complexity
• An easily testable optimal-time VLSI-multiplier

This page was built for publication: Design of Testable Structures Defined by Simple Loops

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