Cart (Loading....) | Create Account
Close category search window
 

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

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:

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

Date of Publication:

Jul 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.