By Topic

Capacity limits of time-varying MIMO channels

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

4 Author(s)
Zhendong Luo ; Sch. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun., China ; Hong Gao ; Yuanan Liu ; Jinchun Gao

In this paper, we present the ergodic capacity limits of time-varying multiple-input multiple-output (MIMO) channels in flat fading and frequency-selective fading environments. By using a nonstationary method, called generalized water-filling algorithm (GWFA), the transmitted power is optimally allocated over all the channel states in three dimensions including space, time and frequency. Therefore, the highest capacity (i.e., capacity limit) of time-varying MIMO channels is obtained. Compared with the conventional water-filling algorithm, GWFA can achieve higher capacity via more efficient computation.

Published in:

Communications, 2005. ICC 2005. 2005 IEEE International Conference on  (Volume:2 )

Date of Conference:

16-20 May 2005