Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1211.4445

Efficient Spectrum Sharing in the Presence of Multiple Narrowband Interference

Demosthenes Vouyioukas
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the spectrum usage efficiency by applying wideband methods and systems to the existing analog systems and applications. The essential motivation of this work is to define the prospective coexistence between analog FM and digital Spread Spectrum systems in an efficient way sharing the same frequency band. The potential overlaid Spread Spectrum (SS) system can spectrally coincide within the existing narrowband Frequency Modulated (FM) broadcasting system upon several limitations, originating a key motivation for the use of the FM radio frequency band in many applications, encompassing wireless personal and sensors networks. The performance of the SS system due to the overlaying analog FM system, consisting of multiple narrowband FM stations, is investigated in order to derive the relevant bit error probability and maximum achievable data rates. The SS system uses direct sequence (DS) spreading, through maximal length pseudorandom sequences with long spreading codes. The SS signal is evaluated throughout theoretical and simulation-based performance analysis, for various types of spreading scenarios, for different carrier frequency offset (Δf) and signal-to-interference ratios, in order to derive valuable results for future developing and planning of an overlay scenario.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Demosthenes Vouyioukas. 2012-11-19. Efficient Spectrum Sharing in the Presence of Multiple Narrowband Interference. https://doi.org/10.5121/ijwmn.2012.4505

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↗