TABULAR TECHNIQUES FOR GENERATING KRONECKER EXPANSIONS

Authors
ALMAINI AEA MCKENZIE L
Citation
Aea. Almaini et L. Mckenzie, TABULAR TECHNIQUES FOR GENERATING KRONECKER EXPANSIONS, IEE proceedings. Computers and digital techniques, 143(4), 1996, pp. 205-212
Citations number
16
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
IEE proceedings. Computers and digital techniques → ACNP
ISSN journal
13502387
Volume
143
Issue
4
Year of publication
1996
Pages
205 - 212
Database
ISI
SICI code
1350-2387(1996)143:4<205:TTFGKE>2.0.ZU;2-Q
Abstract
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 or fro m Kronecker expansions of different polarity. The techniques can be us ed for completely and incompletely specified Boolean functions. The al gorithms were implemented in Pascal and fully tested. Examples are giv en to illustrate the procedures.