{"title":"具有递归非系统快速查找组成码的Turbo码","authors":"P. Massey, D. Costello","doi":"10.1109/ISIT.2001.936004","DOIUrl":null,"url":null,"abstract":"Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a \"recursive nonsystematic quick look-in\" code, and the other constituent code(s) is a \"big numerator accumulator\".","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Turbo codes with recursive nonsystematic quick-look-in constituent codes\",\"authors\":\"P. Massey, D. Costello\",\"doi\":\"10.1109/ISIT.2001.936004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a \\\"recursive nonsystematic quick look-in\\\" code, and the other constituent code(s) is a \\\"big numerator accumulator\\\".\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Turbo codes with recursive nonsystematic quick-look-in constituent codes
Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a "recursive nonsystematic quick look-in" code, and the other constituent code(s) is a "big numerator accumulator".