列表Viterbi算法在卷积码空间任务中的应用

Riccardo Schiavone, R. Garello, G. Liva
{"title":"列表Viterbi算法在卷积码空间任务中的应用","authors":"Riccardo Schiavone, R. Garello, G. Liva","doi":"10.1109/TTC55771.2022.9975785","DOIUrl":null,"url":null,"abstract":"Currently, several space missions are still using convolutional codes, which are among the available coding options of the CCSDS telemetry recommendation. When convolutional codes are employed, the CCSDS specification mandates the use of an outer CRC code to perform error detection over the transfer frame. Alternatively, the CRC code may be used, together with list Viterbi decoding of the inner convolutional code, to significantly improve the performance of the coding scheme. In this paper, we first compute the distance spectrum of the concatenation of the outer CRC code and the inner convolutional codes recommended by the CCSDS. By means of a union bound on the block error probability under maximum-likelihood decoding, we estimate the extra coding gain achievable by the concatenation with respect to the use of the Viterbi algorithm applied to the decoding of the inner convolutional code only. The extra coding gain is close to 3 dB. Then, we consider the application of the list Viterbi algorithm and we discuss some techniques useful to reduce its complexity in practical implementations. Results show that it is possible to approach the 3 dB extra coding gain with negligible increase in the decoding complexity with respect to Viterbi decoding of the inner convolutional code.","PeriodicalId":303926,"journal":{"name":"2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Application of List Viterbi Algorithms to Improve the Performance in Space Missions using Convolutional Codes\",\"authors\":\"Riccardo Schiavone, R. Garello, G. Liva\",\"doi\":\"10.1109/TTC55771.2022.9975785\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Currently, several space missions are still using convolutional codes, which are among the available coding options of the CCSDS telemetry recommendation. When convolutional codes are employed, the CCSDS specification mandates the use of an outer CRC code to perform error detection over the transfer frame. Alternatively, the CRC code may be used, together with list Viterbi decoding of the inner convolutional code, to significantly improve the performance of the coding scheme. In this paper, we first compute the distance spectrum of the concatenation of the outer CRC code and the inner convolutional codes recommended by the CCSDS. By means of a union bound on the block error probability under maximum-likelihood decoding, we estimate the extra coding gain achievable by the concatenation with respect to the use of the Viterbi algorithm applied to the decoding of the inner convolutional code only. The extra coding gain is close to 3 dB. Then, we consider the application of the list Viterbi algorithm and we discuss some techniques useful to reduce its complexity in practical implementations. Results show that it is possible to approach the 3 dB extra coding gain with negligible increase in the decoding complexity with respect to Viterbi decoding of the inner convolutional code.\",\"PeriodicalId\":303926,\"journal\":{\"name\":\"2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TTC55771.2022.9975785\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TTC55771.2022.9975785","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

目前,若干空间任务仍在使用卷积码,这是CCSDS遥测建议中可用的编码选项之一。当使用卷积码时,CCSDS规范要求使用外部CRC码在传输帧上执行错误检测。也可以将CRC码与内卷积码的list Viterbi解码一起使用,从而显著提高编码方案的性能。在本文中,我们首先计算了CCSDS推荐的外CRC码与内卷积码串联的距离谱。通过最大似然译码下的块错误概率的联合界,我们估计了相对于使用仅用于内卷积码译码的Viterbi算法,通过串接实现的额外编码增益。额外的编码增益接近3db。然后,我们考虑了列表Viterbi算法的应用,并讨论了在实际实现中降低其复杂性的一些有用技术。结果表明,相对于内卷积码的Viterbi解码,在解码复杂度可以忽略不计的情况下,可以接近3db的额外编码增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Application of List Viterbi Algorithms to Improve the Performance in Space Missions using Convolutional Codes
Currently, several space missions are still using convolutional codes, which are among the available coding options of the CCSDS telemetry recommendation. When convolutional codes are employed, the CCSDS specification mandates the use of an outer CRC code to perform error detection over the transfer frame. Alternatively, the CRC code may be used, together with list Viterbi decoding of the inner convolutional code, to significantly improve the performance of the coding scheme. In this paper, we first compute the distance spectrum of the concatenation of the outer CRC code and the inner convolutional codes recommended by the CCSDS. By means of a union bound on the block error probability under maximum-likelihood decoding, we estimate the extra coding gain achievable by the concatenation with respect to the use of the Viterbi algorithm applied to the decoding of the inner convolutional code only. The extra coding gain is close to 3 dB. Then, we consider the application of the list Viterbi algorithm and we discuss some techniques useful to reduce its complexity in practical implementations. Results show that it is possible to approach the 3 dB extra coding gain with negligible increase in the decoding complexity with respect to Viterbi decoding of the inner convolutional code.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信