Search arXivSearch

arXiv · 2110.06661

A Primer on Near-Field Beamforming for Arrays and Reconfigurable Intelligent Surfaces

Abstract

Wireless communication systems have almost exclusively operated in the far-field of antennas and antenna arrays, which is conventionally characterized by having propagation distances beyond the Fraunhofer distance. This is natural since the Fraunhofer distance is normally only a few wavelengths. With the advent of active arrays and passive reconfigurable intelligent surfaces (RIS) that are physically large, it is plausible that the transmitter or receiver is located in between the Fraunhofer distance of the individual array/surface elements and the Fraunhofer distance of the entire array. An RIS then can be configured to reflect the incident waveform towards a point in the radiative near-field of the surface, resulting in a beam with finite depth, or as a conventional angular beam with infinity focus, which only results in amplification in the far-field. To understand when these different options are viable, an accurate characterization of the near-field behaviors is necessary. In this paper, we revisit the motivation and approximations behind the Fraunhofer distance and show that it is not the right metric for determining when near-field focusing is possible. We obtain the distance range where finite-depth beamforming is possible and the distance where the beamforming gain tapers off.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emil Björnson, Özlem Tugfe Demir, Luca Sanguinetti. 2021-12-08. A Primer on Near-Field Beamforming for Arrays and Reconfigurable Intelligent Surfaces. https://arxiv.org/abs/2110.06661

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

KEEP EXPLORING

Related papers

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

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

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