一个有效的软件无线电实现的UMTS turbo编解码器

M. Valenti
{"title":"一个有效的软件无线电实现的UMTS turbo编解码器","authors":"M. Valenti","doi":"10.1109/PIMRC.2001.965330","DOIUrl":null,"url":null,"abstract":"This paper addresses some critical implementation issues involved in the development of a turbo decoder, using the UMTS specification as a concrete example. The assumption is that the decoder is to be implemented in software rather than hardware, and thus a variable number of decoder iterations is not only possible, but desirable. Three twists on the decoding algorithm am proposed: (1) a linear approximation of the correction function used by the max* operator which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion which yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.","PeriodicalId":318292,"journal":{"name":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"An efficient software radio implementation of the UMTS turbo codec\",\"authors\":\"M. Valenti\",\"doi\":\"10.1109/PIMRC.2001.965330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses some critical implementation issues involved in the development of a turbo decoder, using the UMTS specification as a concrete example. The assumption is that the decoder is to be implemented in software rather than hardware, and thus a variable number of decoder iterations is not only possible, but desirable. Three twists on the decoding algorithm am proposed: (1) a linear approximation of the correction function used by the max* operator which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion which yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.\",\"PeriodicalId\":318292,\"journal\":{\"name\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"volume\":\"218 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2001.965330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2001.965330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

本文以UMTS规范为具体示例,解决了turbo解码器开发中涉及的一些关键实现问题。假设解码器将在软件而不是硬件中实现,因此可变数量的解码器迭代不仅是可能的,而且是可取的。本文对译码算法进行了三种改进:(1)对max*算子使用的校正函数进行线性逼近,在降低译码复杂度的同时,对误码率的影响可以忽略不计;(2)一种将反向递归归一化的方法,这种方法可以节省12.5%的内存使用;(3)一种仅基于对数似然比停止解码器迭代的简单方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient software radio implementation of the UMTS turbo codec
This paper addresses some critical implementation issues involved in the development of a turbo decoder, using the UMTS specification as a concrete example. The assumption is that the decoder is to be implemented in software rather than hardware, and thus a variable number of decoder iterations is not only possible, but desirable. Three twists on the decoding algorithm am proposed: (1) a linear approximation of the correction function used by the max* operator which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion which yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信