Search arXivSearch

arXiv · 1511.05359

Estimation of Timing Offsets and Phase Shifts Between Packet Replicas in MARSALA Random Access

Abstract

Multi-replicA decoding using corRelation baSed LocALisAtion (MARSALA) is a recent random access technique designed for satellite return links. It follows the multiple transmission and interference cancellation scheme of Contention Resolution Diversity Slotted Aloha (CRDSA). In addition, at the receiver side, MARSALA uses autocorrelation to localise replicas of a same packet so as to coherently combine them. Previous work has shown good performance of MARSALA with an assumption of ideal channel state information and perfectly coherent combining of the different replicas of a given packet. However, in a real system, synchronisation errors such as timing offsets and phase shifts between the replicas on separate timeslots will result in less constructive combining of the received signals. This paper describes a method to estimate and compensate the timing and phase differences between the replicas, prior to their combination. Then, the impact of signal misalignment in terms of residual timing offsets and phase shifts, is modeled and evaluated analytically. Finally, the performance of MARSALA in realistic channel conditions is assessed through simulations, and compared to CRDSA in various scenarios.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karine Zidane, Jérome Lacan, Mathieu Gineste, Caroline Bes, Arnaud Deramecourt, Mathieu Dervin. 2016-04-18. Estimation of Timing Offsets and Phase Shifts Between Packet Replicas in MARSALA Random Access. https://arxiv.org/abs/1511.05359

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