Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Noncoherent SIMO Pre-Log via Resolution of Singularities (1105.6009v1)

Published 30 May 2011 in cs.IT, math.AG, and math.IT

Abstract: We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Our result holds for arbitrary rank Q of the channel correlation matrix, arbitrary block-length L > Q, and arbitrary number of receive antennas R, and includes the result in Morgenshtern et al. (2010) as a special case. It is well known that the capacity pre-log for this channel in the single-input single-output (SISO) case is given by 1-Q/L, where Q/L is the penalty incurred by channel uncertainty. Our result reveals that this penalty can be reduced to 1/L by adding only one receive antenna, provided that L \geq 2Q - 1 and the channel correlation matrix satisfies mild technical conditions. The main technical tool used to prove our result is Hironaka's celebrated theorem on resolution of singularities in algebraic geometry.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Erwin Riegler (27 papers)
  2. Veniamin I. Morgenshtern (15 papers)
  3. Giuseppe Durisi (119 papers)
  4. Shaowei Lin (21 papers)
  5. Bernd Sturmfels (143 papers)
  6. Helmut Bölcskei (88 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.