Sciweavers

48 search results - page 2 / 10
» Achieving Out-of-Order Performance with Almost In-Order Comp...
Sort
View
ICASSP
2009
IEEE
14 years 1 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
Boris Mailhé, Rémi Gribonval, Fr&eac...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 3 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
ICASSP
2011
IEEE
12 years 10 months ago
Efficient lattice-reduction-aided MMSE decision-feedback equalization
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
Robert F. H. Fischer
GLOBECOM
2007
IEEE
14 years 18 days ago
Performance Analysis of V-BLAST with Optimum Power Allocation
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
Victoria Kostina, Sergey Loyka
PACS
2000
Springer
132views Hardware» more  PACS 2000»
13 years 9 months ago
An Adaptive Issue Queue for Reduced Power at High Performance
Increasing power dissipation has become a major constraint for future performance gains in the design of microprocessors. In this paper, we present the circuit design of an issue ...
Alper Buyuktosunoglu, Stanley Schuster, David Broo...