Search arXivSearch

arXiv · 1912.10671

Channel Estimation Method and Phase Shift Design for Reconfigurable Intelligent Surface Assisted MIMO Networks

Abstract

In this paper, we investigate channel estimation for a large intelligent surface (LIS) aided multiple-input multiple-output (MIMO) communication system. Due to the close proximity of communication devices and LIS terminal, the desired channels can be modeled as line-of-sight channels which are ill-conditioned. To estimate these channel matrices with high quality, we propose a two-stage channel estimation method. In particular, we employ the conventional time-division duplexing based MIMO channel estimation technique in the first stage to estimate the direct MIMO channel between the end terminals. In the second stage, we propose to use a recently developed bilinear adaptive vector approximate message passing (BAdVAMP) algorithm to estimate ill-conditioned LIS channels. The BAdVAMP method has been shown to be accurate and robust for ill-conditioned dictionary learning problems in compressed sensing. We also propose a phase shift design for the LIS using the estimated channels. Specifically, we formulate an optimization problem that maximizes the total channel gain at the user. A closed-form expression to obtain the phase shift of each passive element in the LIS is also derived. Numerical results show that the proposed BAdVAMP based LIS channel estimation performs better than its counterpart scheme bilinear generalized AMP (BiGAMP), especially when channel matrices are ill-conditioned.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jawad Mirza, Bakhtiar Ali. 2020-06-01. Channel Estimation Method and Phase Shift Design for Reconfigurable Intelligent Surface Assisted MIMO Networks. https://arxiv.org/abs/1912.10671

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