{"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}
引用次数: 18
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.