By Topic

The Fading Number of a Multiple-Access Rician Fading Channel

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
$33 $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)
Gu-Rong Lin ; Dep. of Electrical Engineering, National Chiao Tung University (NCTU), Hsinchu, Taiwan ; Stefan M. Moser

The sum-rate capacity of a noncoherent memoryless multiple-access Rician fading channel is investigated under three different categories of power constraints: individual per user peak-power constraints, individual per user average-power constraints, or a global power-sharing average-power constraint. Upper and lower bounds on the sum-rate capacity are derived, and it is shown that at high signal-to-noise ratio the sum-rate capacity only grows double-logarithmically in the available power. The asymptotic behavior of capacity is then analyzed in detail and the exact asymptotic expansion is derived including its second term, the so-called fading number. It is shown that the fading number is identical to the fading number of the single-user Rician fading channel that is obtained when only the user seeing the best channel is transmitting and all other users are switched off at all times. This pessimistic result holds independently of the type of power constraint that is imposed.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 8 )