Sciweavers

2520 search results - page 444 / 504
» The complexity of approximating entropy
Sort
View
TSP
2010
14 years 4 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
ICASSP
2011
IEEE
14 years 1 months ago
Asymptotically MMSE-optimum pilot design for comb-type OFDM channel estimation in high-mobility scenarios
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
K. M. Zahidul Islam, Tareq Y. Al-Naffouri, Naofal ...
ICASSP
2011
IEEE
14 years 1 months ago
Variational methods for spectral unmixing of hyperspectral images
This paper studies a variational Bayesian unmixing algorithm for hyperspectral images based on the standard linear mixing model. Each pixel of the image is modeled as a linear com...
Olivier Eches, Nicolas Dobigeon, Jean-Yves Tourner...
ICASSP
2011
IEEE
14 years 1 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ICASSP
2011
IEEE
14 years 1 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew