arXiv subjects

Martin Schubert

Publications and source records attributed to Martin Schubert.

6 recordsLinked to original sources

arXiv2024

User-Centric Cell-Free Wireless Networks for 6G: Communication Theoretic Models and Research Challenges

This paper presents a comprehensive communication theoretic model for the physical layer of a cell-free user-centric network, formed by user equipments (UEs), radio units (RUs), and decentralized units (DUs), uniformly spatially distributed over a given coverage area. We consider RUs equipped with multiple antennas, and focus on the regime where the UE, RU, and DU densities are constant and therefore the number of such nodes grows with the coverage area. A system is said scalable if the computing load and information rate at any node in the network converges to a constant as the network size (coverage area) grows to infinity. This imposes that each UE must be processed by a (user-centric) finite-size cluster of RUs, and that such cluster processors are dynamically allocated to the DUs (e.g., as software defined virtual network functions) in order to achieve a balanced computation load. We also assume that the RUs are connected to the DUs through a packet switching network, in order to achieve adaptive routing and load balance. For this model, we define in details the dynamic cluster formation and uplink pilot allocation. As a consequence of the pilot allocation and the scalability constraint, each cluster processor has a partial view of the network channel state information. We define the condition of ``ideal partial CSI'' when the channel vectors that can be estimated are perfectly known (while the ones that cannot be estimated are not know at all). We develop two attractive cluster-based linear receiver schemes for the uplink, and an uplink-downlink duality that allows to reuse such vectors as precoders for the downlink.

cs.IT↗

arXiv2022

SurCo: Learning Linear Surrogates For Combinatorial Nonlinear Optimization Problems

Optimization problems with nonlinear cost functions and combinatorial constraints appear in many real-world applications but remain challenging to solve efficiently compared to their linear counterparts. To bridge this gap, we propose $\textbf{SurCo}$ that learns linear $\underline{\text{Sur}}$rogate costs which can be used in existing $\underline{\text{Co}}$mbinatorial solvers to output good solutions to the original nonlinear combinatorial optimization problem. The surrogate costs are learned end-to-end with nonlinear loss by differentiating through the linear surrogate solver, combining the flexibility of gradient-based methods with the structure of linear combinatorial optimization. We propose three $\texttt{SurCo}$ variants: $\texttt{SurCo}-\texttt{zero}$ for individual nonlinear problems, $\texttt{SurCo}-\texttt{prior}$ for problem distributions, and $\texttt{SurCo}-\texttt{hybrid}$ to combine both distribution and problem-specific information. We give theoretical intuition motivating $\texttt{SurCo}$, and evaluate it empirically. Experiments show that $\texttt{SurCo}$ finds better solutions faster than state-of-the-art and domain expert approaches in real-world optimization problems such as embedding table sharding, inverse photonic design, and nonlinear route planning.

cs.LG↗

arXiv2022

Closed-form max-min power control for some cellular and cell-free massive MIMO networks

Many common instances of power control problems for cellular and cell-free massive MIMO networks can be interpreted as max-min utility optimization problems involving affine interference mappings and polyhedral constraints. We show that these problems admit a closed-form solution which depends on the spectral radius of known matrices. In contrast, previous solutions in the literature have been indirectly obtained using iterative algorithms based on the bisection method, or on fixed-point iterations. Furthermore, we also show an asymptotically tight bound for the optimal utility, which in turn provides a simple rule of thumb for evaluating whether the network is operating in the noise or interference limited regime. We finally illustrate our results by focusing on classical max-min fair power control for cell-free massive MIMO networks.

cs.IT↗

arXiv2019

Wurtzite Phonons and the Mobility of a GaN/AlN 2D Hole Gas

To make complementary GaN electronics more than a pipe dream, it is essential to understand the low mobility of 2D hole gases in III-Nitride heterostructures. This work derives both the acoustic and optical phonon spectra present in one of the most prominent p-channel heterostructures (the all-binary GaN/AlN stack) and computes the interactions of these spectra with the 2D hole gas, capturing the temperature dependence of its intrinsic mobility. Finally, the effects of strain on the electronic structure of the confined 2D hole gas are examined and a means is proposed to engineer the strain to improve the 2D hole mobility for enhanced p-channel device performance, with the goal of enabling wide-bandgap CMOS.

cond-mat.mes-hall↗

arXiv2019

Uplink Grant-Free Random Access Solutions for URLLC services in 5G New Radio

The newly introduced ultra-reliable low latency communication service class in 5G New Radio depends on innovative low latency radio resource management solutions that can guarantee high reliability. Grant-free random access, where channel resources are accessed without undergoing assignment through a handshake process, is proposed in 5G New Radio as an important latency reducing solution. However, this comes at an increased likelihood of collisions resulting from uncontrolled channel access, when the same resources are preallocated to a group of users. Novel reliability enhancement techniques are therefore needed. This article provides an overview of grant-free random access in 5G New Radio focusing on the ultra-reliable low latency communication service class, and presents two reliability-enhancing solutions. The first proposes retransmissions over shared resources, whereas the second proposal incorporates grant-free transmission with non-orthogonal multiple access with overlapping transmissions being resolved through the use of advanced receivers. Both proposed solutions result in significant performance gains, in terms of reliability as well as resource efficiency. For example, the proposed non-orthogonal multiple access scheme can support a normalized load of more than 1.5 users/slot at packet loss rates of ~10^{-5} - a significant improvement over the maximum supported load with conventional grant-free schemes like slotted-ALOHA.

cs.NI↗

arXiv2012

An Anderson-localized random nanolaser

Precision is a virtue throughout science in general and in optics in particular where carefully fabricated nanometer-scale devices hold great promise for both classical and quantum photonics [1-6]. In such nanostructures, unavoidable imperfections often impose severe performance limits but, in certain cases, disorder may enable new functionalities [7]. Here we demonstrate on-chip random nanolasers where the cavity feedback is provided by the intrinsic disorder in a semiconductor photonic-crystal waveguide, leading to Anderson localization of light [8]. This enables highly efficient and broadband tunable lasers with very small mode volumes. We observe an intriguing interplay between gain, dispersion-controlled slow light, and disorder, which determines the cross-over from ballistic transport to Anderson localization. Such a behavior is a unique feature of non-conservative random media that enables the demonstration of all-optical control of random lasing. Our statistical analysis shows a way towards ultimate thresholdless random nanolasers.

physics.optics↗