DocumentCode :
562541
Title :
Integers sorting method for boolean functions minimization
Author :
Minzyuk, Vadym
Author_Institution :
Lviv Politechnic Nat. Univ., Lviv, Ukraine
fYear :
2012
fDate :
21-24 Feb. 2012
Firstpage :
61
Lastpage :
61
Abstract :
In this paper modification of the most significant digit binary-radix sort has been considered. The method is supplemented by procedure of cardinality counting for subsets, which are derived on steps of sorting. This procedure helps to detect such sets which can be represented by conjuncterms with absorbed low-order bits.
Keywords :
Boolean functions; combinational circuits; digital arithmetic; minimisation; sorting; boolean function minimization; cardinality counting; integers sorting method; low-order bits; most significant digit binary-radix sort; subsets; boolean functions; minimization; sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modern Problems of Radio Engineering Telecommunications and Computer Science (TCSET), 2012 International Conference on
Conference_Location :
Lviv-Slavske
Print_ISBN :
978-1-4673-0283-8
Type :
conf
Filename :
6192780
Link To Document :
بازگشت