Searcharxiv⌕ Search

arXiv subjects

Wolfgang Utschick

Publications and source records attributed to Wolfgang Utschick.

At least 73 records · Page 4Linked to original sources

Highly Accelerated Weighted MMSE Algorithms for Designing Precoders in FDD Systems with Incomplete CSI

In this work, we derive a lower bound on the training-based achievable downlink (DL) sum rate (SR) of a multi-user multiple-input-single-output (MISO) system operating in frequency-division-duplex (FDD) mode. Assuming linear minimum mean square error (LMMSE) channel estimation is used, we establish a connection of the derived lower bound on the signal-to-interference-noise-ratio (SINR) to an average MSE that allows to reformulate the SR maximization problem as the minimization of the augmented weighted average MSE (AWAMSE). We propose an iterative precoder design with three alternating steps, all given in closed form, drastically reducing the computation time. We show numerically the effectiveness of the proposed approach in challenging scenarios with limited channel knowledge, i.e., we consider scenarios with a very limited number of pilots. We additionally propose a more efficient version of the well-known stochastic iterative WMMSE (SIWMMSE) approach, where the precoder update is given in closed form.

eess.SP↗

Unsupervised Parameter Estimation using Model-based Decoder

In this work, we consider the use of a model-based decoder in combination with an unsupervised learning strategy for direction-of-arrival (DoA) estimation. Relying only on unlabeled training data we show in our analysis that we can outperform existing unsupervised machine learning methods and classical methods. The proposed approach consists of introducing a model-based decoder in an autoencoder architecture which leads to a meaningful representation of the statistical model in the latent space of the autoencoder. Our numerical simulations show that the performance of the presented approach is not affected by correlated signals and performs well for both, uncorrelated and correlated, scenarios. This is a result of the fact, that, in the proposed framework, the signal covariance matrix and the DOAs are estimated simultaneously.

eess.SP↗

Enhanced Low-Complexity FDD System Feedback with Variable Bit Lengths via Generative Modeling

Recently, a versatile limited feedback scheme based on a Gaussian mixture model (GMM) was proposed for frequency division duplex (FDD) systems. This scheme provides high flexibility regarding various system parameters and is applicable to both point-to-point multiple-input multiple-output (MIMO) and multi-user MIMO (MU-MIMO) communications. The GMM is learned to cover the operation of all mobile terminals (MTs) located inside the base station (BS) cell, and each MT only needs to evaluate its strongest mixture component as feedback, eliminating the need for channel estimation at the MT. In this work, we extend the GMM-based feedback scheme to variable feedback lengths by leveraging a single learned GMM through merging or pruning of dispensable mixture components. Additionally, the GMM covariances are restricted to Toeplitz or circulant structure through model-based insights. These extensions significantly reduce the offloading amount and enhance the clustering ability of the GMM which, in turn, leads to an improved system performance. Simulation results for both point-to-point and multi-user systems demonstrate the effectiveness of the proposed extensions.

cs.IT↗

A Versatile Low-Complexity Feedback Scheme for FDD Systems via Generative Modeling

We propose a versatile feedback scheme for both single- and multi-user multiple-input multiple-output (MIMO) frequency division duplex (FDD) systems. Particularly, we propose utilizing a Gaussian mixture model (GMM) with a reduced number of parameters for codebook construction, feedback encoding, and precoder design. The GMM is fitted offline at the base station (BS) to uplink training samples to approximate the channel distribution of all possible mobile terminals (MTs) within the BS cell. Subsequently, a codebook is constructed, with each element based on one GMM component. Extracting directional information from the codebook or exploiting the GMM's sample generation ability facilitates joint precoder design for a multi-user MIMO system using state-of-the-art precoding algorithms. After offloading the GMM to the MTs, they can easily determine their feedback by selecting the index of the GMM component with the highest responsibility for their received pilot signal. This strategy exhibits low complexity and supports parallelization. Simulations demonstrate that the proposed approach outperforms conventional methods, which either estimate the channel and utilize a Lloyd codebook or use a deep neural network to determine the feedback in terms of spectral efficiency or sum-rate. The performance gains can be exploited to deploy systems with fewer pilots or feedback bits.

