To Cooperate, or not to cooperate in imperfectly-known fading channels

Junwei Zhang, M. C. Gursoy
{"title":"To Cooperate, or not to cooperate in imperfectly-known fading channels","authors":"Junwei Zhang, M. C. Gursoy","doi":"10.1109/SPAWC.2008.4641650","DOIUrl":null,"url":null,"abstract":"In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are employed. For different cooperation protocols, achievable rate expressions are obtained. These achievable rate expressions are then used to find the optimal resource allocation strategies. In particular, the fraction of total time or bandwidth that needs to be allocated to the relay for best performance is identified. Under a total power constraint, optimal allocation of power between the source and relay is investigated. Finally, bit energy requirements in the low-power regime are studied.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are employed. For different cooperation protocols, achievable rate expressions are obtained. These achievable rate expressions are then used to find the optimal resource allocation strategies. In particular, the fraction of total time or bandwidth that needs to be allocated to the relay for best performance is identified. Under a total power constraint, optimal allocation of power between the source and relay is investigated. Finally, bit energy requirements in the low-power regime are studied.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在不完全了解的衰落频道中合作,或者不合作
本文研究了不完全已知衰落信道中不同合作度的通信问题。考虑了三节点中继通道。假设通信从网络训练阶段开始,在此阶段接收机估计各自信道的衰落系数。在数据传输阶段,采用了放大转发和解码转发两种中继方式。针对不同的合作协议,得到了可实现速率表达式。然后使用这些可实现的速率表达式来找到最优的资源分配策略。特别是,确定了需要分配给中继以获得最佳性能的总时间或带宽的比例。在总功率约束下,研究了电源和继电器之间的最优功率分配。最后,研究了低功耗时的比特能量需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Asymptotically optimal block-based transceivers with reduced redundancy Coding strategies for CDMA packet data networks with reduced rank multiuser detection, ARQ and Packet Combining Biorthogonal pulse shape modulation for IR-UWB systems over fading channels Blind estimation of nonlinear instantaneous channels in multiuser CDMA systems with PSK inputs Channel estimation in MIMO OFDM/OQAM
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1