Article (Périodiques scientifiques)
Efficient Memory-Bounded Optimal Detection for GSM-MIMO Systems
HE, Ke; He, Le; Fan, Lisheng et al.
2022In IEEE Transactions on Communications, 70 (7), p. 4359-4372
Peer reviewed vérifié par ORBi
 

Documents


Texte intégral
Efficient_Memory-Bounded_Optimal_Detection_for_GSM-MIMO_Systems.pdf
Postprint Éditeur (1.52 MB)
Demander un accès

0090-6778 © 2022 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information. Authorized licensed use limited to: University of Luxembourg. Downloaded on December 14,2022 at 12:33:48 UTC from IEEE Xplore. Restrictions apply.


Tous les documents dans ORBilu sont protégés par une licence d'utilisation.

Envoyer vers



Détails



Mots-clés :
Signal detection; MIMO; tree search algorithm
Résumé :
[en] We investigate the optimal signal detection problem in large-scale multiple-input multiple-output (MIMO) system with the generalized spatial modulation (GSM) scheme, which can be formulated as a closest lattice point search (CLPS). To identify invalid signals, an efficient pruning strategy is needed while searching on the GSM decision tree. However, the existing algorithms have exponential complexity, whereas they are infeasible in large-scale GSM-MIMO systems. In order to tackle this problem, we propose a memory-efficient pruning strategy by leveraging the combinatorial nature of the GSM signal structure. Thus, the required memory size is squared to the number of transmit antennas. We further propose an efficient memory-bounded maximum likelihood (ML) search (EM-MLS) algorithm by jointly employing the proposed pruning strategy and the memory-bounded best-first algorithm. Theoretical and simulation results show that our proposed algorithm can achieve the optimal bit error rate (BER) performance, while its memory size can be bounded. Moreover, the expected time complexity decreases exponentially with increasing the signal-to-noise ratio (SNR) as well as the system’s excess degree of freedom, and it often converges to squared time under practical scenarios.
Disciplines :
Ingénierie électrique & électronique
Auteur, co-auteur :
HE, Ke  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom ; Guangzhou University > School of Computer Science and Cyber Engineering
He, Le;  Guangzhou University > School of Computer Science and Cyber Engineering
Fan, Lisheng;  Guangzhou University > School of Computer Science and Cyber Engineering
Lei, Xianfu;  Southwest Jiaotong University > School of Information Science and Technology
Deng, Yansha;  King’s College London > Department of Engineering
Karagiannidis, George;  Aristotle University of Thessaloniki > Department of Electrical Computer Engineering
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Efficient Memory-Bounded Optimal Detection for GSM-MIMO Systems
Date de publication/diffusion :
juillet 2022
Titre du périodique :
IEEE Transactions on Communications
ISSN :
0090-6778
eISSN :
1558-0857
Maison d'édition :
Institute of Electrical and Electronics Engineers, Etats-Unis
Volume/Tome :
70
Fascicule/Saison :
7
Pagination :
4359-4372
Peer reviewed :
Peer reviewed vérifié par ORBi
Organisme subsidiant :
Natural Science Foundation of China
Disponible sur ORBilu :
depuis le 14 décembre 2022

Statistiques


Nombre de vues
149 (dont 12 Unilu)
Nombre de téléchargements
1 (dont 1 Unilu)

citations Scopus®
 
16
citations Scopus®
sans auto-citations
13
citations OpenAlex
 
32
citations WoS
 
29

Bibliographie


Publications similaires



Contacter ORBilu