By Topic

Low-Complexity Iterative Algorithm for Finding the MIMO-OFDM Broadcast Channel Sum Capacity

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

3 Author(s)
Marian Codreanu ; Centre for Wireless Commun., Univ. of Oulu ; Markku Juntti ; Matti Latva-Aho

A novel low-complexity and provably convergent algorithm is proposed to find the sum capacity for vector Gaussian broadcast channels. Unlike the recently proposed sum-power constraint iterative waterfilling (SPC-IWF) algorithms, it has lower complexity and requires no additional precautions to ensure the convergence. We have proved analytically the convergence with probability one, and the computer simulations show that the proposed algorithm converges faster than the earlier variants of SPC-IWF algorithms. We formulate the problem in the context of a multiple-input multiple-output orthogonal frequency-division multiplexing system and discuss the simplifications provided by the block-diagonal channel structure

Published in:

IEEE Transactions on Communications  (Volume:55 ,  Issue: 1 )