Minimization of Reed–Muller Canonic Expansion
- 1 July 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-28 (7) , 535-537
- https://doi.org/10.1109/tc.1979.1675401
Abstract
It is shown that Swamy's [1] approach to generate generalized Reed–Muller canonic expansion is in error. A different algorithm is presented which uses a single Boolean matrix and successive modifications in function vector to generate all the solutions sequentially.Keywords
This publication has 4 references indexed in Scilit:
- Algorithm for Minimal Polarized Polynomial Form DeterminationIEEE Transactions on Computers, 1974
- On Generalized Reed-Muller ExpansionsIEEE Transactions on Computers, 1972
- Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, 1970
- State-Logic Relations for Autonomous Sequential NetworksIEEE Transactions on Electronic Computers, 1964