A Note on Easily Testable Realizations for Logic Functions

DOI10.1109/T-C.1974.223935MaRDI QIDQ4041456zbMATH OpenOpenAlexFDO

Authors K. I. Kodandapani

Publication date 1974

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

Full work available at URL https://doi.org/10.1109/t-c.1974.223935

Mathematics Subject Classification ID

Cited in

(3)

• Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
• Single fault detection test sets with respect to stuck-at faults at the outputs of gates in formulas over one basis of Zhegalkin type
• The length of a single fault detection test for constant-nonpreserving element insertions

This page was built for publication: A Note on Easily Testable Realizations for Logic Functions

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