cs.IT↗

Gohberg-Semencul Estimation of Toeplitz Structured Covariance Matrices and Their Inverses

When only few data samples are accessible, utilizing structural prior knowledge is essential for estimating covariance matrices and their inverses. One prominent example is knowing the covariance matrix to be Toeplitz structured, which occurs when dealing with wide sense stationary (WSS) processes. This work introduces a novel class of positive definiteness ensuring likelihood-based estimators for Toeplitz structured covariance matrices (CMs) and their inverses. In order to accomplish this, we derive positive definiteness enforcing constraint sets for the Gohberg-Semencul (GS) parameterization of inverse symmetric Toeplitz matrices. Motivated by the relationship between the GS parameterization and autoregressive (AR) processes, we propose hyperparameter tuning techniques, which enable our estimators to combine advantages from state-of-the-art likelihood and non-parametric estimators. Moreover, we present a computationally cheap closed-form estimator, which is derived by maximizing an approximate likelihood. Due to the ensured positive definiteness, our estimators perform well for both the estimation of the CM and the inverse covariance matrix (ICM). Extensive simulation results validate the proposed estimators' efficacy for several standard Toeplitz structured CMs commonly employed in a wide range of applications.

eess.SP↗

Unsupervised high-throughput segmentation of cells and cell nuclei in quantitative phase images

In the effort to aid cytologic diagnostics by establishing automatic single cell screening using high throughput digital holographic microscopy for clinical studies thousands of images and millions of cells are captured. The bottleneck lies in an automatic, fast, and unsupervised segmentation technique that does not limit the types of cells which might occur. We propose an unsupervised multistage method that segments correctly without confusing noise or reflections with cells and without missing cells that also includes the detection of relevant inner structures, especially the cell nucleus in the unstained cell. In an effort to make the information reasonable and interpretable for cytopathologists, we also introduce new cytoplasmic and nuclear features of potential help for cytologic diagnoses which exploit the quantitative phase information inherent to the measurement scheme. We show that the segmentation provides consistently good results over many experiments on patient samples in a reasonable per cell analysis time.

eess.IV↗

A Zero-Forcing Approach for the RIS-Aided MIMO Broadcast Channel

We present efficient algorithms for the sum-spectral efficiency (SE) maximization of the multi-user reconfigurable intelligent surface (RIS)-aided multiple-input multiple-output (MIMO) broadcast channel based on a zero-forcing approach. These methods conduct a user allocation for which the computation is independent of the number of elements at the RIS, that is usually large. Specifically, two algorithms are given that exploit the line-of-sight (LOS) structure between the base station (BS) and the RIS. Simulations show superior SE performance compared to other linear precoding algorithms but with lower complexity.

cs.IT↗

Data-Aided Channel Estimation Utilizing Gaussian Mixture Models

In this work, we propose two methods that utilize data symbols in addition to pilot symbols for improved channel estimation quality in a multi-user system, so-called semi-blind channel estimation. To this end, a subspace is estimated based on all received symbols and utilized to improve the estimation quality of a Gaussian mixture model-based channel estimator, which solely uses pilot symbols for channel estimation. Both of the proposed approaches allow for parallelization. Even the precomputation of estimation filters, which is beneficial in terms of computational complexity, is enabled by one of the proposed methods. Numerical simulations for real channel measurement data available to us show that the proposed methods outperform the studied state-of-the-art channel estimators.

eess.SP↗

Design of a Single-User RIS-Aided MISO System Based on Statistical Channel Knowledge

Reconfigurable intelligent surface (RIS) is considered a prospective technology for beyond fifth-generation (5G) networks to improve the spectral and energy efficiency at a low cost. Prior works on the RIS mainly rely on perfect channel state information (CSI), which imposes a huge computational complexity. This work considers a single-user RIS-assisted communication system, where the second-order statistical knowledge of the channels is exploited to reduce the training overhead. We present algorithms that do not require estimation of the CSI and reconfiguration of the RIS in every channel coherence interval, which constitutes one of the most critical practical issues in an RIS-aided system.

