[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Wang et al., 2003 - Google Patents

Multilevel logic simplification based on a containment recursive paradigm

Wang et al., 2003

Document ID
9623732206778533399
Author
Wang L
Almaini A
Publication year
Publication venue
IEE Proceedings-Computers and Digital Techniques

External Links

Snippet

Multilevel logic simplification plays a very important role to achieve high quality digital circuits in the design flow of application specific integrated circuit or a field programmable gate array products. The fundamental concept of unateness, is extended to the concept of …
Continue reading at digital-library.theiet.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5081—Layout analysis, e.g. layout verification, design rule check
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/5054—Circuit design for user-programmable logic devices, e.g. field programmable gate arrays [FPGA]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/504—Formal methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/78—Power analysis and optimization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme

Similar Documents

Publication Publication Date Title
Chang et al. Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams
Mailhot et al. Algorithms for technology mapping based on binary decision diagrams and on Boolean operations
Hassoun et al. Logic synthesis and verification
Amaru et al. Majority-inverter graph: A new paradigm for logic optimization
Benini et al. Automatic synthesis of low-power gated-clock finite-state machines
JP3119646B2 (en) Evaluation device and arithmetic processing method for reconfigurable hardware system
US20070150858A1 (en) Behavioral synthesis methods for generating computer-executable code
Kubica et al. Technology Mapping for LUT-based FPGA
EP2097841A2 (en) Polynomial synthesis
Murgai et al. Optimum functional decomposition using encoding
Ciesielski et al. PLADE: A two-stage PLA decomposition
Mishchenko et al. A new enhanced constructive decomposition and mapping algorithm
Yamashita et al. SPFD: A new method to express functional flexibility
Saldanha et al. A framework for satisfying input and output encoding constraints
JP4495865B2 (en) Inter-trade application service provider
Theobald et al. Espresso-hf: A heuristic hazard-free minimizer for two-level logic
Malik et al. Symbolic minimization of multilevel logic and the input encoding problem
Roig et al. Hierarchical gate-level verification of speed-independent circuits
Brayton The future of logic synthesis and verification
Schafer et al. Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's
Wang et al. Multilevel logic simplification based on a containment recursive paradigm
Labiak From UML statecharts to FPGA-the HiCoS approach.
Solov’ev Synthesis of fast finite state machines on programmable logic integrated circuits by splitting internal states
KR20220017993A (en) Recovering behavior designs from flat netlists
Chai et al. MVSIS 2.0 user’s manual