Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.14598

Distance-Aware Precoding for Near-Field Capacity Improvement

Zidong Wu·Mingyao Cui·Zijian Zhang·Linglong Dai
View original source ↗Read source document ↗Export metadata ↓

Abstract

Extremely large-scale MIMO (XL-MIMO) is a promising technology to improve the capacity for future 6G networks. With a very large number of antennas, the near-field property of XL-MIMO systems becomes dominant. Unlike the classical far-field line-of-sight (LoS) channel with only one available data stream, the significantly increased degrees of freedom (DoFs) are available in the near-field LoS channel. However, limited by the small number of radio frequency (RF) chains, the existing hybrid precoding architecture widely used for 5G is not able to fully exploit the extra DoFs in the near-field region. In this paper, the available DoFs and the capacity of the near-field LoS channel are theoretically analyzed at first. Then, to exploit the near-field effect as a new possibility for capacity improvement, the distance-aware precoding (DAP) scheme is proposed. We develop the DAP architecture, where a dedicated selection circuit is inserted to connect phase shifters and RF chains. Moreover, each RF chain can be flexibly configured to active or inactive according to the distance-related DoFs in the proposed DAP architecture. Based on the developed DAP architecture, a DAP algorithm is proposed to optimize the number of activated RF chains and precoding matrices to match the increased DoFs in the near-field region. Finally, simulation results verify that, the proposed DAP scheme can efficiently utilize the extra DoFs in the near-field region to improve the spectrum efficiency and the energy efficiency as well.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zidong Wu, Mingyao Cui, Zijian Zhang, Linglong Dai. 2022-03-29. Distance-Aware Precoding for Near-Field Capacity Improvement. https://arxiv.org/abs/2112.14598

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