Power Loading in Parallel Diversity Channels Based on Statistical Channel Information

Details Power Loading in Parallel Diversity Channels Based on Statistical Channel Information Power Loading in Parallel Diversity Channels Based on Statistical Channel Information

2010-03-26

arxiv.org/abs/1003.5097v2

Computer Science

Information Theory

6 pages, 7 figures

Scientific paper

In this paper, we show that there exists an arbitrary number of power allocation schemes that achieve capacity in systems operating in parallel channels comprised of single-input multiple-output (SIMO) Nakagami-m fading subchannels when the number of degrees of freedom L (e.g., the number of receive antennas) tends to infinity. Statistical waterfilling -- i.e., waterfilling using channel statistics rather than instantaneous channel knowledge -- is one such scheme. We further prove that the convergence of statistical waterfilling to the optimal power loading scheme is at least O(1/(L log(L))), whereas convergence of other schemes is at worst O(1/log(L)). To validate and demonstrate the practical use of our findings, we evaluate the mutual information of example SIMO parallel channels using simulations as well as new measured ultrawideband channel data.

Affiliated with

Also associated with

No associations

Rating

Power Loading in Parallel Diversity Channels Based on Statistical Channel Information 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 Power Loading in Parallel Diversity Channels Based on Statistical Channel Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Loading in Parallel Diversity Channels Based on Statistical Channel Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182313