Searcharxiv⌕ Search

arXiv subjects

Stefan Wesemann

Publications and source records attributed to Stefan Wesemann.

8 recordsLinked to original sources
arXiv2023

Energy Efficient Extreme MIMO: Design Goals and Directions

Ever since the invention of Bell Laboratories Layer Space-Time (BLAST) in mid 1990s, the focus of MIMO research and development has been largely on pushing the limit of spectral efficiency. While massive MIMO technologies laid the foundation of high spectrum efficiency in 5G and beyond, the challenge remains in improving energy efficiency given the increasing complexity of the associated radio systems. With the substantial negative implications of climate change looming ever closer, minimizing energy use is a key dimension of achieving sustainability and is of paramount importance for any future technology. Thus, every aspect of future extreme MIMO system design, implementation, and operation will be scrutinized to maximize energy efficiency. An analysis of the massive MIMO 5G radio energy consumption at different loads leads to qualitative energy efficiency design goals for emerging extreme MIMO systems. Following this, we focus on novel operational and component technology innovations to minimize energy consumption.

eess.SP↗
arXiv2023

Minimizing Energy Consumption in MU-MIMO via Antenna Muting by Neural Networks with Asymmetric Loss

Transmit antenna muting (TAM) in multiple-user multiple-input multiple-output (MU-MIMO) networks allows reducing the power consumption of the base station (BS) by properly utilizing only a subset of antennas in the BS. In this paper, we consider the downlink transmission of an MU-MIMO network where TAM is formulated to minimize the number of active antennas in the BS while guaranteeing the per-user throughput requirements. To address the computational complexity of the combinatorial optimization problem, we propose an algorithm called neural antenna muting (NAM) with an asymmetric custom loss function. NAM is a classification neural network trained in a supervised manner. The classification error in this scheme leads to either sub-optimal energy consumption or lower quality of service (QoS) for the communication link. We control the classification error probability distribution by designing an asymmetric loss function such that the erroneous classification outputs are more likely to result in fulfilling the QoS requirements. Furthermore, we present three heuristic algorithms and compare them with the NAM. Using a 3GPP compliant system-level simulator, we show that NAM achieves $\sim73\%$ energy saving compared to the full antenna configuration in the BS with $\sim95\%$ reliability in achieving the user throughput requirements while being around $1000\times$ and $24\times$ less computationally intensive than the greedy heuristic algorithm and the fixed column antenna muting algorithm, respectively.

eess.SP↗
arXiv2022

Design of an Efficient CSI Feedback Mechanism in Massive MIMO Systems: A Machine Learning Approach using Empirical Data

Massive multiple-input multiple-output (mMIMO) regime reaps the benefits of spatial diversity and multiplexing gains, subject to precise channel state information (CSI) acquisition. In the current communication architecture, the downlink CSI is estimated by the user equipment (UE) via dedicated pilots and then fed back to the gNodeB (gNB). The feedback information is compressed with the goal of reducing over-the-air overhead. This compression increases the inaccuracy of acquired CSI, thus degrading the overall spectral efficiency. This paper proposes a computationally inexpensive machine learning (ML)-based CSI feedback algorithm, which exploits twin channel predictors. The proposed approach can work for both time-division duplex (TDD) and frequency-division duplex (FDD) systems, and it allows to reduce feedback overhead and improves the acquired CSI accuracy. To observe real benefits, we demonstrate the performance of the proposed approach using the empirical data recorded at the Nokia campus in Stuttgart, Germany. Numerical results show the effectiveness of the proposed approach in terms of reducing overhead, minimizing quantization errors, increasing spectral efficiency, cosine similarity, and precoding gain compared to the traditional CSI feedback mechanism.

cs.IT↗
arXiv2020

Turbo-AI: Iterative Machine Learning Based Channel Estimation for 2D Massive Arrays

Recently, Machine Learning (ML) is recognized as an effective tool for wireless communications and plays an evolutionary role to enhance Physical Layer (PHY) of 5th Generation (5G) and Beyond 5G (B5G) systems. In this paper, we focus on the ML-based channel estimation for 2- Dimensional (2D) massive antenna arrays. Due to the extremely high computational requirement for 2D arrays with Ordinary Training, we exploit 2D Kronecker covariance model to perform Subspace Training for vertical and horizontal spatial domain independently, which achieves a complexity cost saving factor $O(M^4N^4)/O(MN^4 + NM^4)$ for ML with an $M \times N$ 2D array. Furthermore, we propose an iterative training approach, referred to as Turbo-AI. Along with Subspace Training, the new approach can monotonically reduce the effective variance of additive noise of the observation, and update the Neural Network (NN) models by re-training. Furthermore, we propose a concept, named Universal Training. It allows to use one NN for a wide range of Signal-to-Noise-Ratio (SNR) operation points and spatial angles, which can greatly simplify Turbo-AI usage. Numerical results exhibit that Turbo-AI can tightly approach the genie-aided channel estimation bound, especially at low SNR.

eess.SP↗
arXiv2018

Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ

A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is compared to three existing algorithms in terms of information rates and complexity: quantized linear precoding (QLP), SQUID, and an ADMM-based algorithm. The information rate is measured by using a lower bound for finite modulation sets, and the complexity is measured by the number of multiplications and comparisons. MAGIQ and ADMM achieve similar information rates with similar complexity for Rayleigh flat-fading channels and one-bit quantization per real dimension, and they outperform QLP and SQUID for higher order modulation.

cs.IT↗
arXiv2017

Channel Training for Analog FDD Repeaters: Optimal Estimators and Cramér-Rao Bounds

For frequency division duplex channels, a simple pilot loop-back procedure has been proposed that allows the estimation of the UL & DL channels at an antenna array without relying on any digital signal processing at the terminal side. For this scheme, we derive the maximum likelihood (ML) estimators for the UL & DL channel subspaces, formulate the corresponding Cramér-Rao bounds and show the asymptotic efficiency of both (SVD-based) estimators by means of Monte Carlo simulations. In addition, we illustrate how to compute the underlying (rank-1) SVD with quadratic time complexity by employing the power iteration method. To enable power control for the data transmission, knowledge of the channel gains is needed. Assuming that the UL & DL channels have on average the same gain, we formulate the ML estimator for the channel norm, and illustrate its robustness against strong noise by means of simulations.

cs.IT↗
arXiv2014

Distributed Asynchronous Optimization Framework for the MISO Interference Channel

We study the distributed optimization of transmit strategies in a multiple-input, single-output (MISO) interference channel (IFC). Existing distributed algorithms rely on stricly synchronized update steps by the individual users. They require a global synchronization mechanism and potentially suffer from the synchronization penalty caused by e.g., backhaul communication delays and fixed update sequences. We establish a general optimization framework that allows asynchronous update steps. The users perform their computations at arbitrary instants of time, and do not wait for information that has been sent to them. Based on certain bounds on the amount of asynchronism that is present in the execution of the algorithm, we are able to characterize its convergence. As illustrated by our numerical results, the proposed algorithm can alleviate communication overloads and is not excessively slowed down by neither communication delays, nor by differences in the computation intervals.

cs.IT↗