209 results
Filters
Settings
Now showing1 - 10 of 209
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Aging-robust precoding in near-field cell-free massive MIMO with mobile multi-antenna usersWe propose a channel-aging-robust precoding scheme for multi-antenna users in a cell-free massive multiple-input multiple-output (MIMO) system operating at mmWave frequencies under line-of-sight (LoS) propagation. The proposed approach leverages instantaneous channel state information (CSI) at the receiver to compensate for outdated CSI at the transmitter, which arises due to user mobility and fronthaul latency in centralized architectures. To motivate the design, we analyze the spatial structure of the resulting near-field beampatterns formed by cooperating access points (APs) and show that their inherent periodicity can be exploited to obtain systematic spatial diversity gains at the multi-antenna users. We investigate the impact of user mobility on the downlink spectral efficiency and demonstrate that multi-antenna users can partially mitigate channel aging effects, particularly for small serving clusters. Numerical results reveal that the proposed approach reduces sensitivity to latency constraints and enables significant performance gains compared to a small-cell system under channel aging, reaching more than four times the 90%-likely per-user spectral efficiency in highly populated scenarios.Publicationtype: Conference Paper - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Mixed block markov superposition transmission codes(2026-06-15); ; ; Block Markov superposition transmission (BMST) codes provide a flexible framework for constructing codes with near-capacity performance and low-complexity sliding-window decoding. However, existing BMST variants show contrasting performance limitations: recursive BMST (rBMST) codes suffer from error propagation but avoid high error floors, whereas non-recursive BMST codes exhibit the opposite behavior. Motivated by these complementary characteristics, we combine recursive and non-recursive components through parallel and serial concatenation, yielding mixed BMST (mBMST) codes. The proposed framework subsumes existing BMST variants and enables new BMST structures. Simulations show that these structures improve FER and BER performance with lower memory requirements than rBMST.Publicationtype: Preprint68 30 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , 6G sub-networks: from use cases and requirements to concept and architectureThe 6th generation of wireless mobile networks (6G) is envisioned to extend the capabilities of cellular communication networks into new dimensions, such as sensing, integration of artificial intelligence, and integration of other networking technologies. In addition, 6G is often described as the generation that will be the “Network of Networks” (NoN). One of the NoN building blocks is provisioning of local connectivity by so called 6G Sub-networks (SNs). Despite the fact that the term “Sub-networks for 6G” is already widely used, it still lacks a clear technical definition. This article aims to address this gap by providing contextualization and a description of the concept from various relevant perspectives such as legacy, autonomy, and topology. Moreover, a concept for an architecture is proposed, including Sub-networks, their interaction with associated user equipment, other Sub-networks and “Parent Networks” (PNs). These concepts are then mapped to a variety of use cases from relevant vertical domains, like vehicular Sub-networks, Sub-networks for collaborative and autonomous robots in factories, remote operation of aircrafts, airplane onboard systems and emergency services. Finally, a comparison of the described Sub-network concept with existing approaches in 3rd Generation Partnership Project (3GPP) is provided, stating similarities, differences, and future requirements for standardization.Publicationtype: Journal Article63 36 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Fast window decoding of BMST codes via step adjustment and universal parity-Check terminationBlock Markov Superposition Transmission (BMST) codes are a class of spatially coupled codes, that achieve excellent error correction performance via superposition of simple constituent codes. A BMST encoder consists of an outer basic code and an inner rate-one block-convolutional shift register. The resulting graph representation of the encoder allows slidingwindow decoding, similarly to spatially coupled Low-Density Parity-Check codes. This paper proposes a method to reduce the decoding complexity by adjusting the step size of the sliding window. Furthermore, a low-complexity parity-check-based early termination criterion is introduced, which can be universally applied to recursive BMST structures.Publicationtype: Conference Paper97 45 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Hybrid receive combining for scalable cell-free massive MIMO with multiple CPUs and latency-constrained midhaul linksWe propose a new way of operating a cell-free massive multiple-input multiple-output (MIMO) system with multiple central processing units (CPUs). In scalable cell-free massive MIMO systems, each user equipment (UE) is served by a cluster of access points (APs). The required coordination of the APs is often modeled to be done at a single cloud CPU, but in practice this cloud CPU consists of many physical entities which can be distributed over a large geographical area. Contrary to other works, in this work we explicitly model the cloud CPU as multiple physical CPUs, where each AP is connected to one of these CPUs via a low-latency fronthaul link. The CPUs are connected via midhaul links which may have a much higher latency. Hence, extensive cooperation between APs connected to the same CPU is possible while cooperation between APs connected to different CPUs is limited. We outline a joint initial access, pilot assignment, and clustering procedure in such a network. Further, we propose a new hybrid receive combining approach that takes advantage of this structure and allows for a scalable implementation of the system. We compare the performance of our proposed hybrid cell-free system with multiple CPUs to both the idealized centralized cloud CPU version and to the fully distributed cell-free system. Our results show that the proposed system can achieve a performance close to the idealized cloud CPU system while being practically feasible. Furthermore, our hybrid approach substantially outperforms a cellular Distributed Antenna System (DAS) with no CPU cooperation.Publicationtype: Conference Paper108 82 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Wideband channel modeling for wireless avionics intra-communications(IEEE, 2025-07); ; ; Wireless Avionics Intra-Communications (WAIC) has been proposed to partially replace costly wiring in future generations of aircraft. Besides the allocation of a frequency range and several performance figures, there is no standardized transmission scheme so far. For the design of suitable physical layer techniques, comprehensive models are required to perform realistic link-level simulations for the aircraft environment. This paper presents a wideband channel model for in-cabin WAIC systems, derived from channel measurements performed in an Airbus A321 cabin. The model is validated by comparing experimentally measured and simulated frame error rates using the proposed model in an IEEE 802.11a-based OFDM transmission.Publicationtype: Conference Paper51 37 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , 21 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Collaborative relative positioning in underwater environments using acoustic communication and two-way ranging(2025-03); ; 31 18 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Region-Specific Coarse Quantization with Check Node Awareness in 5G-LDPC
Decoding(2025-02-11); This paper presents novel techniques for improving the error correction performance and reducing the complexity of coarsely quantized 5G LDPC decoders. The proposed decoder design supports arbitrary message-passing schedules on a base-matrix level by modeling exchanged messages with entry-specific discrete random variables. Variable nodes (VNs) and check nodes (CNs) involve compression operations designed using the information bottleneck method to maximize preserved mutual information between code bits and quantized messages. We introduce alignment regions that assign the messages to groups with aligned reliability levels to decrease the number of individual design parameters. Group compositions with degree-specific separation of messages improve performance by up to 0.4 dB. Further, we generalize our recently proposed CN-aware quantizer design to irregular LDPC codes and layered schedules. The method optimizes the VN quantizer to maximize preserved mutual information at the output of the subsequent CN update, enhancing performance by up to 0.2 dB. A schedule optimization modifies the order of layer updates, reducing the average iteration count by up to 35 %. We integrate all new techniques in a rate-compatible decoder design by extending the alignment regions along a rate-dimension. Our complexity analysis shows that 2-bit decoding can double the area efficiency over 4-bit decoding at comparable performance.Publicationtype: Journal Article57 151 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Memory-Assisted Quantized LDPC DecodingWe enhance coarsely quantized LDPC decoding by reusing computed check node messages from previous iterations. Typically, variable and check nodes update and replace old messages every iteration. We show that, under coarse quantization, discarding old messages entails a significant loss of mutual information. The loss is avoided with additional memory, improving performance by up to 0.23 dB. We optimize quantization with a modified information bottleneck algorithm that considers the statistics of old messages. A simple merge operation reduces memory requirements. Depending on channel conditions and code rate, memory assistance enables up to 32% better area efficiency for 2-bit decoding.Publicationtype: Journal Article86 48