Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
DOI10.1080/00207219008921194zbMATH Open0701.94023OpenAlexW1971536856MaRDI QIDQ3479986FDOQ3479986
Authors: Maki K. Habib
Publication date: 1990
Published in: International Journal of Electronics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207219008921194
Recommendations
- New approach for the generation of minimal Reed-Muller Exclusive-OR expansions with mixed polarity
- Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa
- Minimization of Exclusive or and Logical Equivalence Switching Circuits
- Minimisation of fixed-polarity AND/XOR canonical networks
- Publication:4953945
Reed-Muller polynomialfixed polarityboolean matrix representationconversion procedureminimal Exclusive-OR realizationminterms of a switching function
Cites Work
Cited In (15)
- Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation
- Minimisation of fixed-polarity AND/XOR canonical networks
- Boolean functions: degree and support
- Families of Reed-Muller canonical forms
- Minimization of Exclusive or and Logical Equivalence Switching Circuits
- New approach for the generation of minimal Reed-Muller Exclusive-OR expansions with mixed polarity
- Transformation between OC expansion coefficients map and \(b_j\) map of logical function based on the exclusive-OR operation
- Title not available (Why is that?)
- Minimally Testable Reed-Muller Canonical Forms
- Quaternary fixed-polarity Reed--Muller expansion computation through operations on disjoint cubes and its comparison with other methods
- Dual forms of Reed-Muller expansions
- Fast OFDD-based minimization of fixed polarity Reed-Muller expressions
- Transformation between the RM expansion and CRM expansion of logical functions
- Ternary Reed-Muller switching functions with fixed and mixed polarities
- Title not available (Why is that?)
This page was built for publication: Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479986)