Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.09029

Sub-Terahertz Wireless Coverage Analysis at 142 GHz in Urban Microcell

Yunchou Xing·Ojas Kanhere·Shihao Ju·Theodore S. Rappaport
View original source ↗Read source document ↗Export metadata ↓

Abstract

Small-cell cellular base stations are going to be used for mmWave and sub-THz communication systems to provide multi-Gbps data rates and reliable coverage to mobile users. This paper analyzes the base station coverage of sub-THz communication systems and the system performance in terms of spectral efficiency through Monte Carlo simulations for both single-cell and multi-cell cases. The simulations are based on realistic channel models derived from outdoor field measurements at 142 GHz in urban microcell (UMi) environments conducted in downtown Brooklyn, New York. The single-cell base station can provide a downlink coverage area with a radius of 200 m and the 7-cell system can provide a downlink coverage area with a radius of 400 m at 142 GHz. Using a 1 GHz downlink bandwidth and 100 MHz uplink bandwidth, the 7-cell system can provide about 4.5 Gbps downlink average data rate and 410 Mbps uplink average data rate at 142 GHz.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunchou Xing, Ojas Kanhere, Shihao Ju, Theodore S. Rappaport. 2022-03-17. Sub-Terahertz Wireless Coverage Analysis at 142 GHz in Urban Microcell. https://arxiv.org/abs/2203.09029

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↗