Evolutionary-Algorithm-Assisted Joint Channel Estimation and Turbo Multiuser Detection/Decoding for OFDM/SDMA

The development of evolutionary algorithms (EAs), such as genetic algorithms (GAs), repeated weighted boosting search (RWBS), particle swarm optimization (PSO), and differential evolution algorithms (DEAs), have stimulated wide interests in the communication research community. However, the quantita...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 63; číslo 3; s. 1204 - 1222
Hlavní autoři: Jiankang Zhang, Sheng Chen, Xiaomin Mu, Hanzo, Lajos
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Mud
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The development of evolutionary algorithms (EAs), such as genetic algorithms (GAs), repeated weighted boosting search (RWBS), particle swarm optimization (PSO), and differential evolution algorithms (DEAs), have stimulated wide interests in the communication research community. However, the quantitative performance-versus-complexity comparison of GA, RWBS, PSO, and DEA techniques applied to the joint channel estimation (CE) and turbo multiuser detection (MUD)/decoding in the context of orthogonal frequency-division multiplexing/space-division multiple-access systems is a challenging problem, which has to consider both the CE problem formulated over a continuous search space and the MUD optimization problem defined over a discrete search space. We investigate the capability of the GA, RWBS, PSO, and DEA to achieve optimal solutions at an affordable complexity in this challenging application. Our study demonstrates that the EA-assisted joint CE and turbo MUD/decoder is capable of approaching both the Cramér-Rao lower bound of the optimal CE and the bit error ratio (BER) performance of the idealized optimal maximum-likelihood (ML) turbo MUD/decoder associated with perfect channel state information, respectively, despite imposing only a fraction of the idealized turbo ML-MUD/decoder's complexity.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2013.2283069