Non-orthogonal multiple access for MIMO wireless communications
Notice bibliographique
Résumé
Through spatial diversity, multiplexing or beamforming gain, the multiple-input multiple-output (MIMO) techniques can offer significant performance improvements in terms of user capacity, spectral efficiency, and peak data rates.Recently, the application of MIMO techniques along with non-orthogonal multiple access (NOMA) has aroused great interest as an enabling technology to meet the exacting demands of fifth generation (5G) and beyond 5G (B5G) wireless networks.In effect, by allowing multiple users to access overlapping time and frequency resources in the same spatial layer, NOMA has the potential to provide higher system throughput and solve the massive connectivity needed for future wireless networks.The primary objective of this thesis is to develop new approaches for multi-user MIMO NOMA systems from the perspectives of spectral and energy efficiency.First, the joint design of user clustering, downlink beamforming and power allocation is formulated as a mixed-integer non-linear programming (MINLP) model for a MIMO NOMA system.In this problem the aim is to minimize the total transmission power while satisfying quality-of-service (QoS) and power constraints.To tackle this challenging problem, we reformulate it into a more tractable form and conceive two algorithms based on the branch-and-bound and penalty dual decomposition techniques for its solution.The performance of the proposed joint design algorithms for MIMO NOMA is validated by means of simulations over millimeter-wave (mmWave) channels.The results show the advantages of the proposed algorithms in terms of total transmit power and spectral efficiency over competing multiple access schemes.Then, we study the application of spatial user clustering along with downlink beamforming for MIMO sparse code multiple access (SCMA) in a cloud radio access Abstract iii network (C-RAN).A user clustering algorithm based on a constrained K-means method is proposed to limit the number of users in each cluster.Subsequently, two iterative algorithms for beamforming design are developed by minimizing the total transmission power under QoS and fronthaul capacity constraints.The performance of the proposed user clustering and downlink beamforming approaches in MIMO SCMA systems is evaluated through simulations.The results provide useful insights into the advantages of the proposed schemes over benchmark approaches, in terms of transmit power and spectral efficiency.Finally, we propose a novel SCMA decoder based on deep residual neural network (ResNet), wherein the decoder is trained to predict the transmit codewords.In our approach, batch normalization is utilized to enhance the stability and robustness of the decoder, while residual blocks are employed to tackle the problems with deep learning based decoder such as accuracy saturation and vanishing gradients.The performance of the proposed ResNet decoder for SCMA is validated by means of simulations over AWGN and Rayleigh fading channels.The results show that besides a much reduced complexity, the proposed decoder leads to improvements in term of bit error rate (BER) over competing deep neural network (DNN) based decoders.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,001 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,002 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,005 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».