Marius Pesavento

Dr. Marius Pesavento


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 June 2023 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
MPMarius Pesavento
Marius Pesavento
MTMinh Trinh-Hoang
Minh Trinh-Hoang
MVMats Viberg
Mats Viberg
The signal processing community is currently witnessing the emergence of sensor array processing and direction-of-arrival (DoA) estimation in various modern applications, such as automotive radar, mobile user and millimeter wave indoor localization, and drone surveillance, as well as in new paradigms, such as joint sensing and communication in future wireless systems. This trend is further enhanced by technology leaps and the availability of powerful and affordable multiantenna hardware platforms.

11 December 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YYYang Yang
Yang Yang
MPMarius Pesavento
Marius Pesavento
ZLZhi-Quan Luo
Zhi-Quan Luo
BOBjorn Ottersten
Bjorn Ottersten
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by solving the original optimization problem with respect to that block variable inexactly. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.

26 June 2020 in IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
Verified
Journal Article
Closed access
GAGianni Allevato
Gianni Allevato
JHJan Hinrichs
Jan Hinrichs
MRMatthias Rutsch
Matthias Rutsch
JAJan Philipp Adler
Jan Philipp Adler
AJAxel Jager
Axel Jager
MKMario Kupnik
Mario Kupnik
We present an air-coupled ultrasonic imaging system based on a 40 kHz 8×8 phased-array for three-dimensional real-time localization of multiple objects in the far-field. By attaching a waveguide to the array, the effective inter-element spacing is reduced to half wavelength. This enables grating lobe free transmit and receive beamforming with a uniform rectangular array of efficient low-cost transducers. The system further includes custom transceiver electronics, an FPGA Systemon- Chip and a PC for GPU accelerated frequency domain signal processing, consisting of matched filtering, conventional beamforming and envelope extraction using Nvidia CUDA and OpenGL for visualization. The uniform rectangular layout allows utilizing multiple transmit and receive methods, known from medical imaging applications. Thus, the system is dynamically adaptable to maximize the frame rate or detection range. One implemented method demonstrates the real-time capability by transmitting a hemispherical pulse with a single transducer to irradiate the surroundings simultaneously, whereas all transducers are used for echo reception. The imaging properties, such as axial and lateral resolution, field of view and range of view, are characterized in an anechoic chamber. The object localization is validated for a horizontal and vertical field of view of ±80° and a range of view of 0.5m to 3m with 29 frames per second. Using the same system, a comparison between the hemispherical pulse method and the dynamic transmit beamforming method, which transmits multiple sequential beamformed pulses for long-range localization, is provided.

12 October 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MTMinh Trinh-Hoang
Minh Trinh-Hoang
MVMats Viberg
Mats Viberg
MPMarius Pesavento
Marius Pesavento
In this paper, the partial relaxation approach is introduced and applied to the DOA estimation problem using spectral search. Unlike existing spectral-based methods like conventional beamformer, Capon beamformer or MUSIC which can be considered as single source approximation of multi-source estimation criteria, the proposed approach accounts for the existence of multiple sources. At each considered direction, the manifold structure of the remaining interfering signals impinging on the sensor array is relaxed, which results in closed form estimates for the “interference” parameters. Thanks to this relaxation, the conventional multi-source optimization problem reduces to a simple spectral search. Following this principle, we propose estimators based on the Deterministic Maximum Likelihood, Weighted Subspace Fitting and covariance fitting methods. To calculate the null-spectra efficiently, an iterative rooting scheme based on the rational function approximation is applied to the partial relaxation methods. Simulation results show that, irrespectively of any specific structure of the sensor array, the performance of the proposed estimators is superior to the conventional methods, especially in the case of low Signal-to-Noise-Ratio and low number of snapshots, while maintaining a computational cost which is comparable to MUSIC.

7 February 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
LSLukas Schynol
Lukas Schynol
MPMarius Pesavento
Marius Pesavento
Coordinated weighted sum-rate maximization in multicell MIMO networks with intra- and intercell interference and local channel state at the base stations is recognized as an important yet difficult problem. A classical, locally optimal solution is obtained by the weighted minimum mean squared error (WMMSE) algorithm which facilitates a distributed implementation in multicell networks. However, it often suffers from slow convergence and therefore large communication overhead. To obtain more practical solutions, the unrolling/unfolding of traditional iterative algorithms gained significant attention. In this work, we demonstrate a complete unfolding of the WMMSE algorithm for transceiver design in multicell MU-MIMO interference channels with local channel state information. The resulting architecture termed GCN-WMMSE applies ideas from graph signal processing and is agnostic to different wireless network topologies, while exhibiting a low number of trainable parameters and high efficiency w.r.t. training data. It significantly reduces the number of required iterations while achieving performance similar to the WMMSE algorithm, alleviating the overhead in a distributed deployment. Additionally, we review previous architectures based on unrolling the WMMSE algorithm and compare them to GCN-WMMSE in their specific applicable domains.

3 September 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
WSWassim Suleiman
Wassim Suleiman
PPPouyan Parvazi
Pouyan Parvazi
MPMarius Pesavento
Marius Pesavento
AZAbdelhak M. Zoubir
Abdelhak M. Zoubir
In this paper, direction-of-arrival (DOA) estimation using non-coherent processing for partly calibrated arrays composed of multiple subarrays is considered. The subarrays are assumed to compute locally the sample covariance matrices of their measurements and communicate them to the processing center. A sufficient condition for the unique identifiability of the sources in the aforementioned non-coherent processing scheme is presented. We prove that, under mild conditions, with the non-coherent system of subarrays, it is possible to identify more sources than identifiable by each individual subarray. This property of non-coherent processing has not been investigated before. We derive the maximum likelihood estimator for DOA estimation at the processing center using the sample covariance matrices received from the subarrays. Moreover, the Cramér-Rao bound (CRB) for our measurement model is derived and is used to assess the presented DOA estimators. The behavior of the CRB at high signal-to-noise ratio (SNR) is analyzed. In contrast to coherent processing, we prove that the CRB approaches zero at high SNR only if at least one subarray can identify the sources individually.