Cooperation in Outage-Limited Multiple-Access Channels

K. Azarian, H. E. Gamal
{"title":"Cooperation in Outage-Limited Multiple-Access Channels","authors":"K. Azarian, H. E. Gamal","doi":"10.1109/IZS.2006.1649102","DOIUrl":null,"url":null,"abstract":"We consider three variants of the multiple-access (MA) channel and propose protocols that simultaneously achieve the corresponding full-diversity and full-multiplexing gains. The three variants considered in this work are the scalar cooperative MA (CMA) channel, the scalar MA relay (MAR) channel and the vector automatic retransmission request CMA (ARQ-CMA) channel. For the scalar CMA channel, we propose a recursive amplify and forward (AF) protocol and prove its optimality with respect to the diversity-multiplexing tradeoff (DMT). For the scalar MAR channel, we characterize the performance of the dynamic decode and forward (DDF) protocol. This characterization proves that DDF simultaneously achieves the full-diversity and full-multiplexing gains. It also shows that the protocol is DMT optimal, over the range of multiplexing gains 0.5 ges r ges 0. The last variant considered in this paper is the vector ARQ-CMA channel. For this scenario, we propose a protocol and characterize its achieved tradeoff. This characterization reveals that the devised protocol achieves both, the full-diversity and full-multiplexing gains. It also establishes the asymptotic optimality of the proposed protocol as the number of transmission rounds grows to infinity","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Zurich Seminar on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IZS.2006.1649102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

We consider three variants of the multiple-access (MA) channel and propose protocols that simultaneously achieve the corresponding full-diversity and full-multiplexing gains. The three variants considered in this work are the scalar cooperative MA (CMA) channel, the scalar MA relay (MAR) channel and the vector automatic retransmission request CMA (ARQ-CMA) channel. For the scalar CMA channel, we propose a recursive amplify and forward (AF) protocol and prove its optimality with respect to the diversity-multiplexing tradeoff (DMT). For the scalar MAR channel, we characterize the performance of the dynamic decode and forward (DDF) protocol. This characterization proves that DDF simultaneously achieves the full-diversity and full-multiplexing gains. It also shows that the protocol is DMT optimal, over the range of multiplexing gains 0.5 ges r ges 0. The last variant considered in this paper is the vector ARQ-CMA channel. For this scenario, we propose a protocol and characterize its achieved tradeoff. This characterization reveals that the devised protocol achieves both, the full-diversity and full-multiplexing gains. It also establishes the asymptotic optimality of the proposed protocol as the number of transmission rounds grows to infinity
限断网多址通道合作
我们考虑了多址(MA)信道的三种变体,并提出了同时实现相应的全分集和全复用增益的协议。本文所考虑的三种变体分别是标量协同移动通信(CMA)信道、标量移动通信中继(MAR)信道和矢量自动重传请求移动通信(ARQ-CMA)信道。对于标量CMA信道,我们提出了一种递归放大和转发(AF)协议,并证明了它在分集复用权衡(DMT)方面的最优性。对于标量MAR信道,我们描述了动态解码和转发(DDF)协议的性能。这一特性证明了DDF同时实现了全分集和全复用增益。结果还表明,该协议是DMT最优的,在复用增益为0.5 ~ 0的范围内。本文考虑的最后一种变体是矢量ARQ-CMA信道。对于这种情况,我们提出一个协议并描述其实现的权衡。该特性表明,所设计的协议同时实现了全分集和全复用增益。并建立了当传输轮数趋于无穷时所提出协议的渐近最优性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信