{"title":"卫星预编码系统中帧头非相干检测的编码设计","authors":"F. Kayhan, G. Montorsi","doi":"10.1109/ASMS-SPSC.2018.8510735","DOIUrl":null,"url":null,"abstract":"In this paper we propose a simple method for generating binary short-length rate-compatiblefamilies of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codeswith respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N = 256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulationsto evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems\",\"authors\":\"F. Kayhan, G. Montorsi\",\"doi\":\"10.1109/ASMS-SPSC.2018.8510735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a simple method for generating binary short-length rate-compatiblefamilies of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codeswith respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N = 256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulationsto evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.\",\"PeriodicalId\":362263,\"journal\":{\"name\":\"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASMS-SPSC.2018.8510735\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASMS-SPSC.2018.8510735","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们提出了一种简单的方法来生成二进制短长度码族,这些码族对M-PSK星座的非相干检测具有鲁棒性。我们首先使用贪婪算法构造了一组关于M-PSK调制的旋转不变码。然后,通过适当修改这些编码,我们获得了对非相干检测具有鲁棒性的编码。对于QPSK星座的一个特殊情况,我们使用我们的算法创建长度为N = 256的二进制码。我们的方法提供了具有给定期望非相干距离的最优码长度的上界。我们简要讨论了该方案的最优性,并提供了几个模拟来评估性能。最后,我们讨论了具有期望码字错误概率(CEP)的帧头的码构造问题,并推导了给定非相干距离下码的CEP的简单上界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems
In this paper we propose a simple method for generating binary short-length rate-compatiblefamilies of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codeswith respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N = 256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulationsto evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ASMS/SPSC 2018 Index Controlled Delay Scheduler for VoIP over LEO constellations on LMS channels A Design Method of Cognitive Overlay Links for Satellite Communications Cross-Layer Forward Packet Scheduling for Emerging Precoded Broadband Multibeam Satellite System ASMS/SPSC 2018 Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop
×
引用
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