FGFabian Göttsch

Fabian Göttsch

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fabian Göttsch has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers

    Toward Standardizing OTFS: A Candidate Waveform for Next-Generation Wireless Networks

    by Mingcheng Nie, Ruoxi Chong, Shuangyang Li, Arman Farhang, Fabian Göttsch, Derrick Wing Kwan Ng, Michail Matthaiou, Yonghui Li

    The standardization of the sixth-generation (6G) has recently commenced to address the rapidly growing demands for enhanced wireless network services. Nevertheless, existing wireless systems, particularly at the physical layer waveform level, remain inadequate for achieving the ambitious key performance indicators (KPIs) envisioned for 6G. Specifically, orthogonal frequency division multiplexing (OFDM), the widely adopted waveform in fifth-generation new radio (5G-NR) networks, suffers from inherent limitations in satisfying these stringent requirements. In practice, OFDM can experience severe inter-carrier interference (ICI), resulting in a pronounced data rate error floor caused by high Doppler shifts. Additionally, the repetitive usage of cyclic prefixes (CPs), intended to combat multipath delays, results in significant spectral inefficiency. These fundamental drawbacks pose critical obstacles to fulfilling 6G performance objectives. Orthogonal time frequency space (OTFS) modulation has recently emerged as a promising waveform candidate, addressing the aforementioned challenges by exploiting the unique characteristics of the delay-Doppler (DD) domain channel. Unlike OFDM, OTFS is inherently resilient to channel distortions induced by delay and Doppler effects, while remaining sensitive to time and frequency shifts. Such intrinsic properties are instrumental in enabling OTFS, with joint communication and sensing capabilities, to embrace, rather than combat, dynamic channel conditions. Motivated by these compelling advantages, this article investigates the feasibility and practical implementation of OTFS modulation leveraging the current OFDM-based wireless systems. Furthermore, we present a practical precoding scheme for OTFS-based multiple-input multiple-output (MIMO) systems, characterized by near-linear computational complexity and compared with conventional OFDM-based MIMO systems. We also highlight the advantages of the DD waveform for integrated sensing and communications (ISAC). Through these explorations, we reveal that the DD waveform has substantial potential to achieve scalable, efficient, and robust wireless communication and sensing capabilities, positioning it as a critical technology for future 6G networks.


  • Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell-Free User-Centric Massive MIMO Networks

    by Zhiyang Li, Fabian Göttsch, Siyao Li, Ming Chen, Giuseppe Caire

    We consider scalable cell-free massive multiple-input multiple-output networks under an open radio access network paradigm comprising user equipments (UEs), radio units (RUs), and decentralized processing units (DUs). UEs are served by dynamically allocated user-centric clusters of RUs. The corresponding cluster processors (implementing the physical layer for each user) are hosted by the DUs as software-defined virtual network functions . Unlike the current literature, mainly focused on the characterization of the user rates under unrestricted fronthaul communication and computation, in this work we explicitly take into account the fronthaul topology, the limited fronthaul communication capacity, and computation constraints at the DUs. In particular, we systematically address the new problem of joint fronthaul load balancing and allocation of the computation resource. As a consequence of our new optimization framework, we present representative numerical results high-lighting the existence of an optimal number of quantization bits in the analog-to-digital conversion at the RUs.


  • Fairness Scheduling in User-Centric Cell-Free Massive MIMO Wireless Networks

    by Fabian Göttsch, Noboru Osawa, Issei Kanno, Takeo Ohseki, Giuseppe Caire

    We consider a user-centric cell-free massive MIMO wireless network with L remote radio units, each with M antennas, serving K single-antenna user devices (UEs). Most of the current literature considers the regime LM ≫ K , where the K UEs are active on each time-frequency slot, and evaluates the system performance in terms of ergodic rates . In this paper, we take a quite different viewpoint. We observe that the regime of LM ≫ K corresponds to a lightly loaded system with low sum spectral efficiency (SE). In contrast, in most relevant scenarios, the number of UEs is much larger than the total number of antennas (think of a sport event with K ~ 10, 000 users and ML ~ 200 antennas). To achieve high sum SE and handle K ≫ ML , users must be scheduled over the time-frequency resource. The number of active users K act ⩽ K must be carefully chosen such that: 1) the network operates close to its maximum SE; 2) the active user set must be chosen dynamically over time in order to enforce fairness in terms of per-user time-averaged throughput rates . The fairness scheduling problem is canonically formulated as the maximization of a suitable concave componentwise non-decreasing network utility function of the per-user rates. The intermitted user transmission due to scheduling imposes slot-by-slot coding/decoding, which in turn prevents the achievability of ergodic rates. Hence, we model the per-slot service rates using information outage probability. In order to obtain a tractable problem, we make a “decoupling” assumption on the CDF of the instantaneous mutual information seen at each UE k receiver. We approximately enforce this condition by introducing a conflict graph that prevents the simultaneous scheduling of users with large pilot contamination conflict and propose an adaptive scheme for instantaneous service rate scheduling based on locally estimating the mutual information CDF at each UE. Overall, the proposed dynamic scheduling is the first to address such system dimensions with tens of thousand users in a scalable way, is robust to system model uncertainties, and can be easily implemented in practice.


  • Subspace-Based Pilot Decontamination in User-Centric Scalable Cell-Free Wireless Networks

    by Fabian Göttsch, Noboru Osawa, Takeo Ohseki, Kosuke Yamazaki, Giuseppe Caire

    We consider a cell-free wireless system operated in Time Division Duplex (TDD) mode with user-centric clusters of remote radio units (RUs). Since the uplink pilot dimensions per channel coherence slot is limited, co-pilot users might incur mutual pilot contamination. In the current literature, it is assumed that the long-term statistical knowledge of all user channels is available. This enables Minimum Mean-Square Error channel estimation or simplified dominant subspace projection, which achieves significant pilot decontamination under certain assumptions on the channel covariance matrices. However, estimating the channel covariance matrix or even just its dominant subspace at all RUs forming a user cluster is not an easy task. In fact, if not properly designed, a piloting scheme for such long-term statistics estimation will also be subject to the contamination problem. In this paper, we propose a new channel subspace estimation scheme explicitly designed for cell-free wireless networks. Our scheme is based on 1) a sounding reference signal (SRS) using latin squares wideband frequency hopping, and 2) a subspace estimation method based on robust Principal Component Analysis (R-PCA). The SRS hopping scheme ensures that for any user and any RU participating in its cluster, only a few pilot measurements will contain strong co-pilot interference. These few heavily contaminated measurements are (implicitly) eliminated by R-PCA, which is designed to regularize the estimation and discount the “outlier” measurements. Our simulation results show that the proposed scheme achieves almost perfect subspace knowledge, which in turns yields system performance very close to that with ideal channel state information, thus essentially solving the problem of pilot contamination in cell-free user-centric TDD wireless networks.