{"title":"一种奇偶交织Turbo码的低复杂度译码算法","authors":"Xiao Ma, Xiuni Wang, Lin Zhang","doi":"10.1109/ITW2.2006.323765","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel decoding schedule for turbo codes with odd-even interleavers. The proposed schedule has lower complexity and the same performance as the standard one","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Reduced-Complexity Decoding Algorithm for Turbo Codes with Odd-Even Interleavers\",\"authors\":\"Xiao Ma, Xiuni Wang, Lin Zhang\",\"doi\":\"10.1109/ITW2.2006.323765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel decoding schedule for turbo codes with odd-even interleavers. The proposed schedule has lower complexity and the same performance as the standard one\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Reduced-Complexity Decoding Algorithm for Turbo Codes with Odd-Even Interleavers
In this paper, we propose a novel decoding schedule for turbo codes with odd-even interleavers. The proposed schedule has lower complexity and the same performance as the standard one