Search arXivSearch

arXiv · 2204.05931

Experimental Validation of Time Reversal Multiple Access for UWB Wireless Communications Centered at the $273$ GHz Frequency

Abstract

Ultra-high data rates with low-power consumption wireless communications and low-complexity receivers is one of the key requirements for the next 6-th Generation (6G) of communication networks. Sub-Terahertz (SubTHz) frequency bands can support Ultra-WideBand (UWB) communications and can thus offer unprecedented increase in the wireless network capacity, rendering those bands and relevant research a strong candidate technology for 6G. However, in contrast to millimeter-wave communications, the technological advances in subTHz transceivers are not yet completely mature. In this paper, we focus on the Time Reversal (TR) precoding scheme, which is a computationally simple and robust technique capable of focusing UWB waveforms on both time and space, by exploiting channel diversity when available. We design a novel experimental setup, including a THz link inside a waveguide and operating at the carrier frequency 273.6 GHz with 2 GHz transmission bandwidth, and deploy it to perform multi-user communications with simple modulation. Our results demonstrate large communication rates with only 3 mm space separation of the receiving antennas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mokh, Julien de Rosny, George C. Alexandropoulos, Mohamed Kamoun, Abdelwaheb Ourir, Ramin Khayatzadeh, Arnaud Tourin, Mathias Fink. 2022-04-12. Experimental Validation of Time Reversal Multiple Access for UWB Wireless Communications Centered at the $273$ GHz Frequency. https://arxiv.org/abs/2204.05931

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