Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1005.2731

Cross-Band Interference Considered Harmful in OFDM Based Distributed Spectrum Sharing

Wei Hou·Lin Zhang·Lei Yang·Heather Zheng·Xiuming Shan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the past few years we have witnessed the paradigm shift from static spectrum allocation to dynamic spectrum access/sharing. Orthogonal Frequency-Division Multiple Access (OFDMA) is a promising mechanism to implement the agile spectrum access. However, in wireless distributed networks where tight synchronization is infeasible, OFDMA faces the problem of cross-band interference. Subcarriers used by different users are no longer orthogonal, and transmissions operating on non-overlapping subcarriers can interfere with each other. In this paper, we explore the cause of cross-band interference and analytically quantify its strength and impact on packet transmissions. Our analysis captures three key practical artifacts: inter-link frequency offset, temporal sampling mismatch and power heterogeneity. To our best knowledge, this work is the first to systematically analyze the cause and impact of cross-band interference. Using insights from our analysis, we then build and compared three mitigating methods to combat cross-band interference. Analytical and simulation results show that placing frequency guardband at link boundaries is the most effective solution in distributed spectrum sharing, while the other two frequency-domain methods are sensitive to either temporal sampling mismatch or inter-link frequency offset. We find that the proper guardband size depends heavily on power heterogeneity. Consequently, protocol designs for dynamic spectrum access should carefully take into account the cross-band interference when configuring spectrum usage.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wei Hou, Lin Zhang, Lei Yang, Heather Zheng, Xiuming Shan. 2010-05-16. Cross-Band Interference Considered Harmful in OFDM Based Distributed Spectrum Sharing. https://arxiv.org/abs/1005.2731

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↗