Search arXivSearch

arXiv · 1401.2220

Analog Network Coding for Multi-User Spread-Spectrum Communication Systems

Abstract

This work presents another look at an analog network coding scheme for multi-user spread-spectrum communication systems. Our proposed system combines coding and cooperation between a relay and users to boost the throughput and to exploit interference. To this end, each pair of users, $\mathcal{A}$ and $\mathcal{B}$, that communicate with each other via a relay $\mathcal{R}$ shares the same spreading code. The relay has two roles, it synchronizes network transmissions and it broadcasts the combined signals received from users. From user $\mathcal{B}$'s point of view, the signal is decoded, and then, the data transmitted by user $\mathcal{A}$ is recovered by subtracting user $\mathcal{B}$'s own data. We derive the analytical performance of this system for an additive white Gaussian noise channel with the presence of multi-user interference, and we confirm its accuracy by simulation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Georges Kaddoum, Pascal Giard. 2014-01-10. Analog Network Coding for Multi-User Spread-Spectrum Communication Systems. https://doi.org/10.1109/wcnc.2014.6952033

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