Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower Bound on the Sum-rate of Decremental Beam Selection Algorithm for Beamspace MIMO Systems

Published 30 Jan 2019 in cs.IT and math.IT | (1901.10702v1)

Abstract: In general, the zero-forcing (ZF) precoding suffers from a severe receive signal-to-noise ratio (SNR) degradation in the high interference regime. However, recent evidences from realistic measurements demonstrated that millimeter wave (mmWave) systems are mainly noise-limited as high gain antennas behave as spatial filters to the interference signal. This makes ZF precoding equally attractive as that of other linear precoding counterparts. Considering ZF precoding, this paper aims to derive a lower bound on the sum-rate achieved by a decremental beam selection (BS) algorithm in a beamspace MIMO (B-MIMO) system operating at mmWave frequencies. This bound relates Frobenious norms of precoding matrices of full and reduced dimensional (i.e. after BS) B-MIMO systems through a deterministic square-hyperbolic function. Note that, both ZF precoding and decremental BS are not new concepts. However, the derived sum-rate bound provides a new insight to the topic. Given a particular full dimensional B-MIMO channel, the presented bound can be used to understand limits of BS algorithms.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.