基于多项式回归函数的LTE Turbo译码改进Log-MAP算法

D. Nguyen, Hang Nguyen
{"title":"基于多项式回归函数的LTE Turbo译码改进Log-MAP算法","authors":"D. Nguyen, Hang Nguyen","doi":"10.1109/ICCW.2015.7247502","DOIUrl":null,"url":null,"abstract":"This paper proposes an improved Logarithmic Maximum A Posteriori (Log-MAP) algorithm for Turbo decoding in the Third Generation Partnership Project Long Term Evolution (3GPP LTE). In the proposed algorithm, we exploit the understanding of polynomial regression function to approximately compute the logarithm term (also called correction function) in the Jacobian logarithmic function. The goal is to replace the correction function with another function with the approximated performance and the reduced computational complexity. Simulation results show that the performance of the proposed algorithm is closest to the Log-MAP algorithm for Turbo decoding under Additive White Gaussian Noise (AWGN) channel and can offer about maximum 0.4dB performance gain than the Max-Log-MAP algorithm and higher than other Log-MAP-based algorithms. The proposed algorithm has much simpler computational complexity in comparison with the Log-MAP algorithm and slightly increased compared to the Max-Log-MAP algorithm.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"53 1","pages":"2163-2167"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An improved Log-MAP algorithm based on polynomial regression function for LTE Turbo decoding\",\"authors\":\"D. Nguyen, Hang Nguyen\",\"doi\":\"10.1109/ICCW.2015.7247502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an improved Logarithmic Maximum A Posteriori (Log-MAP) algorithm for Turbo decoding in the Third Generation Partnership Project Long Term Evolution (3GPP LTE). In the proposed algorithm, we exploit the understanding of polynomial regression function to approximately compute the logarithm term (also called correction function) in the Jacobian logarithmic function. The goal is to replace the correction function with another function with the approximated performance and the reduced computational complexity. Simulation results show that the performance of the proposed algorithm is closest to the Log-MAP algorithm for Turbo decoding under Additive White Gaussian Noise (AWGN) channel and can offer about maximum 0.4dB performance gain than the Max-Log-MAP algorithm and higher than other Log-MAP-based algorithms. The proposed algorithm has much simpler computational complexity in comparison with the Log-MAP algorithm and slightly increased compared to the Max-Log-MAP algorithm.\",\"PeriodicalId\":6464,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"volume\":\"53 1\",\"pages\":\"2163-2167\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2015.7247502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文提出了一种改进的对数最大后验(Log-MAP)算法,用于第三代合作伙伴计划长期演进(3GPP LTE)的Turbo解码。在该算法中,我们利用对多项式回归函数的理解来近似计算雅可比对数函数中的对数项(也称为校正函数)。目标是用另一个具有近似性能和降低计算复杂度的函数代替校正函数。仿真结果表明,该算法在加性高斯白噪声(AWGN)信道下的Turbo译码性能最接近Log-MAP算法,比Max-Log-MAP算法能提供最大0.4dB的性能增益,高于其他基于Log-MAP的算法。与Log-MAP算法相比,该算法的计算复杂度要小得多,而与Max-Log-MAP算法相比,该算法的计算复杂度略有提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved Log-MAP algorithm based on polynomial regression function for LTE Turbo decoding
This paper proposes an improved Logarithmic Maximum A Posteriori (Log-MAP) algorithm for Turbo decoding in the Third Generation Partnership Project Long Term Evolution (3GPP LTE). In the proposed algorithm, we exploit the understanding of polynomial regression function to approximately compute the logarithm term (also called correction function) in the Jacobian logarithmic function. The goal is to replace the correction function with another function with the approximated performance and the reduced computational complexity. Simulation results show that the performance of the proposed algorithm is closest to the Log-MAP algorithm for Turbo decoding under Additive White Gaussian Noise (AWGN) channel and can offer about maximum 0.4dB performance gain than the Max-Log-MAP algorithm and higher than other Log-MAP-based algorithms. The proposed algorithm has much simpler computational complexity in comparison with the Log-MAP algorithm and slightly increased compared to the Max-Log-MAP algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CI/DS-CDMA scheme for autonomous underwater vehicle communication Optimising OFDM based visible light communication for high throughput and reduced PAPR A channel sensing based design for LTE in unlicensed bands Local and cooperative spectrum sensing via Kuiper's test Delay-aware energy-efficient communications over Nakagami-m fading channel with MMPP traffic
×
引用
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