Search arXivSearch

arXiv · 2106.04829

Temporal Averaging LSTM-based Channel Estimation Scheme for IEEE 802.11p Standard

Abstract

In vehicular communications, reliable channel estimation is critical for the system performance due to the doubly-dispersive nature of vehicular channels. IEEE 802.11p standard allocates insufficient pilots for accurate channel tracking. Consequently, conventional IEEE 802.11p estimators suffer from a considerable performance degradation, especially in high mobility scenarios. Recently, deep learning (DL) techniques have been employed for IEEE 802.11p channel estimation. Nevertheless, these methods suffer either from performance degradation in very high mobility scenarios or from large computational complexity. In this paper, these limitations are solved using a long short term memory (LSTM)-based estimation. The proposed estimator employs an LSTM unit to estimate the channel, followed by temporal averaging (TA) processing as a noise alleviation technique. Moreover, the noise mitigation ratio is determined analytically, thus validating the TA processing ability in improving the overall performance. Simulation results reveal the performance superiority of the proposed schemes compared to recently proposed DL-based estimators, while recording a significant reduction in the computational complexity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abdul Karim Gizzini, Marwa Chafii, Shahab Ehsanfar, Raed M. Shubair. 2022-01-17. Temporal Averaging LSTM-based Channel Estimation Scheme for IEEE 802.11p Standard. https://arxiv.org/abs/2106.04829

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