Number-Theoretic Sequence Design for Uncoordinated Resource Block Assignments in Relay-Assisted Machine-Type Communication Systems
Notice bibliographique
Résumé
Terminal relaying offers effective means for realizing machine-type communication (MTC) systems.However, coordinating these relaying terminals (RTs) becomes a cumbersome task as the number of RTs increases.In the absence of channel state information, the efficient utilization of RTs requires a mechanism by which RTs can autonomously assign available resource blocks (RBs) to large numbers of uncoordinated MTC devices with minimal conflicts.Unlike random RB assignments, using prescribed assignment sequences provides an opportunity for obtaining performance gains.However, realizing these gains requires optimizing RB assignments over a large set of sequences.One technique for selecting assignment sequences is based on an exhaustive search of exponential complexity over sequences generated by multiplicative cyclic groups.This technique restricts the RB assignment sequence length and does not consider sequences generated using other group operations.In this thesis, we use group isomorphism to eliminate the constraint on the sequence length and to show that the optimal assignment sequences generated by a specific cyclic group are globally-optimal over the set of all cyclically-generated sequences.We also develop a greedy algorithm with polynomial complexity for the sequential selection of assignment sequences in systems with large numbers of RTs.This algorithm is further simplified by invoking the graphical representation of cyclic groups to enable its application in massive MTC systems.To further improve performance, we extend the RB assignment sequences set by considering multi-generator sequences.In particular, the Chinese remainder theorem (CRT) is used to combine cyclically-generated sequences into longer ones.This combining process introduces additional degrees of freedom in sequence generation, thereby enriching the set of assignment sequences.We then use group isomorphism to show that the set of pseudonoise maximal length sequences (M-sequences) constitutes a subset of the cyclically-generated sequences set and that their performance is upper bounded by ii that of cyclically-generated and CRT-based sequences.This isomorphism is also used to extend the ease of generation property of M-sequences to their corresponding cyclically-generated supersets.Finally, we compare the correlation properties of CRT-based, Zadoff-Chu (ZC), and M-sequences and discuss the applicability of the CRT-based sequences for synchronization signalling in practical systems with large carrier frequency offsets.iii Prof. Halim Yanikomeroglu and Prof. Ramy Gohary for their abundant support and encouragement during the course of my Ph.D. degree.I am also thankful for my colleagues in our research group for their encouragement and insightful suggestions for improving this work along the long journey.I would also like to acknowledge Huawei Technologies Ltd. for financially supporting this research and for their insightful comments that helped in improving this work.I would also like to thank Dr. Sivanesan Kathiravetpillai
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 machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,005 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,001 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,003 | 0,001 |
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 source (Gemma direct ou Codex distillé), 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 ».