Efficient Power Allocation Algorithms for Adaptive Spatial Multiplexing MIMO Systems 


Vol. 36,  No. 4, pp. 232-240, Apr.  2011


PDF
  Abstract

While the water-filling algorithm is an efficient power allocation method that maximizes the ergodic capacity of adaptive MIMO systems, its excessive residual power causes spectrum loss in real systems employing discrete modulation indices. In this paper we propose new power allocation algorithms that improve the spectral efficiency of MIMO systems by efficiently reallocating the residual power of the water-filling algorithm. We apply the proposed algorithms to the adaptive turbo-coded MIMO system to verify their performance through computer simulation in various environments. Simulation results show that the spectral efficiency of the proposed algorithms is better than that of the water-filling algorithm by about 8.9% at SNR of 20㏈ in Rayleigh fading environments.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Shin, D. Kim, H. Park, "Efficient Power Allocation Algorithms for Adaptive Spatial Multiplexing MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 4, pp. 232-240, 2011. DOI: .

[ACM Style]

Joon-Ho Shin, Dong-Geon Kim, and Hyung-Rae Park. 2011. Efficient Power Allocation Algorithms for Adaptive Spatial Multiplexing MIMO Systems. The Journal of Korean Institute of Communications and Information Sciences, 36, 4, (2011), 232-240. DOI: .

[KICS Style]

Joon-Ho Shin, Dong-Geon Kim, Hyung-Rae Park, "Efficient Power Allocation Algorithms for Adaptive Spatial Multiplexing MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 4, pp. 232-240, 4. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880