112 search results - page 12 / 23 » Quasi-interpretation Synthesis by Decomposition |
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
ASPDAC
2008
ACM
13 years 10 months ago
2008
ACM
Scaling is currently the most popular technique used to improve performance metrics of CMOS circuits. This cannot go on forever because the properties that are responsible for the ...
ASYNC
2004
IEEE
14 years 13 days ago
2004
IEEE
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesi...