An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions

The goal of this study is the avoidance of excessive amount of temporary results produced during the minimization process of the two-level single-output Boolean functions of many variables. In this paper we have proposed an off-set based-direct cover minimization method that uses a single on-cube or...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:EUROCON 2007 - the International Conference on Computer as a Tool s. 432 - 438
Hlavní autoři: Basciftci, F., Kahramanli, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2007
Témata:
Algebra
Boolean functions
Circuits
Computer science education
cube algebra
cube expanding
direct-cover principle
Filters
Hypercubes
Iterative algorithms
Iterative methods
Logic minimization
Minimization methods
Off-set based minimization
prime implicant
Terminology
ISBN:9781424408122, 1424408121
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The goal of this study is the avoidance of excessive amount of temporary results produced during the minimization process of the two-level single-output Boolean functions of many variables. In this paper we have proposed an off-set based-direct cover minimization method that uses a single on-cube oriented expanding of the off-cubes on which the essential prime implicants are identified in a one by one manner and are used for iterative covering the function being minimized. The amount of temporary results produced by this method does not exceed the size of the offset. The proposed algorithm is up to 3 times faster and uses significantly less amount of memory than well known ESPRESSO.
ISBN:9781424408122
1424408121
DOI:10.1109/EURCON.2007.4400396