基于统一空时符号的Turbo码多路软输出Viterbi译码算法

Dapeng Zhang, Ju Liu, Qiangjun Niu, Hui Ji
{"title":"基于统一空时符号的Turbo码多路软输出Viterbi译码算法","authors":"Dapeng Zhang, Ju Liu, Qiangjun Niu, Hui Ji","doi":"10.1109/ICCSN.2009.85","DOIUrl":null,"url":null,"abstract":"UST symbol-based turbo code has recently been proposed which can reduce the system complexity and calculation amount compared with bit-wise concatenation scheme. However, the corresponding MAP decoding algorithm still makes hardware unbearable and later its simplified versions, Max-Log-MAP and Log-MAP algorithms, appeared. In this paper, we propose a multiary SOVA decoding algorithm for UST symbol-based turbo code. Using our UST symbol-based SOVA, soft output information from the prior iteration can be accepted as the a priori information for current iteration. Notably, the experimental results show that our algorithm can achieve close performance to Max-Log-MAP and Log-MAP algorithms with lower complexity. The performance of the SOVA and that of MAP algorithm are almost the same at a BER of 10-5, and is even better for a higher BER.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"129 Suppl 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-ary Soft Output Viterbi decoding Algorithm for Unitary Space-Time Symbol-Based Turbo Code\",\"authors\":\"Dapeng Zhang, Ju Liu, Qiangjun Niu, Hui Ji\",\"doi\":\"10.1109/ICCSN.2009.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"UST symbol-based turbo code has recently been proposed which can reduce the system complexity and calculation amount compared with bit-wise concatenation scheme. However, the corresponding MAP decoding algorithm still makes hardware unbearable and later its simplified versions, Max-Log-MAP and Log-MAP algorithms, appeared. In this paper, we propose a multiary SOVA decoding algorithm for UST symbol-based turbo code. Using our UST symbol-based SOVA, soft output information from the prior iteration can be accepted as the a priori information for current iteration. Notably, the experimental results show that our algorithm can achieve close performance to Max-Log-MAP and Log-MAP algorithms with lower complexity. The performance of the SOVA and that of MAP algorithm are almost the same at a BER of 10-5, and is even better for a higher BER.\",\"PeriodicalId\":177679,\"journal\":{\"name\":\"2009 International Conference on Communication Software and Networks\",\"volume\":\"129 Suppl 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Communication Software and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2009.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Communication Software and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2009.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近提出了一种基于UST符号的turbo码,与比特级联方式相比,它可以降低系统复杂度和计算量。然而,相应的MAP解码算法仍然让硬件难以忍受,后来出现了其简化版本Max-Log-MAP和Log-MAP算法。在本文中,我们提出了一种多SOVA解码算法,用于基于UST符号的turbo码。使用我们的基于UST符号的SOVA,之前迭代的软输出信息可以被接受为当前迭代的先验信息。值得注意的是,实验结果表明,该算法可以达到与Max-Log-MAP和Log-MAP算法相近的性能,且复杂度更低。当误码率为10-5时,SOVA算法的性能与MAP算法的性能基本相同,当误码率更高时,SOVA算法的性能甚至更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-ary Soft Output Viterbi decoding Algorithm for Unitary Space-Time Symbol-Based Turbo Code
UST symbol-based turbo code has recently been proposed which can reduce the system complexity and calculation amount compared with bit-wise concatenation scheme. However, the corresponding MAP decoding algorithm still makes hardware unbearable and later its simplified versions, Max-Log-MAP and Log-MAP algorithms, appeared. In this paper, we propose a multiary SOVA decoding algorithm for UST symbol-based turbo code. Using our UST symbol-based SOVA, soft output information from the prior iteration can be accepted as the a priori information for current iteration. Notably, the experimental results show that our algorithm can achieve close performance to Max-Log-MAP and Log-MAP algorithms with lower complexity. The performance of the SOVA and that of MAP algorithm are almost the same at a BER of 10-5, and is even better for a higher BER.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信