Cooperative communication for relay and multiple access channels: Design, optimization and performance analysis
Notice bibliographique
Résumé
In modern and future cellular networks such as Long-Term Evolution-Advanced (LTE-A)and 5G systems, cooperative communication can be deployed as an efficient method to improvesystem performance and meet the high-speed data transmission needs of multimediaservices. This thesis studies cooperation in the multiple access channel (MAC) setting,which includes the relay channel (RC) setting as a special case. These cooperative settingsapply to uplink transmission in cellular networks and form the basis to improve the widenetwork performance.The thesis proposes a time-division half-duplex scheme for the MAC with transmittercooperation (MAC-TC). The proposed scheme divides each transmission frame into threephases with variable durations. The two user equipments (UEs) partially exchange theirinformation in the first two phases, then cooperatively and coherently transmit to the basestation (BS) in the third phase, i.e., each UE performs a partial decode-forward (pDF) ofthe other UE information. The BS then performs joint decoding using the signals receivedin all three phases. After designing the scheme for the discrete memoryless channel (DMC),the thesis applies it to the Gaussian channel, derives its optimal resource allocations formaximum throughput and studies the outage performance over fading links. Comparedwith existing schemes, the proposed scheme improves throughput and outage performance,which makes it appealing for deployment in future cellular networks by utilizing the device-to-device (D2D) and infrastructure modes in the uplink transmission.The proposed scheme is near capacity-achieving when the cooperative links are strongerthan the direct links. Compared to existing schemes, this scheme achieves the same orbetter spectral efficiency with simpler signals and shorter decoding delay. By analyzingthe KKT optimality conditions for the maximum transmission rate, the thesis shows thatas the inter-user link qualities increase, the optimal scheme moves from no cooperation topartial then to full cooperation, in which the users fully exchange their information. Theoptimal power allocation to achieve the maximum throughput is analytically derived.The thesis further formulates the outage probability of the cooperative scheme overRayleigh fading channels assuming full channel state information (CSI) at receivers andlimited CSI at transmitters. Results show that cooperation can significantly reduce outageprobabilities and achieve the full diversity order despite additional outages at the UEs. Thethesis considers the RC setting in detail and analytically derives the outage performance for the coherent pDF relaying. Results show that the proposed scheme outperforms the existingschemes since it employs coherent transmission and joint decoding at the destination.Last, the thesis proposes a MAC with a joint source-destination cooperation (MAC-SDC)scheme that also engages the BS in cooperation by employing quantize-forward relaying.In this scheme, the users exchange their information not only through the cooperativelinks as in the MAC-TC, but also via the feedback links from the BS. Results showachievability improvement especially when the cooperative links are marginally strongerthan direct links. Moreover, for the RC setting, the thesis proves that the proposed schemeasymptotically achieves capacity by reaching the cutset bound as BS power increases.
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,003 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| 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,002 | 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 ».