Search arXivSearch

arXiv · 2010.00101

Channel Estimation for Reconfigurable Intelligent Surface-Assisted Wireless Communications Considering Doppler Effect

Abstract

In wireless systems aided by reconfigurable intelligent surfaces (RISs), channel state information plays a pivotal role in achieving the performance gain of RISs. Mobility renders accurate channel estimation (CE) more challenging due to the Doppler effect. In this letter, we propose two practical wideband CE schemes incorporating Doppler shift adjustment (DSA) for multi-path and single-path propagation environments, respectively, for RIS-assisted communication with passive reflecting elements. For the multi-path scenario, ordinary CE is first executed assuming quasi-static channels, followed by DSA realized via joint RIS reflection pattern selection and transformations between frequency and time domains. The proposed CE necessitates only one more symbol incurring negligible extra overhead compared with the number of symbols required for the original CE. For the single-path case which is especially applicable to millimeter-wave and terahertz systems, a novel low-complexity CE method is devised capitalizing on the form of the array factors at the RIS. Simulation results demonstrate that the proposed algorithms yield high CE accuracy and achievable rate with low complexity, and outperform representative benchmark schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shu Sun, Hangsong Yan. 2021-01-29. Channel Estimation for Reconfigurable Intelligent Surface-Assisted Wireless Communications Considering Doppler Effect. https://arxiv.org/abs/2010.00101

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