Algorithms for Synthesis of Polynomials Implementing Weakly Specified Boolean Functions and Systems

Authors:
A. D. Zakrevskii
Affiliations:
United Institute of Information Science Problems of Belarussian Academy of Sciences, Minsk, Belarus
Venue:
Automation and Remote Control
Year:
2004

Citing 2
Cited 0

Fast Algorithm for Minimizing Reed-Muller Expansions of Systems of Incompletely Slpecified MVL Functions

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weakly specified Boolean functions and systems are considered. A series of practically effective algorithms are proposed for their implementation by AND/EXOR circuits, which rely on the optimization of polynomial representations and the solutions of appropriate matrix logic equations. The obtained results are extended to multivalued logic.