Half-duplex relaying based on quantize-and-forward

Sha Yao, M. Skoglund, Thanh Tùng Kim, H. Poor
{"title":"Half-duplex relaying based on quantize-and-forward","authors":"Sha Yao, M. Skoglund, Thanh Tùng Kim, H. Poor","doi":"10.1109/ISIT.2011.6034004","DOIUrl":null,"url":null,"abstract":"The original compress-and-forward relaying scheme uses the technique of random binning at the relay node and successive decoding at the destination node. Recently, a scheme (termed the quantize-and-forward scheme in this paper) without binning and using joint decoding at the destination node has been proposed, which has been shown to achieve the same rate as the original compress-and-forward scheme. Since the previous work focuses on the so-called full duplex relay network, in this paper, an adaption of it for relay networks with a half-duplex relay is provided. Coding schemes and achievable rate results are presented for discrete memoryless half-duplex relay channels and half-duplex additive white Gaussian noise (AWGN) relay channels. Moreover, slow fading channels are considered, for which outage-related performance measures are evaluated. Specifically, the outage probability and the expected rate of the quantize-and-forward scheme are derived and compared with other well-known schemes. Furthermore, the diversity-multiplexing tradeoff is derived. It is shown that the quantize-and-forward scheme is a more suitable scheme than the compress-and-forward scheme over slow fading channels and it achieves the optimal diversity-multiplexing trade-off of a half-duplex relay channel.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The original compress-and-forward relaying scheme uses the technique of random binning at the relay node and successive decoding at the destination node. Recently, a scheme (termed the quantize-and-forward scheme in this paper) without binning and using joint decoding at the destination node has been proposed, which has been shown to achieve the same rate as the original compress-and-forward scheme. Since the previous work focuses on the so-called full duplex relay network, in this paper, an adaption of it for relay networks with a half-duplex relay is provided. Coding schemes and achievable rate results are presented for discrete memoryless half-duplex relay channels and half-duplex additive white Gaussian noise (AWGN) relay channels. Moreover, slow fading channels are considered, for which outage-related performance measures are evaluated. Specifically, the outage probability and the expected rate of the quantize-and-forward scheme are derived and compared with other well-known schemes. Furthermore, the diversity-multiplexing tradeoff is derived. It is shown that the quantize-and-forward scheme is a more suitable scheme than the compress-and-forward scheme over slow fading channels and it achieves the optimal diversity-multiplexing trade-off of a half-duplex relay channel.
基于量化转发的半双工中继
原始的压缩转发中继方案采用中继节点随机分组、目的节点逐次解码的技术。最近,提出了一种不进行分组并在目的节点使用联合解码的方案(本文称之为量化转发方案),该方案已被证明可以达到与原始压缩转发方案相同的速率。由于以前的工作主要集中在所谓的全双工中继网络上,因此本文提供了一种适用于具有半双工中继的中继网络的方法。给出了离散无记忆半双工中继信道和半双工加性高斯白噪声(AWGN)中继信道的编码方案和可实现速率结果。此外,还考虑了慢衰落信道,并对其中断相关的性能指标进行了评估。具体而言,推导了量化前向方案的中断概率和期望率,并与其他知名方案进行了比较。此外,还推导了分集与复用的权衡。结果表明,在慢衰落信道中,量化转发方案比压缩转发方案更合适,并能实现半双工中继信道的分集复用折衷。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信