{"title":"RS(255,223)码在串联译码系统中的研究","authors":"Lei Fang, Yu Zhang, Jun Zhu, Jianxin Yang","doi":"10.1109/ICIST.2013.6747764","DOIUrl":null,"url":null,"abstract":"RS(255,223) code is used in concatenated code system for its strong error-correcting ability for burst error. The most important problem of the design of RS decoder is the key equation solution (KES). In this paper, BM iterative decoding algorithms for KES is introduced, and its implementation structure is also described. Simulation shows that the designed RS(255,223) has suffi ciently met the requirement of throughput in the concatenated decoder.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on RS(255,223) code in concatenated decoder system\",\"authors\":\"Lei Fang, Yu Zhang, Jun Zhu, Jianxin Yang\",\"doi\":\"10.1109/ICIST.2013.6747764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"RS(255,223) code is used in concatenated code system for its strong error-correcting ability for burst error. The most important problem of the design of RS decoder is the key equation solution (KES). In this paper, BM iterative decoding algorithms for KES is introduced, and its implementation structure is also described. Simulation shows that the designed RS(255,223) has suffi ciently met the requirement of throughput in the concatenated decoder.\",\"PeriodicalId\":415759,\"journal\":{\"name\":\"2013 IEEE Third International Conference on Information Science and Technology (ICIST)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Third International Conference on Information Science and Technology (ICIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST.2013.6747764\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2013.6747764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on RS(255,223) code in concatenated decoder system
RS(255,223) code is used in concatenated code system for its strong error-correcting ability for burst error. The most important problem of the design of RS decoder is the key equation solution (KES). In this paper, BM iterative decoding algorithms for KES is introduced, and its implementation structure is also described. Simulation shows that the designed RS(255,223) has suffi ciently met the requirement of throughput in the concatenated decoder.