arXiv subjects

Wolfgang Utschick

Publications and source records attributed to Wolfgang Utschick.

At least 91 records · Page 5Linked to original sources

arXiv2023

Low-Rank Structured MMSE Channel Estimation with Mixtures of Factor Analyzers

This work proposes a generative modeling-aided channel estimator based on mixtures of factor analyzers (MFA). In an offline step, the parameters of the generative model are inferred via an expectation-maximization (EM) algorithm in order to learn the underlying channel distribution of a whole communication scenario inside a base station (BS) cell. Thereby, the wireless channels are effectively modeled on a piecewise linear subspace which is achieved by the low-rank structure of the learned covariances of the MFA. This suits the low-rank structure of wireless channels at high frequencies and additionally saves parameters and prevents overfitting. Afterwards, the trained MFA model is used online to perform channel estimation with a closed-form solution of the estimator which asymptotically converges to the minimum mean square error (MMSE) estimator. Numerical results based on real-world measurements demonstrate the great potential of the proposed approach for channel estimation.

eess.SP↗

arXiv2023

On the Mean Square Error Optimal Estimator in One-Bit Quantized Systems

This paper investigates the mean square error (MSE)-optimal conditional mean estimator (CME) in one-bit quantized systems in the context of channel estimation with jointly Gaussian inputs. We analyze the relationship of the generally nonlinear CME to the linear Bussgang estimator, a well-known method based on Bussgang's theorem. We highlight a novel observation that the Bussgang estimator is equal to the CME for different special cases, including the case of univariate Gaussian inputs and the case of multiple pilot signals in the absence of additive noise prior to the quantization. For the general cases we conduct numerical simulations to quantify the gap between the Bussgang estimator and the CME. This gap increases for higher dimensions and longer pilot sequences. We propose an optimal pilot sequence, motivated by insights from the CME, and derive a novel closed-form expression of the MSE for that case. Afterwards, we find a closed-form limit of the MSE in the asymptotically large number of pilots regime that also holds for the Bussgang estimator. Lastly, we present numerical experiments for various system parameters and for different performance metrics which illuminate the behavior of the optimal channel estimator in the quantized regime. In this context, the well-known stochastic resonance effect that appears in quantized systems can be quantified.

cs.IT↗

arXiv2023

Gradient Derivation for Learnable Parameters in Graph Attention Networks

This work provides a comprehensive derivation of the parameter gradients for GATv2 [4], a widely used implementation of Graph Attention Networks (GATs). GATs have proven to be powerful frameworks for processing graph-structured data and, hence, have been used in a range of applications. However, the achieved performance by these attempts has been found to be inconsistent across different datasets and the reasons for this remains an open research question. As the gradient flow provides valuable insights into the training dynamics of statistically learning models, this work obtains the gradients for the trainable model parameters of GATv2. The gradient derivations supplement the efforts of [2], where potential pitfalls of GATv2 are investigated.

cs.LG↗

arXiv2023

Classification and Uncertainty Quantification of Corrupted Data using Semi-Supervised Autoencoders

Parametric and non-parametric classifiers often have to deal with real-world data, where corruptions like noise, occlusions, and blur are unavoidable - posing significant challenges. We present a probabilistic approach to classify strongly corrupted data and quantify uncertainty, despite the model only having been trained with uncorrupted data. A semi-supervised autoencoder trained on uncorrupted data is the underlying architecture. We use the decoding part as a generative model for realistic data and extend it by convolutions, masking, and additive Gaussian noise to describe imperfections. This constitutes a statistical inference task in terms of the optimal latent space activations of the underlying uncorrupted datum. We solve this problem approximately with Metric Gaussian Variational Inference (MGVI). The supervision of the autoencoder's latent space allows us to classify corrupted data directly under uncertainty with the statistically inferred latent space activations. Furthermore, we demonstrate that the model uncertainty strongly depends on whether the classification is correct or wrong, setting a basis for a statistical "lie detector" of the classification. Independent of that, we show that the generative model can optimally restore the uncorrupted datum by decoding the inferred latent space activations.

cs.LG↗

arXiv2023

High SNR Analysis of RIS-Aided MIMO Broadcast Channels

