Ensuring the complete testability of programmable logic matrices

MaRDI QIDQ1287574zbMATH OpenFDO

Authors E. I. Gol'dberg, Ya. A. Novikov

Publication date 24 May 1999

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

zbMATH Keywords

programmable logic matrixsystems of large integralschemes

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Complete checking of programmable logic arrays. II
• A design of programmable logic arrays with universal tests
• A testable design of programmable logic arrays with universal control and minimal overhead
• scientific article; zbMATH DE number 3943712
• Complete checking of programmable logic arrays. I

Cited in

(3)

• Complete checking of programmable logic arrays. I
• Compaction of test response at self-testing in the programmable logic matrices
• A matrix method for PLD failure localization

This page was built for publication: Ensuring the complete testability of programmable logic matrices

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