Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2308.14057

Channel Estimation By Transmitting Pilots From Reconfigurable Intelligent Surface

Yanze Zhu·Yang Liu·Qingqing Wu·Changsheng You·Qingjiang Shi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surface (RIS) is a promising technology for future wireless communication systems. Channel estimation (CE) of RIS device is a critical but also challenging issue for its development. The mainstream of existing CE methods is confined to the so-called cascaded channel (CscdChn) estimation scheme, which treats the multiplicative two-hop RIS channels as an effective one and measures it as a whole. This CscdChn training method suffers from severe double-fading attenuation loss, which significantly degrades the CE accuracy. In this paper, we propose a novel RIS-transmitting (RIS-TX) based CE scheme, which has lower pilot overhead than CscdChn scheme and effectively overcomes the double-fading curse via incorporating only one single transmit radio frequency (RF)-chain into RIS. We develop highly efficient gradient descent (GD) and penalty duality decomposition (PDD)-based solutions to resolve the pilot design task for the RIS-TX CE scheme, which is a difficult quartic optimization problem. Our designed pilot signal outperforms the discrete Fourier transform (DFT) sequence, which is reported to be optimal for CscdChn scheme. Besides, both theoretical analysis and numerical results demonstrate that our proposed RIS-TX scheme exhibits distinct performance characteristics as opposed to its CscdChn counterpart and yields superior accuracy when RIS device is not extremely large.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanze Zhu, Yang Liu, Qingqing Wu, Changsheng You, Qingjiang Shi. 2023-08-27. Channel Estimation By Transmitting Pilots From Reconfigurable Intelligent Surface. https://arxiv.org/abs/2308.14057

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↗