Sciweavers

3456 search results - page 293 / 692
» Algorithms for Interface Synthesis
Sort
View
DAC
2001
ACM
16 years 8 months ago
MetaCores: Design and Optimization Techniques
Currently, hardware intellectual property (IP) is delivered at vels of abstraction: hard, firm, and soft. In order to further enhance performance, efficiency, and flexibility of I...
Seapahn Meguerdichian, Farinaz Koushanfar, Advait ...
DAC
2003
ACM
16 years 8 months ago
Large-scale SOP minimization using decomposition and functional properties
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
Alan Mishchenko, Tsutomu Sasao
APN
2005
Springer
16 years 24 days ago
Determinate STG Decomposition of Marked Graphs
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
16 years 20 days ago
Register binding and port assignment for multiplexer optimization
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
Deming Chen, Jason Cong
BIBM
2009
IEEE
156views Bioinformatics» more  BIBM 2009»
16 years 10 days ago
Bayesian Classifier for Anchored Protein Sorting Discovery
—A typical cell has a size of only 10 µm while it contains about a billion proteins. Transportation of these proteins from their synthesis sites to their target locations within...
Fan Zhang, Jianjun Hu