eess.SP↗

Physically Consistent Modelling of Wireless Links with Reconfigurable Intelligent Surfaces Using Multiport Network Analysis

RISs are an emerging technology for engineering the channels of future wireless communication systems. The vast majority of research publications on RIS are focussing on system-level optimization and are based on very simplistic models ignoring basic physical laws. There are only a few publications with a focus on physical modeling. Nevertheless, the widely employed model is still inconsistent with basic physical laws. We will show that even with a very simple abstract model based on isotropic radiators, ignoring any mismatch, mutual coupling, and losses, each RIS element cannot be modeled to simply reflect the incident signal by manipulating its phase only and letting the amplitude unchanged. We will demonstrate the inconsistencies with the aid of very simple toy examples, even with only one or two RIS elements. Based on impedance parameters, the problems associated with scattering parameters can be identified enabling a correct interpretation of the derived solutions.

eess.SP↗

Prediction and Interpretation of Vehicle Trajectories in the Graph Spectral Domain

This work provides a comprehensive analysis and interpretation of the graph spectral representation of traffic scenarios. Based on a spatio-temporal vehicle interaction graph, an observed traffic scenario can be transformed into the graph spectral domain by means of the multidimensional Graph Fourier Transformation. Since these spectral scenario representations have shown to successfully incorporate the complex and interactive nature of traffic scenarios, the beneficial feature representation is employed for the purpose of predicting vehicle trajectories. This work introduces GFTNNv2, a deep learning network predicting vehicle trajectories in the graph spectral domain. Evaluation of the GFTNNv2 on the publicly available datasets highD and NGSIM shows a performance gain of up to 25% in comparison to state-of-the-art prediction approaches.

cs.AI↗

On Learning the Tail Quantiles of Driving Behavior Distributions via Quantile Regression and Flows

Towards safe autonomous driving (AD), we consider the problem of learning models that accurately capture the diversity and tail quantiles of human driver behavior probability distributions, in interaction with an AD vehicle. Such models, which predict drivers' continuous actions from their states, are particularly relevant for closing the gap between AD agent simulations and reality. To this end, we adapt two flexible quantile learning frameworks for this setting that avoid strong distributional assumptions: (1) quantile regression (based on the titled absolute loss), and (2) autoregressive quantile flows (a version of normalizing flows). Training happens in a behavior cloning-fashion. We use the highD dataset consisting of driver trajectories on several highways. We evaluate our approach in a one-step acceleration prediction task, and in multi-step driver simulation rollouts. We report quantitative results using the tilted absolute loss as metric, give qualitative examples showing that realistic extremal behavior can be learned, and discuss the main insights.

cs.LG↗

Model Order Selection with Variational Autoencoding

Classical methods for model order selection often fail in scenarios with low SNR or few snapshots. Deep learning-based methods are promising alternatives for such challenging situations as they compensate lack of information in the available observations with training on large datasets. This manuscript proposes an approach that uses a variational autoencoder (VAE) for model order selection. The idea is to learn a parameterized conditional covariance matrix at the VAE decoder that approximates the true signal covariance matrix. The method is unsupervised and only requires a small representative dataset for calibration after training the VAE. Numerical simulations show that the proposed method outperforms classical methods and even reaches or beats a supervised approach depending on the considered snapshots.

eess.SP↗

Channel Estimation based on Gaussian Mixture Models with Structured Covariances

In this work, we propose variations of a Gaussian mixture model (GMM) based channel estimator that was recently proven to be asymptotically optimal in the minimum mean square error (MMSE) sense. We account for the need of low computational complexity in the online estimation and low cost for training and storage in practical applications. To this end, we discuss modifications of the underlying expectation-maximization (EM) algorithm, which is needed to fit the parameters of the GMM, to allow for structurally constrained covariances. Further, we investigate splitting the 2D time and frequency estimation problem in wideband systems into cascaded 1D estimations with the help of the GMM. The proposed cascaded GMM approach drastically reduces the complexity and memory requirements. We observe that due to the training on realistic channel data, the proposed GMM estimators seem to inherently perform a trade-off between saving complexity/parameters and estimation performance. We compare these low-complexity approaches to a practical and low cost method that relies on the power delay profile (PDP) and the Doppler spectrum (DS). We argue that, with the training on scenario-specific data from the environment, these practical baselines are outperformed by far with equal estimation complexity.

