Sciweavers

22 search results - page 1 / 5
» Computing support-minimal subfunctions during functional dec...
Sort
View
TVLSI
1998
124views more  TVLSI 1998»
13 years 4 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
DAC
1994
ACM
13 years 8 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
VLSID
2002
IEEE
207views VLSI» more  VLSID 2002»
14 years 5 months ago
Synthesis of High Performance Low Power Dynamic CMOS Circuits
This paper presents a novel approach for the synthesis of dynamic CMOS circuits using Domino and Nora styles. As these logic styles can implement only non-inverting logic, convent...
Debasis Samanta, Nishant Sinha, Ajit Pal
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 5 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
ESANN
2003
13 years 6 months ago
Neural networks organizations to learn complex robotic functions
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban