Sciweavers

995 search results - page 103 / 199
» complexity 2011
Sort
View
111
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...
146
Voted
ICASSP
2011
IEEE
14 years 7 months ago
A classifier-based decoding approach for large scale distributed coding
Canonical distributed quantization schemes do not scale to large sensor networks due to the exponential decoder storage complexity that they entail. Prior efforts to tackle this i...
Kumar Viswanatha, Sharadh Ramaswamy, Ankur Saxena,...
107
Voted
ICASSP
2011
IEEE
14 years 7 months ago
ML decoding in decode-and-forward based cooperative communication system
Abstract— In this paper, we derive a maximum-likelihood (ML) decoder of the decode-and-forward (DF) protocol utilizing an arbitrary complex-valued M-point constellation. Existing...
Manav R. Bhatnagar, Are Hjørungnes
127
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
120
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So