By Topic

Boolean matrix transforms for the parity spectrum and minimisation of modulo-2 canonical expansions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lui, P.K. ; VLSI Design & Test Group, Victoria Univ., BC, Canada ; Muzio, J.C.

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 )