{"title":"新的三重纠错二进制BCH码解码器","authors":"Xie Zhi-yuan, Li Na, L. Le-le","doi":"10.1109/ICIEA.2008.4582754","DOIUrl":null,"url":null,"abstract":"A step-by-step decoding algorithm is introduced for triple-error correcting binary BCH codes of length n = 2<sup>m</sup> -1. The error bit can be directly determined by this algorithm, and the computation is simple and regular. Based on the analysis of the decoding algorithm, the hardware decoder is improved in continuous decoding condition. Furthermore, a new method for the key point of this algorithm, the look-up table of (x<sub>1</sub> <sup>'</sup>)<sup>5</sup> + (x<sub>2</sub> <sup>'</sup>)<sup>5</sup>, is presented to simplify the difficult hardware decoder.","PeriodicalId":309894,"journal":{"name":"2008 3rd IEEE Conference on Industrial Electronics and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"New decoder for triple-error-correcting binary BCH codes\",\"authors\":\"Xie Zhi-yuan, Li Na, L. Le-le\",\"doi\":\"10.1109/ICIEA.2008.4582754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A step-by-step decoding algorithm is introduced for triple-error correcting binary BCH codes of length n = 2<sup>m</sup> -1. The error bit can be directly determined by this algorithm, and the computation is simple and regular. Based on the analysis of the decoding algorithm, the hardware decoder is improved in continuous decoding condition. Furthermore, a new method for the key point of this algorithm, the look-up table of (x<sub>1</sub> <sup>'</sup>)<sup>5</sup> + (x<sub>2</sub> <sup>'</sup>)<sup>5</sup>, is presented to simplify the difficult hardware decoder.\",\"PeriodicalId\":309894,\"journal\":{\"name\":\"2008 3rd IEEE Conference on Industrial Electronics and Applications\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 3rd IEEE Conference on Industrial Electronics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEA.2008.4582754\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 3rd IEEE Conference on Industrial Electronics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA.2008.4582754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New decoder for triple-error-correcting binary BCH codes
A step-by-step decoding algorithm is introduced for triple-error correcting binary BCH codes of length n = 2m -1. The error bit can be directly determined by this algorithm, and the computation is simple and regular. Based on the analysis of the decoding algorithm, the hardware decoder is improved in continuous decoding condition. Furthermore, a new method for the key point of this algorithm, the look-up table of (x1')5 + (x2')5, is presented to simplify the difficult hardware decoder.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