We analyze the influence of a reconfigurable intelligent surface (RIS) on the Gram channel eigenvalues in a high signal-to-noise ratio (SNR) scenario. This allows to connect specific channel properties with the rank improvement capabilities of the RIS. In particular, fundamental limits due to a possible line of sight (LOS) setup between the base station (BS) and the RIS are derived. Furthermore, dirty paper coding (DPC) based schemes are compared to linear precoding in such a scenario and it is shown that under certain channel conditions, the performance gap between DPC and linear precoding vanishes.

cs.IT↗

arXiv2023

Learning a Gaussian Mixture Model from Imperfect Training Data for Robust Channel Estimation

In this letter, we propose a Gaussian mixture model (GMM)-based channel estimator which is learned on imperfect training data, i.e., the training data are solely comprised of noisy and sparsely allocated pilot observations. In a practical application, recent pilot observations at the base station (BS) can be utilized for training. This is in sharp contrast to state-of-theart machine learning (ML) techniques where a training dataset consisting of perfect channel state information (CSI) samples is a prerequisite, which is generally unaffordable. In particular, we propose an adapted training procedure for fitting the GMM which is a generative model that represents the distribution of all potential channels associated with a specific BS cell. To this end, the necessary modifications of the underlying expectation-maximization (EM) algorithm are derived. Numerical results show that the proposed estimator performs close to the case where perfect CSI is available for the training and exhibits a higher robustness against imperfections in the training data as compared to state-of-the-art ML techniques.

eess.SP↗

arXiv2023

Rate Splitting in FDD Massive MIMO Systems Based on the Second Order Statistics of Transmission Channels

In this work, we present new results for the application of rate splitting multiple access (RSMA) to the downlink (DL) of a massive multiple-input-multiple-output (MaMIMO) system operating in frequency-division-duplex (FDD) mode. Due to the lack of uplink (UL) - DL channel reciprocity in such systems, explicit training in the DL has to be performed in order to gain knowledge about the single-antenna users' channels at the base station (BS). This is ensured through a feedback link from the users to the BS. Dealing with the DL of a massive MIMO system implies that acquiring the DL channel state information (CSI) comes at the cost of a huge training overhead that scales with the number of BS antennas. Therefore, we limit the resources allocated to training by reusing the pilot sequences among the BS antennas that results in a contaminated channel observation. Despite this incomplete channel knowledge at the transmitter side, the proposed RS approach combined with a statistical precoder relying on the channels' second-order information achieves excellent results in terms of spectral efficiency compared to the state-of-art techniques. This is demonstrated via Monte-Carlo simulations of typical communication scenarios.

eess.SP↗

arXiv2023

Channel Estimation with Reduced Phase Allocations in RIS-Aided Systems

We consider channel estimation in systems equipped with a reconfigurable intelligent surface (RIS). In order to illuminate the additional cascaded channel as compared to systems without a RIS, commonly an unaffordable amount of pilot sequences has to be transmitted over different phase allocations at the RIS. However, for a given base station (BS) cell, there exist immanent structural characteristics of the environment which can be leveraged to reduce the necessary number of phase allocations. We verify this observation by a study on discrete Fourier transform (DFT)-based phase allocations where we exhaustively search for the best combination of DFT columns. Since this brute-force search is unaffordable in practice, we propose to learn a neural network (NN) for joint phase optimization and channel estimation because of the dependency of the optimal phase allocations on the channel estimator, and vice versa. We verify the effectiveness of the approach by numerical simulations where common choices for the phase allocations and the channel estimator are outperformed. By an ablation study, the learned phase allocations are shown to be beneficial in combination with a different state-of-the-art channel estimator as well.

eess.SP↗

arXiv2022

Variational Autoencoder Leveraged MMSE Channel Estimation