cs.IT↗

Optimization and Interpretability of Graph Attention Networks for Small Sparse Graph Structures in Automotive Applications

For automotive applications, the Graph Attention Network (GAT) is a prominently used architecture to include relational information of a traffic scenario during feature embedding. As shown in this work, however, one of the most popular GAT realizations, namely GATv2, has potential pitfalls that hinder an optimal parameter learning. Especially for small and sparse graph structures a proper optimization is problematic. To surpass limitations, this work proposes architectural modifications of GATv2. In controlled experiments, it is shown that the proposed model adaptions improve prediction performance in a node-level regression task and make it more robust to parameter initialization. This work aims for a better understanding of the attention mechanism and analyzes its interpretability of identifying causal importance.

cs.LG↗

Machine Learning-Based CSI Feedback With Variable Length in FDD Massive MIMO

To fully unlock the benefits of multiple-input multiple-output (MIMO) networks, downlink channel state information (CSI) is required at the base station (BS). In frequency division duplex (FDD) systems, the CSI is acquired through a feedback signal from the user equipment (UE). However, this may lead to an important overhead in FDD massive MIMO systems. Focusing on these systems, in this study, we propose a novel strategy to design the CSI feedback. Our strategy allows to optimally design variable length feedback, that is promising compared to fixed feedback since users experience channel matrices differently sparse. Specifically, principal component analysis (PCA) is used to compress the channel into a latent space with adaptive dimensionality. To quantize this compressed channel, the feedback bits are smartly allocated to the latent space dimensions by minimizing the normalized mean squared error (NMSE) distortion. Finally, the quantization codebook is determined with k-means clustering. Numerical simulations show that our strategy improves the zero-forcing beamforming sum rate by 17%, compared to CsiNetPro. The number of model parameters is reduced by 23.4 times, thus causing a significantly smaller offloading overhead. At the same time, PCA is characterized by a lightweight unsupervised training, requiring eight times fewer training samples than CsiNetPro.

cs.IT↗

A Multidimensional Graph Fourier Transformation Neural Network for Vehicle Trajectory Prediction

This work introduces the multidimensional Graph Fourier Transformation Neural Network (GFTNN) for long-term trajectory predictions on highways. Similar to Graph Neural Networks (GNNs), the GFTNN is a novel network architecture that operates on graph structures. While several GNNs lack discriminative power due to suboptimal aggregation schemes, the proposed model aggregates scenario properties through a powerful operation: the multidimensional Graph Fourier Transformation (GFT). The spatio-temporal vehicle interaction graph of a scenario is converted into a spectral scenario representation using the GFT. This beneficial representation is input to the prediction framework composed of a neural network and a descriptive decoder. Even though the proposed GFTNN does not include any recurrent element, it outperforms state-of-the-art models in the task of highway trajectory prediction. For experiments and evaluation, the publicly available datasets highD and NGSIM are used

cs.LG↗

Reverse Ordering Techniques for Attention-Based Channel Prediction

This work aims to predict channels in wireless communication systems based on noisy observations, utilizing sequence-to-sequence models with attention (Seq2Seq-attn) and transformer models. Both models are adapted from natural language processing to tackle the complex challenge of channel prediction. Additionally, a new technique called reverse positional encoding is introduced in the transformer model to improve the robustness of the model against varying sequence lengths. Similarly, the encoder outputs of the Seq2Seq-attn model are reversed before applying attention. Simulation results demonstrate that the proposed ordering techniques allow the models to better capture the relationships between the channel snapshots within the sequence, irrespective of the sequence length, as opposed to existing methods.

stat.ML↗