Sciweavers

462 search results - page 42 / 93
» Symbolic Bounded Synthesis
Sort
View
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 7 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 2 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
FPGA
2006
ACM
113views FPGA» more  FPGA 2006»
15 years 7 months ago
Optimality study of logic synthesis for LUT-based FPGAs
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
Jason Cong, Kirill Minkovich
127
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Performance bounds of MIMO receivers in the presence of radio frequency interference
—Multi-input multi-output (MIMO) receivers have generally been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless tra...
Aditya Chopra, Kapil Gulati, Brian L. Evans, Keith...
GLOBECOM
2010
IEEE
15 years 1 months ago
Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...