Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems

Uthansakul, P. and Bialkowski, M. E. (2005). Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems. In: Kai-Seng Chung, 2005 Asia-Pacific Conference on Communications. IEEE Asia-Pacific Conference on Communications, Perth, Australia, (163-167). 3-5 October 2005. doi:10.1109/APCC.2005.1554040


Author Uthansakul, P.
Bialkowski, M. E.
Title of paper Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems
Conference name IEEE Asia-Pacific Conference on Communications
Conference location Perth, Australia
Conference dates 3-5 October 2005
Proceedings title 2005 Asia-Pacific Conference on Communications
Journal name 2005 Asia-Pacific Conference on Communications (APCC), Vols 1
Place of Publication Los Alamitos, CA, U.S.A.
Publisher IEEE
Publication Year 2005
Sub-type Fully published paper
DOI 10.1109/APCC.2005.1554040
Open Access Status
ISBN 0-7803-9132-2
Editor Kai-Seng Chung
Volume 2005
Start page 163
End page 167
Total pages 5
Language eng
Abstract/Summary This paper describes two algorithms for adaptive power and bit allocations in a multiple input multiple output multiple-carrier code division multiple access (MIMO MC-CDMA) system. The first is the greedy algorithm, which has already been presented in the literature. The other one, which is proposed by the authors, is based on the use of the Lagrange multiplier method. The performances of the two algorithms are compared via Monte Carlo simulations. At present stage, the simulations are restricted to a single user MIMO MC-CDMA system, which is equivalent to a MIMO OFDM system. It is assumed that the system operates in a frequency selective fading environment. The transmitter has a partial knowledge of the channel whose properties are measured at the receiver. The use of the two algorithms results in similar system performances. The advantage of the Lagrange algorithm is that is much faster than the greedy algorithm. ©2005 IEEE
Subjects E1
291799 Communications Technologies not elsewhere classified
700302 Telecommunications
Keyword MIMO systems
Monte Carlo methods
Code division multiple access
Fading channels
Greedy algorithms
Q-Index Code E1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 3 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 24 Aug 2007, 06:59:45 EST