Search arXivSearch

arXiv · 1910.14310

Channel Capacity Optimization Using Reconfigurable Intelligent Surfaces in Indoor mmWave Environments

Abstract

Indoor millimeter-wave (mmWave) environment channels are typically sparsely-scattered and dominated by a strong line-of-sight (LOS) path. Therefore, communication over such channels is in general extremely difficult when the LOS path is not present. However, the recent introduction of reconfigurable intelligent surfaces (RISs), which have the potential to influence the propagation environment in a controlled manner, has the potential to change the previous paradigm. Motivated by this, we study the channel capacity optimization utilizing RISs in indoor mmWave environments where no LOS path is present. More precisely, we propose two optimization schemes that exploit the customizing capabilities of the RIS reflection elements in order to maximize the channel capacity. The first optimization scheme exploits only the adjustability of the RIS reflection elements; for this scheme we derive an approximate expression which explains the connection between the channel capacity gains and the system parameters. The second optimization scheme jointly optimizes the RIS reflection elements and the transmit phase precoder; for this scheme, we propose a low-complexity technique called global co-phasing to determine the phase shift values for use at the RIS. Simulation results show that the optimization of the RIS reflection elements produces a significant channel capacity gain, and that this gain increases with the number of RIS elements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nemanja Stefan Perović, Marco Di Renzo, Mark F. Flanagan. 2020-02-29. Channel Capacity Optimization Using Reconfigurable Intelligent Surfaces in Indoor mmWave Environments. https://arxiv.org/abs/1910.14310

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT