Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions (Q3479986): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5681926 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Easily Testable Realizations for Logic Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimization of Exclusive or and Logical Equivalence Switching Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Easily Testable Realizations ror Logic Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimization of Reed–Muller Canonic Expansion / rank | |||
Normal rank | |||
Latest revision as of 16:48, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions |
scientific article |
Statements
Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions (English)
0 references
1990
0 references
minterms of a switching function
0 references
Reed-Muller polynomial
0 references
conversion procedure
0 references
boolean matrix representation
0 references
minimal Exclusive-OR realization
0 references
fixed polarity
0 references
