By Topic

Tabular techniques for generating Kronecker 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
$33 $33
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)
A. E. A. Almaini ; Dept. of Electr., Electron. & Comput. Eng., Napier Univ., Edinburgh, UK ; L. McKenzie

Tabular techniques and algorithms for generating Kronecker expansions are presented. The Kronecker expansions, a subclass of mixed-polarity Reed-Muller expansions, can be generated from Boolean functions Kronecker expansions of different polarity. The techniques can be used for completely and incompletely specified Boolean functions. The algorithms were implemented in Pascal and fully tested. Examples are given to illustrate the procedures

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:143 ,  Issue: 4 )