Sciweavers

2607 search results - page 52 / 522
» Complete Functional Synthesis
Sort
View
105
Voted
DAC
1995
ACM
15 years 6 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
146
Voted
KBSE
2000
IEEE
15 years 6 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
119
Voted
FCCM
2000
IEEE
144views VLSI» more  FCCM 2000»
15 years 7 months ago
Automatic Synthesis of Data Storage and Control Structures for FPGA-Based Computing Engines
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
Pedro C. Diniz, Joonseok Park
99
Voted
VLSID
1996
IEEE
133views VLSI» more  VLSID 1996»
15 years 6 months ago
Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach
A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventi...
Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy G...
109
Voted
BMCBI
2007
109views more  BMCBI 2007»
15 years 2 months ago
Towards a comprehensive structural coverage of completed genomes: a structural genomics viewpoint
Background: Structural genomics initiatives were established with the aim of solving protein structures on a large-scale. For many initiatives, such as the Protein Structure Initi...
Russell L. Marsden, Tony A. Lewis, Christine A. Or...