{"title":"涡轮产品代码的q次迭代解码算法","authors":"D. Cunha, Vagner Nascimento, Jaime Portugheis","doi":"10.14209/sbrt.2008.42818","DOIUrl":null,"url":null,"abstract":"— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modification of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is verified that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Um Algoritmo de Decodificação Iterativa q-ária para Códigos Turbo Produto\",\"authors\":\"D. Cunha, Vagner Nascimento, Jaime Portugheis\",\"doi\":\"10.14209/sbrt.2008.42818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modification of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is verified that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm\",\"PeriodicalId\":340055,\"journal\":{\"name\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14209/sbrt.2008.42818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/sbrt.2008.42818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Um Algoritmo de Decodificação Iterativa q-ária para Códigos Turbo Produto
— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modification of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is verified that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm