Sciweavers

22 search results - page 2 / 5
» Computing support-minimal subfunctions during functional dec...
Sort
View
DAC
1996
ACM
13 years 9 months ago
A Boolean Approach to Performance-Directed Technology Mapping for LUT-Based FPGA Designs
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
Christian Legl, Bernd Wurth, Klaus Eckl
DAC
1998
ACM
13 years 9 months ago
Compatible Class Encoding in Hyper-Function Decomposition for FPGA Synthesis
Recently, functional decomposition has been adopted for LUT based FPGA technology mapping with good results. In this paper, we propose a novel method for functional multipleoutput...
Jie-Hong Roland Jiang, Jing-Yang Jou, Juinn-Dar Hu...
DAC
2001
ACM
14 years 6 months ago
An Algorithm for Bi-Decomposition of Logic Functions
We propose a new BDD-based method for decomposition of multi-output incompletely specified logic functions into netlists of two-input logic gates. The algorithm uses the internal ...
Alan Mishchenko, Bernd Steinbach, Marek A. Perkows...
ICCV
2011
IEEE
12 years 5 months ago
Learning to Cluster Using High Order Graphical Models with Latent Variables
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
Nikos Komodakis
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
13 years 7 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco