arXiv subjects

Benedikt Böck

Publications and source records attributed to Benedikt Böck.

At least 19 recordsLinked to original sources

arXiv2026

OTFS Channel Estimation Utilizing Sparse Bayesian Generative Modelling

One of the key challenges of future wireless communication systems is ensuring reliability in high-speed mobile scenarios, where accurate recovery of channel state information (CSI) is essential. Many recent studies have concluded that orthogonal time-frequency space (OTFS) modulation is a promising technology for addressing this challenge. Additionally, machine learning (ML)-based methods have the potential to improve channel estimation performance by leveraging ambient information more effectively than classical estimation techniques. This paper particularly addresses channel estimation for OTFS by employing a compressive sensing (CS)-based sparse Bayesian generative model (SBGM), namely the recently introduced compressive sensing Gaussian mixture model (CSGMM). We show that our proposed approach yields significant improvement in normalized mean squared error (NMSE) over the next-best-performing baseline. We additionally provide insights into the theoretical potential of the model to optimally approximate complex channel distributions with arbitrary precision within the Doppler-delay (DD) domain. To summarize, this work establishes the OTFS-CSGMM framework as a promising solution for high mobility wireless channel estimation.

eess.SP↗

arXiv2026

Autoregressive-Gaussian Mixture Models: Efficient Generative Modeling of WSS Signals

This work addresses the challenge of making generative models suitable for resource-constrained environments like mobile wireless communication systems. We propose a generative model that integrates Autoregressive (AR) parameterization into a Gaussian Mixture Model (GMM) for modeling Wide-Sense Stationary (WSS) processes. By exploiting model-based insights allowing for structural constraints, the approach significantly reduces parameters while maintaining high modeling accuracy. Channel estimation experiments show that the model can outperform standard GMMs and variants using Toeplitz or circulant covariances, particularly with small sample sizes. For larger datasets, it matches the performance of conventional methods while improving computational efficiency and reducing the memory requirements.

eess.SP↗

arXiv2025

Wireless Channel Modeling for Machine Learning -- A Critical View on Standardized Channel Models

Standardized (link-level) channel models such as the 3GPP TDL and CDL models are frequently used to evaluate machine learning (ML)-based physical-layer methods. However, in this work, we argue that a link-level perspective incorporates limiting assumptions, causing unwanted distributional shifts or necessitating impractical online training. An additional drawback is that this perspective leads to (near-)Gaussian channel characteristics. Thus, ML-based models, trained on link-level channel data, do not outperform classical approaches for a variety of physical-layer applications. Particularly, we demonstrate the optimality of simple linear methods for channel compression, estimation, and modeling, revealing the unsuitability of link-level channel models for evaluating ML models. On the upside, adopting a scenario-level perspective offers a solution to this problem and unlocks the relative gains enabled by ML.

eess.SP↗

arXiv2025

Precoder Design in Multi-User FDD Systems with VQ-VAE and GNN

Robust precoding is efficiently feasible in frequency division duplex (FDD) systems by incorporating the learnt statistics of the propagation environment through a generative model. We build on previous work that successfully designed site-specific precoders based on a combination of Gaussian mixture models (GMMs) and graph neural networks (GNNs). In this paper, by utilizing a vector quantized-variational autoencoder (VQ-VAE), we circumvent one of the key drawbacks of GMMs, i.e., the number of GMM components scales exponentially to the feedback bits. In addition, the deep learning architecture of the VQ-VAE allows us to jointly train the GNN together with VQ-VAE along with pilot optimization forming an end-to-end (E2E) model, resulting in considerable performance gains in sum rate for multi-user wireless systems. Simulations demonstrate the superiority of the proposed frameworks over the conventional methods involving the sub-discrete Fourier transform (DFT) pilot matrix and iterative precoder algorithms enabling the deployment of systems characterized by fewer pilots or feedback bits.

cs.IT↗

arXiv2025

Physics-Informed Generative Modeling of Wireless Channels

Learning the site-specific distribution of the wireless channel within a particular environment of interest is essential to exploit the full potential of machine learning (ML) for wireless communications and radar applications. Generative modeling offers a promising framework to address this problem. However, existing approaches pose unresolved challenges, including the need for high-quality training data, limited generalizability, and a lack of physical interpretability. To address these issues, we combine the physics-related compressibility of wireless channels with generative modeling, in particular, sparse Bayesian generative modeling (SBGM), to learn the distribution of the underlying physical channel parameters. By leveraging the sparsity-inducing characteristics of SBGM, our methods can learn from compressed observations received by an access point (AP) during default online operation. Moreover, they are physically interpretable and generalize over system configurations without requiring retraining.

eess.SP↗

arXiv2025

On the Asymptotic Mean Square Error Optimality of Diffusion Models

