Sciweavers

868 search results - page 21 / 174
» Optimizing Logic Design Using Boolean Transforms
Sort
View
DAC
2004
ACM
15 years 1 months ago
Implicit pseudo boolean enumeration algorithms for input vector control
In a CMOS combinational logic circuit, the subthreshold leakage current in the standby state depends on the state of the inputs. In this paper we present a new approach to identif...
Kaviraj Chopra, Sarma B. K. Vrudhula
ICIP
2008
IEEE
15 years 11 months ago
Sparse orthonormal transforms for image compression
We propose a block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities. Unlike established work,...
Osman Gokhan Sezer, Oztan Harmanci, Onur G. Gulery...
FPGA
2008
ACM
145views FPGA» more  FPGA 2008»
14 years 11 months ago
FPGA interconnect design using logical effort
Logical effort (LE) is a linear technique for modelling the delay of a circuit in a technology independent manner. It offers the potential to simplify delay models for FPGAs and g...
Haile Yu, Yuk Hei Chan, Philip Heng Wai Leong
68
Voted
FMCAD
2009
Springer
15 years 4 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
IS
2002
14 years 9 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...