By Topic

Power Loading in Parallel Diversity Channels Based on Statistical Channel Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Coon, J.P. ; Toshiba Res. Eur. Ltd., Bristol, UK ; Cepeda, R.

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.

Published in:

Communications Letters, IEEE  (Volume:16 ,  Issue: 7 )