We propose to utilize a variational autoencoder (VAE) for data-driven channel estimation. The underlying true and unknown channel distribution is modeled by the VAE as a conditional Gaussian distribution in a novel way, parameterized by the respective first and second order conditional moments. As a result, it can be observed that the linear minimum mean square error (LMMSE) estimator in its variant conditioned on the latent sample of the VAE approximates an optimal MSE estimator. Furthermore, we argue how a VAE-based channel estimator can approximate the MMSE channel estimator. We propose three variants of VAE estimators that differ in the data used during training and estimation. First, we show that given perfectly known channel state information at the input of the VAE during estimation, which is impractical, we obtain an estimator that can serve as a benchmark result for an estimation scenario. We then propose practically feasible approaches, where perfectly known channel state information is only necessary in the training phase or is not needed at all. Simulation results on 3GPP and QuaDRiGa channel data attest a small performance loss of the practical approaches and the superiority of our VAE approaches in comparison to other related channel estimation methods.

eess.SP↗

arXiv2022

Variational Inference Aided Estimation of Time Varying Channels

One way to improve the estimation of time varying channels is to incorporate knowledge of previous observations. In this context, Dynamical VAEs (DVAEs) build a promising deep learning (DL) framework which is well suited to learn the distribution of time series data. We introduce a new DVAE architecture, called k-MemoryMarkovVAE (k-MMVAE), whose sparsity can be controlled by an additional memory parameter. Following the approach in [1] we derive a k-MMVAE aided channel estimator which takes temporal correlations of successive observations into account. The results are evaluated on simulated channels by QuaDRiGa and show that the k-MMVAE aided channel estimator clearly outperforms other machine learning (ML) aided estimators which are either memoryless or naively extended to time varying channels without major adaptions.

eess.SP↗

arXiv2022

CSI Clustering with Variational Autoencoding

The model order of a wireless channel plays an important role for a variety of applications in communications engineering, e.g., it represents the number of resolvable incident wavefronts with non-negligible power incident from a transmitter to a receiver. Areas such as direction of arrival estimation leverage the model order to analyze the multipath components of channel state information. In this work, we propose to use a variational autoencoder to group unlabeled channel state information with respect to the model order in the variational autoencoder latent space in an unsupervised manner. We validate our approach with simulated 3GPP channel data. Our results suggest that, in order to learn an appropriate clustering, it is crucial to use a more flexible likelihood model for the variational autoencoder decoder than it is usually the case in standard applications.

eess.SP↗

arXiv2022

Evaluation of a Gaussian Mixture Model-based Channel Estimator using Measurement Data

In this work, we use real-world data in order to evaluate and validate a machine learning (ML)-based algorithm for physical layer functionalities. Specifically, we apply a recently introduced Gaussian mixture model (GMM)-based algorithm in order to estimate uplink channels stemming from a measurement campaign. For this estimator, there is an initial (offline) training phase, where a GMM is fitted onto given channel (training) data. Thereafter, the fitted GMM is used for (online) channel estimation. Our experiments suggest that the GMM estimator learns the intrinsic characteristics of a given base station's whole radio propagation environment. Essentially, this ambient information is captured due to universal approximation properties of the initially fitted GMM. For a large enough number of GMM components, the GMM estimator was shown to approximate the (unknown) mean squared error (MSE)-optimal channel estimator arbitrarily well. In our experiments, the GMM estimator shows significant performance gains compared to approaches that are not able to capture the ambient information. To validate the claim that ambient information is learnt, we generate synthetic channel data using a state-of-the-art channel simulator and train the GMM estimator once on these and once on the real data, and we apply the estimator once to the synthetic and once to the real data. We then observe how providing suitable ambient information in the training phase beneficially impacts the later channel estimation performance.

cs.IT↗

arXiv2022

ExAgt: Expert-guided Augmentation for Representation Learning of Traffic Scenarios

Representation learning in recent years has been addressed with self-supervised learning methods. The input data is augmented into two distorted views and an encoder learns the representations that are invariant to distortions -- cross-view prediction. Augmentation is one of the key components in cross-view self-supervised learning frameworks to learn visual representations. This paper presents ExAgt, a novel method to include expert knowledge for augmenting traffic scenarios, to improve the learnt representations without any human annotation. The expert-guided augmentations are generated in an automated fashion based on the infrastructure, the interactions between the EGO and the traffic participants and an ideal sensor model. The ExAgt method is applied in two state-of-the-art cross-view prediction methods and the representations learnt are tested in downstream tasks like classification and clustering. Results show that the ExAgt method improves representation learning compared to using only standard augmentations and it provides a better representation space stability. The code is available at https://github.com/lab176344/ExAgt.

