解码和转发继电器的逐位组合

Namshik Kim, J. Barry
{"title":"解码和转发继电器的逐位组合","authors":"Namshik Kim, J. Barry","doi":"10.1109/WCNCW.2012.6215476","DOIUrl":null,"url":null,"abstract":"We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bit-wise combining for decode-and-forward relays\",\"authors\":\"Namshik Kim, J. Barry\",\"doi\":\"10.1109/WCNCW.2012.6215476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.\",\"PeriodicalId\":392329,\"journal\":{\"name\":\"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW.2012.6215476\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2012.6215476","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑将从译码转发中继接收到的信号与从源接收到的信号相结合的问题。作为高复杂性最大似然组合策略的替代方案,我们提出了一种比特组合策略,该策略首先将接收到的信号转换为对数似然值,然后再进行组合。我们表明,在位约束下,二进制字母的最佳组合策略-最小化错误概率-在添加源对数似然值之前对中继对数似然值应用s型非线性。与最大比组合策略不同的是,该策略在瑞利衰落的译码转发中继信道中没有分集,而该策略的分集阶最大为2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bit-wise combining for decode-and-forward relays
We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信