Boolean matrix transforms between the parity spectrum and modulo-2 canonical expansions of a Boolean function are considered. Using a Kronecker matrix product approach, fast recursive algorithms derived for these and other transforms are applied to the minimisation of modulo-2 canonical expansions.
Published in:
Computers and Digital Techniques, IEE Proceedings E
(Volume:138
,
Issue:
6
)
Date of Publication: Nov 1991