Computer Science – Information Theory
Scientific paper
2011-05-30
Computer Science
Information Theory
IEEE International Symposium on Information Theory 2011 (ISIT 2011), Saint Petersburg, Russia, to appear
Scientific paper
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.
Bölcskei Helmut
Durisi Giuseppe
Lin Shaowei
Morgenshtern Veniamin I.
Riegler Erwin
No associations
LandOfFree
Noncoherent SIMO Pre-Log via Resolution of Singularities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Noncoherent SIMO Pre-Log via Resolution of Singularities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noncoherent SIMO Pre-Log via Resolution of Singularities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-678515