Minimally Testable Reed-Muller Canonical Forms

DOI10.1109/TC.1980.1675661MaRDI QIDQ3880754zbMATH OpenOpenAlexFDO

Authors Edward W. Page

Publication date 1980

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

Full work available at URL https://doi.org/10.1109/tc.1980.1675661

zbMATH Keywords

fault detectionlogic designeasily testable networksReed-Muller canonical expansionsswitching function realizations

Mathematics Subject Classification ID

Recommendations

• Families of Reed-Muller canonical forms
• Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
• Dual forms of Reed-Muller expansions
• Minimization of Exclusive or and Logical Equivalence Switching Circuits
• Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation

Cited in

(6)

• Synthesis of highly testable fixed-polarity AND-XOR canonical networks-A genetic algorithm-based approach
• Families of Reed-Muller canonical forms
• Using Reed-Muller codes in self-testing circuits
• Testing 2-asummability using a property of canonical extremal vertices
• Power estimation techniques for Reed-Muller logic circuits
• Dual forms of Reed-Muller expansions

This page was built for publication: Minimally Testable Reed-Muller Canonical Forms

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