Large Intelligent Surfaces with Channel Estimation Overhead: Achievable Rate and Optimal Configuration
Neel Kanth Kundu, Matthew R. McKay

TL;DR
This paper analyzes the trade-off between channel estimation overhead and achievable rate in large intelligent surface (LIS) systems, deriving optimal configurations to maximize performance.
Contribution
It introduces an analytical framework to determine the optimal number of LIS elements that balances power gains and estimation overhead.
Findings
Existence of an optimal LIS element count $K^{*}$ for maximum rate
Analytical approximations for $K^{*}$ based on system parameters
Dependence of $K^{*}$ on statistical channel characteristics
Abstract
Large intelligent surfaces (LIS) present a promising new technology for enhancing the performance of wireless communication systems. Realizing the gains of LIS requires accurate channel knowledge, and in practice the channel estimation overhead can be large due to the passive nature of LIS. Here, we study the achievable rate of a LIS-assisted single-input single-output communication system, accounting for the pilot overhead of a least-squares channel estimator. We demonstrate that there exists an optimal , which maximizes achievable rate by balancing the power gains offered by LIS and the channel estimation overhead. We present analytical approximations for , based on maximizing an analytical upper bound on average achievable rate that we derive, and study the dependencies of on statistical channel and system parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
