Počet záznamů: 1  

Fast Boolean Minimizer for Completely Specified Functions

  1. 1.
    0312223 - ÚTIA 2009 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
    Fišer, P. - Rucký, P. - Váňová, Irena
    Fast Boolean Minimizer for Completely Specified Functions.
    [Rychlá minimalizace kompletně zadaných logických funkcí.]
    Proc. of 11th IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop 2008. Los Alamitos: IEEE, 2008, s. 122-127. ISBN 978-1-4244-2276-0.
    [11th IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop 2008. Bratislava (SK), 16.04.2008-18.04.2008]
    Výzkumný záměr: CEZ:AV0Z10750506
    Klíčová slova: boolean function * minimalization * binary decision diagram
    Kód oboru RIV: BD - Teorie informace
    http://library.utia.cas.cz/separaty/2008/ZOI/vanova-fast%20boolean%20minimizer%20for%20completely%20specified.pdfpdf

    We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree is proposed as a structure enabling a very compact representation of completely specified Boolean functions. The minimization algorithm is thus most suited for functions described by many on-set terms. When these functions are to be minimized, most of the state-of-the-art minimizers (Espresso) need prohibitively long time to process them, or they are even completely unusable, due to their very high memory consumption. Our algorithm is able to minimize such functions in a reasonable time, though the result quality does not reach the quality of other minimizers. Here our minimizer found its application as a pre-processor that, when run prior to, e.g., Espresso, significantly reduces total minimization time, while fully retaining the result quality.

    Rychlá minimalizace kompletně zadaných logických funkcí pomocí binárních rozhodovacích diagramů.
    Trvalý link: http://hdl.handle.net/11104/0163342

     
     
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.