非相干信道中的检测误差概率

Daniel J. Ryan, I. Clarkson, I. Collings
{"title":"非相干信道中的检测误差概率","authors":"Daniel J. Ryan, I. Clarkson, I. Collings","doi":"10.1109/ISIT.2005.1523409","DOIUrl":null,"url":null,"abstract":"This paper presents performance bounds for block-based detection of PAM and QAM transmitted over non-coherent channels. Such channels give rise to inherent detection ambiguities since multiple possible transmit sequences can have the same likelihood. The number of ambiguous sequences is a function of the block length. In this paper, we derive the probability of detection error in terms of a Dedekind zeta function of the block length, for infinite-sized constellations and zero noise. We also provide expressions for finite constellations which can be evaluated in polynomial time with the constellation size, as opposed to checking all possible sequences","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Detection error probabilities in noncoherent channels\",\"authors\":\"Daniel J. Ryan, I. Clarkson, I. Collings\",\"doi\":\"10.1109/ISIT.2005.1523409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents performance bounds for block-based detection of PAM and QAM transmitted over non-coherent channels. Such channels give rise to inherent detection ambiguities since multiple possible transmit sequences can have the same likelihood. The number of ambiguous sequences is a function of the block length. In this paper, we derive the probability of detection error in terms of a Dedekind zeta function of the block length, for infinite-sized constellations and zero noise. We also provide expressions for finite constellations which can be evaluated in polynomial time with the constellation size, as opposed to checking all possible sequences\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文给出了基于块的非相干信道上传输的PAM和QAM检测的性能界限。由于多个可能的传输序列可能具有相同的似然,因此这种信道产生固有的检测模糊性。歧义序列的数量是块长度的函数。在这篇论文中,我们导出了在无限大的星座和零噪声条件下,用块长度的Dedekind zeta函数来表示检测误差的概率。我们还提供了有限星座的表达式,它可以在多项式时间内计算星座大小,而不是检查所有可能的序列
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Detection error probabilities in noncoherent channels
This paper presents performance bounds for block-based detection of PAM and QAM transmitted over non-coherent channels. Such channels give rise to inherent detection ambiguities since multiple possible transmit sequences can have the same likelihood. The number of ambiguous sequences is a function of the block length. In this paper, we derive the probability of detection error in terms of a Dedekind zeta function of the block length, for infinite-sized constellations and zero noise. We also provide expressions for finite constellations which can be evaluated in polynomial time with the constellation size, as opposed to checking all possible sequences
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Upper bounds on the rate of LDPC codes as a function of minimum distance A wireless network can achieve maximum throughput without each node meeting all others Optimal linear decentralized estimation in a bandwidth constrained sensor network Near BER optimal partial response codes Bounds on mutual information rates of noisy channels with timing errors
×
引用
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