[go: up one dir, main page]

Juan et al., 1994 - Google Patents

Condition graphs for high-quality behavioral synthesis

Juan et al., 1994

View PDF
Document ID
9800982714421460910
Author
Juan H
Chaiyakul V
Gajski D
Publication year

External Links

Snippet

Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. The quality of the synthesized design is strongly influenced by the number of mutually exclusive operators …
Continue reading at escholarship.org (PDF) (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/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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/5022—Logic simulation, e.g. for logic circuit operation
    • 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/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3604—Software analysis for verifying properties of programs
    • 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/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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
    • G06F8/44—Encoding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3457—Performance evaluation by simulation
    • 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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
EP0917073B1 (en) Method for verifying and representing hardware by decomposition and partitioning
US8015528B2 (en) Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithms
Miller et al. On the construction of multiple-valued decision diagrams
de Moura et al. Proofs and Refutations, and Z3.
Karplus Using if-then-else DAGs for multi-level logic minimization
US5477474A (en) Computer logic simulation with dynamic modeling
Juan et al. Condition graphs for high-quality behavioral synthesis
US7831937B2 (en) Method and system for reduction of XOR/XNOR subexpressions in structural design representations
Georgiadis et al. Finding dominators in practice
Dechter et al. Generating random solutions for constraint satisfaction problems
Giunchiglia et al. Evaluating search heuristics and optimization techniques in propositional satisfiability
Klarner et al. Basins of attraction, commitment sets, and phenotypes of Boolean networks
Meijer et al. Read, write and copy dependencies for symbolic model checking
US7823093B2 (en) Method and system for reduction of and/or subexpressions in structural design representations
Rosenkrantz et al. Analysis problems for graphical dynamical systems: a unified approach through graph predicates
Nagayama et al. Minimization of average path length in BDDs by variable reordering
Talupur et al. Range allocation for separation logic
Bruschi et al. A framework for the functional verification of SystemC models
Stojković et al. Reversible circuits synthesis from functional decision diagrams by using node dependency matrices
Wang et al. Exploring target function approximation for stochastic circuit minimization
US7565636B2 (en) System for performing verification of logic circuits
Fedin et al. Automated proofs of upper bounds on the running time of splitting algorithms
Yuan et al. Automatic vector generation using constraints and biasing
Saitou et al. Dominance analysis of irreducible CFGs by reduction
Mendias et al. Efficient verification of scheduling, allocation and binding in high-level synthesis