{"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}
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.