Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.07867

Analysis on 60 GHz Wireless Communications with Beamwidth-Dependent Misalignment

Guang Yang·Jinfeng Du·Ming Xiao
View original source ↗Read source document ↗Export metadata ↓

Abstract

High speed wireless access on 60 GHz spectrum relies on high-gain directional antennas to overcome the severe signal attenuation. However, perfect alignment between transmitting and receiving antenna beams is rare in practice and overheard signals from concurrent transmissions may cause significant interference. In this paper we analyze the impact of antenna beam misalignment on the system performance of 60 GHz wireless access. We quantify the signal power loss caused by beam misalignment and the interference power accumulated from neighboring concurrent transmissions whose signals are leaked either via the main-beam pointing in the similar direction or via side-lobe emission, and derive the probability distribution of the signal to interference plus noise power ratio (SINR). For scenarios where interfering transmitters are distributed uniformly at random, we derive upper and lower bounds on the cumulative distribution function (abbreviated as CDF or c.d.f.) of SINR, which can be easily applied to evaluate system performance. We validate our analytical results by simulations where random nodes are uniformly distributed within a circular hall, and evaluate the sensitivity of average throughput and outage probability against two parameters: the half-power (3 dB) beamwidth to main-lobe beamwidth ratio and the beam misalignment deviation to main-lobe beamwidth ratio. Our results indicate that the derived lower bound performs well when the half-power beamwidth to main-lobe beamwidth ratio or the number of concurrent transmission links is small. When the number of active links is high, it is desirable in antenna design to balance the degradation caused by beam misalignment (wider beam is better) and the interference from concurrent transmission (narrower beam is better).

Explore related subjects

cs.ITcs.PFmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guang Yang, Jinfeng Du, Ming Xiao. 2016-11-23. Analysis on 60 GHz Wireless Communications with Beamwidth-Dependent Misalignment. https://arxiv.org/abs/1611.07867

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↗