A Note on Easily Testable Realizations for Logic Functions

DOI10.1109/T-C.1974.223935zbMath0289.94020OpenAlexW2058987285MaRDI QIDQ4041456

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

Related Items

The length of a single fault detection test for constant-nonpreserving element insertions, Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions