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

A Lower Bound on the Noncoherent Capacity Pre-log for the MIMO Channel with Temporally Correlated Fading (1302.2481v1)

Published 11 Feb 2013 in cs.IT and math.IT

Abstract: We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel knowledge at the transmitter and the receiver). In this model, the fading process changes independently across blocks of length L and is temporally correlated within each block for each transmit-receive antenna pair, with a given rank Q of the corresponding correlation matrix. Our result implies that for almost all choices of the coloring matrix that models the temporal correlation, the pre-log can be lower-bounded by T(1-1/L) for T <= (L-1)/Q provided that R is sufficiently large. The widely used constant block-fading model is equivalent to the temporally correlated block-fading model with Q = 1 for the special case when the temporal correlation for each transmit-receive antenna pair is the same, which is unlikely to be observed in practice. For the constant block-fading model, the capacity pre-log is given by T(1-T/L), which is smaller than our lower bound for the case Q = 1. Thus, our result suggests that the assumptions underlying the constant block- fading model lead to a pessimistic result for the capacity pre-log.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Günther Koliander (24 papers)
  2. Erwin Riegler (27 papers)
  3. Giuseppe Durisi (119 papers)
  4. Veniamin I. Morgenshtern (15 papers)
  5. Franz Hlawatsch (30 papers)
Citations (7)

Summary

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