cs.CV↗

arXiv2022

Expert-LaSTS: Expert-Knowledge Guided Latent Space for Traffic Scenarios

Clustering traffic scenarios and detecting novel scenario types are required for scenario-based testing of autonomous vehicles. These tasks benefit from either good similarity measures or good representations for the traffic scenarios. In this work, an expert-knowledge aided representation learning for traffic scenarios is presented. The latent space so formed is used for successful clustering and novel scenario type detection. Expert-knowledge is used to define objectives that the latent representations of traffic scenarios shall fulfill. It is presented, how the network architecture and loss is designed from these objectives, thereby incorporating expert-knowledge. An automatic mining strategy for traffic scenarios is presented, such that no manual labeling is required. Results show the performance advantage compared to baseline methods. Additionally, extensive analysis of the latent space is performed.

cs.CV↗

arXiv2022

An Asymptotically MSE-Optimal Estimator based on Gaussian Mixture Models

This paper investigates a channel estimator based on Gaussian mixture models (GMMs) in the context of linear inverse problems with additive Gaussian noise. We fit a GMM to given channel samples to obtain an analytic probability density function (PDF) which approximates the true channel PDF. Then, a conditional mean estimator (CME) corresponding to this approximating PDF is computed in closed form and used as an approximation of the optimal CME based on the true channel PDF. This optimal CME cannot be calculated analytically because the true channel PDF is generally unknown. We present mild conditions which allow us to prove the convergence of the GMM-based CME to the optimal CME as the number of GMM components is increased. Additionally, we investigate the estimator's computational complexity and present simplifications based on common model-based insights. Further, we study the estimator's behavior in numerical experiments including multiple-input multiple-output (MIMO) and wideband systems.

eess.SP↗

arXiv2022

Learning Representations for CSI Adaptive Quantization and Feedback

In this work, we propose an efficient method for channel state information (CSI) adaptive quantization and feedback in frequency division duplexing (FDD) systems. Existing works mainly focus on the implementation of autoencoder (AE) neural networks (NNs) for CSI compression, and consider straightforward quantization methods, e.g., uniform quantization, which are generally not optimal. With this strategy, it is hard to achieve a low reconstruction error, especially, when the available number of bits reserved for the latent space quantization is small. To address this issue, we recommend two different methods: one based on a post training quantization and the second one in which the codebook is found during the training of the AE. Both strategies achieve better reconstruction accuracy compared to standard quantization techniques.

eess.SP↗

arXiv2022

GMM-based Codebook Construction and Feedback Encoding in FDD Systems

We propose a precoder codebook construction and feedback encoding scheme which is based on Gaussian mixture models (GMMs). In an offline phase, the base station (BS) first fits a GMM to uplink (UL) training samples. Thereafter, it designs a codebook in an unsupervised manner by exploiting the GMM's clustering capability. We design one codebook entry per GMM component. After offloading the GMM-but not the codebook-to the mobile terminal (MT) in the online phase, the MT utilizes the GMM to determine the best fitting codebook entry. To this end, no channel estimation is necessary at the MT. Instead, the MT's observed signal is used to evaluate how responsible each component of the GMM is for the signal. The feedback consists of the index of the GMM component with the highest responsibility and the BS then employs the corresponding codebook entry. Simulation results show that the proposed codebook design and feedback encoding scheme outperforms conventional Lloyd clustering based codebook design algorithms, especially in configurations with reduced pilot overhead.

cs.IT↗

arXiv2022

ChainNet: Neural Network-Based Successive Spectral Analysis

We discuss a new neural network-based direction of arrival estimation scheme that tackles the estimation task as a multidimensional classification problem. The proposed estimator uses a classification chain with as many stages as the number of sources. Each stage is a multiclass classification network that estimates the position of one of the sources. This approach can be interpreted as the approximation of a successive evaluation of the maximum a posteriori estimator. By means of simulations for fully sampled antenna arrays and systems with subarray sampling, we show that it is able to outperform existing estimation techniques in terms of accuracy, while maintaining a very low computational complexity.

eess.SP↗