Diffusion models (DMs) as generative priors have recently shown great potential for denoising tasks but lack theoretical understanding with respect to their mean square error (MSE) optimality. This paper proposes a novel denoising strategy inspired by the structure of the MSE-optimal conditional mean estimator (CME). The resulting DM-based denoiser can be conveniently employed using a pre-trained DM, being particularly fast by truncating reverse diffusion steps and not requiring stochastic re-sampling. We present a comprehensive (non-)asymptotic optimality analysis of the proposed diffusion-based denoiser, demonstrating polynomial-time convergence to the CME under mild conditions. Our analysis also derives a novel Lipschitz constant that depends solely on the DM's hyperparameters. Further, we offer a new perspective on DMs, showing that they inherently combine an asymptotically optimal denoiser with a powerful generator, modifiable by switching re-sampling in the reverse process on or off. The theoretical findings are thoroughly validated with experiments based on various benchmark datasets

cs.LG↗

arXiv2025

Sparse Bayesian Generative Modeling for Joint Parameter and Channel Estimation

Leveraging the inherent connection between sensing systems and wireless communications can improve their overall performance and is the core objective of joint communications and sensing. For effective communications, one has to frequently estimate the channel. Sensing, on the other hand, infers properties of the environment mostly based on estimated physical channel parameters, such as directions of arrival or delays. This work presents a low-complexity generative modeling approach that simultaneously estimates the wireless channel and its physical parameters without additional computational overhead. To this end, we leverage a recently proposed physics-informed generative model for wireless channels based on sparse Bayesian generative modeling and exploit the feature of conditionally Gaussian generative models to approximate the conditional mean estimator.

eess.SP↗

arXiv2024

Statistical Precoder Design in Multi-User Systems via Graph Neural Networks and Generative Modeling

This letter proposes a graph neural network (GNN)-based framework for statistical precoder design that leverages model-based insights to compactly represent statistical knowledge, resulting in efficient, lightweight architectures. The framework also supports approximate statistical information in frequency division duplex (FDD) systems obtained through a Gaussian mixture model (GMM)-based limited feedback scheme in massive multiple-input multiple-output (MIMO) systems with low pilot overhead. Simulations using a spatial channel model and measurement data demonstrate the effectiveness of the proposed framework. It outperforms baseline methods, including stochastic iterative algorithms and Discrete Fourier transform (DFT) codebook-based approaches, particularly in low pilot overhead systems.

cs.IT↗

arXiv2024

Decoupling Networks and Super-Quadratic Gains for RIS Systems with Mutual Coupling

We propose decoupling networks for the reconfigurable intelligent surface (RIS) array as a solution to benefit from the mutual coupling between the reflecting elements. In particular, we show that when incorporating these networks, the system model reduces to the same structure as if no mutual coupling is present. Hence, all algorithms and theoretical discussions neglecting mutual coupling can be directly applied when mutual coupling is present by utilizing our proposed decoupling networks. For example, by including decoupling networks, the channel gain maximization in RIS-aided single-input single-output (SISO) systems does not require an iterative algorithm but is given in closed form as opposed to using no decoupling network. In addition, this closed-form solution allows to analytically analyze scenarios under mutual coupling resulting in novel connections to the conventional transmit array gain. In particular, we show that super-quadratic (up to quartic) channel gains w.r.t. the number of RIS elements are possible and, therefore, the system with mutual coupling performs significantly better than the conventional uncoupled system in which only squared gains are possible. We consider diagonal as well as beyond diagonal (BD)-RISs and give various analytical and numerical results, including the inevitable losses at the RIS array. In addition, simulation results validate the superior performance of decoupling networks w.r.t. the channel gain compared to other state-of-the-art methods.

eess.SP↗

arXiv2024

Sparse Bayesian Generative Modeling for Compressive Sensing

This work addresses the fundamental linear inverse problem in compressive sensing (CS) by introducing a new type of regularizing generative prior. Our proposed method utilizes ideas from classical dictionary-based CS and, in particular, sparse Bayesian learning (SBL), to integrate a strong regularization towards sparse solutions. At the same time, by leveraging the notion of conditional Gaussianity, it also incorporates the adaptability from generative models to training data. However, unlike most state-of-the-art generative models, it is able to learn from a few compressed and noisy data samples and requires no optimization algorithm for solving the inverse problem. Additionally, similar to Dirichlet prior networks, our model parameterizes a conjugate prior enabling its application for uncertainty quantification. We support our approach theoretically through the concept of variational inference and validate it empirically using different types of compressible signals.

stat.ML↗

arXiv2024

A Versatile Pilot Design Scheme for FDD Systems Utilizing Gaussian Mixture Models

