{"title":"Two methods to increase the minimum distance for turbo codes with QPP interleavers","authors":"L. Trifina, V. Munteanu, D. Tarniceriu","doi":"10.1109/ISSCS.2009.5206138","DOIUrl":null,"url":null,"abstract":"Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to interleavers proposed by Takeshita in [1]. The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Ω′ metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for various lengths show the efficiency of the proposed methods.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on Signals, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2009.5206138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to interleavers proposed by Takeshita in [1]. The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Ω′ metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for various lengths show the efficiency of the proposed methods.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
