Conversion between Logic and Algebraic Expressions of Boolean Control Networks

The conversion between logic and algebraic expressions of Boolean control networks plays a worthy role in the analysis and design of digital circuits. In this paper, for a single Boolean function, a direct conversion between the minterm canonical form and the structure matrix is provided. For a Bool...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied sciences Ročník 10; číslo 20; s. 7180
Hlavní autori: Wang, Cailu, Tao, Yuegang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 15.10.2020
Predmet:
Algebra
Algebra, Boolean
algebraic expression
Algorithms
Analysis
Boolean
Boolean control network (BCN)
canonical form
Circuits
computational complexity
conversion algorithm
Logic
logic expression
Variables
China
ISSN:2076-3417, 2076-3417
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The conversion between logic and algebraic expressions of Boolean control networks plays a worthy role in the analysis and design of digital circuits. In this paper, for a single Boolean function, a direct conversion between the minterm canonical form and the structure matrix is provided. For a Boolean control network consisting of systems of Boolean functions, two algorithms are developed to achieve the mutual conversion between the logic and algebraic expressions. The presented algorithms decrease exponentially the complexity of the semi-tensor product based method. Some numerical examples are given to demonstrate the algorithms and to compare our method with the existing ones.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app10207180