Marius Pesavento
Marius Pesavento
Professor for Communication Systems, Technische Universität Darmstadt
Zweryfikowany adres z nt.tu-darmstadt.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Unitary root-MUSIC with a real-valued eigendecomposition: A theoretical and experimental performance study
M Pesavento, AB Gershman, M Haardt
IEEE transactions on signal processing 48 (5), 1306-1314, 2000
2772000
Maximum-likelihood direction-of-arrival estimation in the presence of unknown nonuniform noise
M Pesavento, AB Gershman
IEEE Transactions on Signal Processing 49 (7), 1310-1324, 2001
2442001
Direction finding in partly calibrated sensor arrays composed of multiple subarrays
M Pesavento, AB Gershman, KM Wong
IEEE Transactions on Signal Processing 50 (9), 2103-2115, 2002
2122002
Joint network optimization and downlink beamforming for CoMP transmissions using mixed integer conic programming
Y Cheng, M Pesavento, A Philipp
IEEE Transactions on Signal Processing 61 (16), 3972-3987, 2013
1262013
Joint optimization of source power allocation and distributed relay beamforming in multiuser peer-to-peer relay networks
Y Cheng, M Pesavento
IEEE Transactions on Signal Processing 60 (6), 2962-2973, 2012
1062012
One-and two-dimensional direction-of-arrival estimation: An overview of search-free techniques
AB Gershman, M Rübsamen, M Pesavento
Signal Processing 90 (5), 1338-1349, 2010
962010
Estimating parameters of multiple wideband polynomial-phase sources in sensor arrays
AB Gershman, M Pesavento, MG Amin
IEEE Transactions on Signal Processing 49 (12), 2924-2934, 2001
892001
Distributed beamforming for multi-group multicasting relay networks
N Bornhorst, M Pesavento, AB Gershman
IEEE Transactions on Signal Processing 60 (1), 221-232, 2011
852011
Multidimensional rank reduction estimator for parametric MIMO channel models
M Pesavento, CF Mecklenbräuker, JF Böhme
EURASIP Journal on Advances in Signal Processing 2004 (9), 839148, 2004
772004
Robust array interpolation using second-order cone programming
M Pesavento, AB Gershman, ZQ Luo
IEEE Signal Processing Letters 9 (1), 8-11, 2002
742002
A parallel decomposition method for nonconvex stochastic multi-agent optimization problems
Y Yang, G Scutari, DP Palomar, M Pesavento
IEEE Transactions on Signal Processing 64 (11), 2949-2964, 2016
72*2016
Joint transceiver beamforming in MIMO cognitive radio network via second-order cone programming
H Du, T Ratnarajah, M Pesavento, CB Papadias
IEEE Transactions on Signal Processing 60 (2), 781-792, 2011
692011
Stochastic Cramér–Rao bound for direction estimation in unknown noise fields
AB Gershman, P Stoica, M Pesavento, EG Larsson
IEE Proceedings-Radar, Sonar and Navigation 149 (1), 2-8, 2002
692002
Iterative dual downlink beamforming for cognitive radio networks
M Pesavento, D Ciochina, AB Gershman
2010 Proceedings of the Fifth International Conference on Cognitive Radio …, 2010
582010
A unified successive pseudoconvex approximation framework
Y Yang, M Pesavento
IEEE Transactions on Signal Processing 65 (13), 3313-3328, 2017
522017
Subspace methods and exploitation of special array structures
M Haardt, M Pesavento, F Roemer, MN El Korso
Academic Press Library in Signal Processing 3, 651-717, 2014
502014
Virtual array design for array interpolation using differential geometry
M Buhren, M Pesavento, JF Bohme
2004 IEEE International Conference on Acoustics, Speech, and Signal …, 2004
422004
Direction of arrival estimation in partly calibrated time-varying sensor arrays
M Pesavento, AB Gershman, KM Wong
2001 IEEE International Conference on Acoustics, Speech, and Signal …, 2001
422001
Robust downlink beamforming with partial channel state information for conventional and cognitive radio networks
I Wajid, M Pesavento, YC Eldar, D Ciochina
IEEE Transactions on Signal Processing 61 (14), 3656-3670, 2013
412013
An iterative convex approximation approach for transmit beamforming in multi-group multicasting
N Bornhorst, M Pesavento
2011 IEEE 12th International Workshop on Signal Processing Advances in …, 2011
412011
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20