Sciweavers

    2 search results - page 1 / 1
    » Efficient computation of canonical form for Boolean matching...
    Sort
    View
    ASPDAC
    2004
    ACM
    76views Hardware» more  ASPDAC 2004»
    Efficient computation of canonical form for Boolean matching in large libraries
    15 years 10 months ago
    Efficient computation of canonical form for Boolean matching in large libraries
    Download  www.lsi-cad.com
    Debatosh Debnath, Tsutomu Sasao
    claim paper
    Read More »
    133
    Voted
    DAC
    2005
    ACM
    169views Computer Architecture» more  DAC 2005»
    A new canonical form for fast boolean matching in logic synthesis and verification
    16 years 6 months ago
    A new canonical form for fast boolean matching in logic synthesis and verification
    Download  atrak.usc.edu
    ? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
    Afshin Abdollahi, Massoud Pedram
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.