Sciweavers

    32 search results - page 7 / 7
    » hf 2008
    Sort
    View
    TCAD
    1998
    86views more  TCAD 1998»
    Fast heuristic and exact algorithms for two-level hazard-free logic minimization
    13 years 5 months ago
    Fast heuristic and exact algorithms for two-level hazard-free logic minimization
    Download  www.cs.columbia.edu
    None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
    Michael Theobald, Steven M. Nowick
    claim paper
    Read More »
    DAC
    2008
    ACM
    146views Computer Architecture» more  DAC 2008»
    Bi-decomposing large Boolean functions via interpolation and satisfiability solving
    14 years 6 months ago
    Bi-decomposing large Boolean functions via interpolation and satisfiability solving
    Download  alcom.ee.ntu.edu.tw
    Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
    Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.