In this work, we propose a Gaussian mixture model (GMM)-based pilot design scheme for downlink (DL) channel estimation in single- and multi-user multiple-input multiple-output (MIMO) frequency division duplex (FDD) systems. In an initial offline phase, the GMM captures prior information during training, which is then utilized for pilot design. In the single-user case, the GMM is utilized to construct a codebook of pilot matrices and, once shared with the mobile terminal (MT), can be employed to determine a feedback index at the MT. This index selects a pilot matrix from the constructed codebook, eliminating the need for online pilot optimization. We further establish a sum conditional mutual information (CMI)-based pilot optimization framework for multi-user MIMO (MU-MIMO) systems. Based on the established framework, we utilize the GMM for pilot matrix design in MU-MIMO systems. The analytic representation of the GMM enables the adaptation to any signal-to-noise ratio (SNR) level and pilot configuration without re-training. Additionally, an adaption to any number of MTs is facilitated. Extensive simulations demonstrate the superior performance of the proposed pilot design scheme compared to state-of-the-art approaches. The performance gains can be exploited, e.g., to deploy systems with fewer pilots.

cs.IT↗

arXiv2024

A Statistical Characterization of Wireless Channels Conditioned on Side Information

Statistical prior channel knowledge, such as the wide-sense-stationary-uncorrelated-scattering (WSSUS) property, and additional side information both can be used to enhance physical layer applications in wireless communication. Generally, the wireless channel's strongly fluctuating path phases and WSSUS property characterize the channel by a zero mean and Toeplitz-structured covariance matrices in different domains. In this work, we derive a framework to comprehensively categorize side information based on whether it preserves or abandons these statistical features conditioned on the given side information. To accomplish this, we combine insights from a generic channel model with the representation of wireless channels as probabilistic graphs. Additionally, we exemplify several applications, ranging from channel modeling to estimation and clustering, which demonstrate how the proposed framework can practically enhance physical layer methods utilizing machine learning (ML).

eess.SP↗

arXiv2024

Channel-Adaptive Pilot Design for FDD-MIMO Systems Utilizing Gaussian Mixture Models

In this work, we propose to utilize Gaussian mixture models (GMMs) to design pilots for downlink (DL) channel estimation in frequency division duplex (FDD) systems. The GMM captures prior information during training that is leveraged to design a codebook of pilot matrices in an initial offline phase. Once shared with the mobile terminal (MT), the GMM is utilized to determine a feedback index at the MT in the online phase. This index selects a pilot matrix from a codebook, eliminating the need for online pilot optimization. The GMM is further used for DL channel estimation at the MT via observation-dependent linear minimum mean square error (LMMSE) filters, parametrized by the GMM. The analytic representation of the GMM allows adaptation to any signal-to-noise ratio (SNR) level and pilot configuration without re-training. With extensive simulations, we demonstrate the superior performance of the proposed GMM-based pilot scheme compared to state-of-the-art approaches.

eess.SP↗

arXiv2024

Wireless Channel Prediction via Gaussian Mixture Models

In this work, we utilize a Gaussian mixture model (GMM) to capture the underlying probability density function (PDF) of the channel trajectories of moving mobile terminals (MTs) within the coverage area of a base station (BS) in an offline phase. We propose to leverage the same GMM for channel prediction in the online phase. Our proposed approach does not require signal-to-noise ratio (SNR)-specific training and allows for parallelization. Numerical simulations for both synthetic and measured channel data demonstrate the effectiveness of our proposed GMM-based channel predictor compared to state-ofthe-art channel prediction methods.

eess.SP↗

arXiv2024

Variational Autoencoder for Channel Estimation: Real-World Measurement Insights

This work utilizes a variational autoencoder for channel estimation and evaluates it on real-world measurements. The estimator is trained solely on noisy channel observations and parameterizes an approximation to the mean squared error-optimal estimator by learning observation-dependent conditional first and second moments. The proposed estimator significantly outperforms related state-of-the-art estimators on real-world measurements. We investigate the effect of pre-training with synthetic data and find that the proposed estimator exhibits comparable results to the related estimators if trained on synthetic data and evaluated on the measurement data. Furthermore, pre-training on synthetic data also helps to reduce the required measurement training dataset size.

eess.SP↗

arXiv2023

Channel Estimation for Quantized Systems based on Conditionally Gaussian Latent Models

This work introduces a novel class of channel estimators tailored for coarse quantization systems. The proposed estimators are founded on conditionally Gaussian latent generative models, specifically Gaussian mixture models (GMMs), mixture of factor analyzers (MFAs), and variational autoencoders (VAEs). These models effectively learn the unknown channel distribution inherent in radio propagation scenarios, providing valuable prior information. Conditioning on the latent variable of these generative models yields a locally Gaussian channel distribution, thus enabling the application of the well-known Bussgang decomposition. By exploiting the resulting conditional Bussgang decomposition, we derive parameterized linear minimum mean square error (MMSE) estimators for the considered generative latent variable models. In this context, we explore leveraging model-based structural features to reduce memory and complexity overhead associated with the proposed estimators. Furthermore, we devise necessary training adaptations, enabling direct learning of the generative models from quantized pilot observations without requiring ground-truth channel samples during the training phase. Through extensive simulations, we demonstrate the superiority of our introduced estimators over existing state-of-the-art methods for coarsely quantized systems, as evidenced by significant improvements in mean square error (MSE) and achievable rate metrics.

eess.SP↗

arXiv2023

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↗

arXiv2023

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↗