Boolean Functıons Sımplıfıcatıon Algorıthm of O(N) Complexıty
Yükleniyor...
Dosyalar
Tarih
2003
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system. All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O(2n) complexity. Prime Implicants identification step can be computational impractical as n increases. Thus it is possible to get method in order to find the minimal set of Prime Implicants of O(n) complexity instead of O(2n).
Açıklama
Anahtar Kelimeler
Matematik, Boolean function, Simplification, Minimization, Boolean expression, Prime implicant, Cube algebra, Covering algorithm, Simplification complexity, Cube operations
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
Cilt
8
Sayı
01.Mar
Künye
Kahramanlı, Ş., Başçiftçi, F., (2003). Boolean Functıons Sımplıfıcatıon Algorıthm of O(N) Complexıty. Mathematical and Computational Applications, (8), 271-278.
