M. Abou El Dahab, E. Abd El Naiem, A.M. Abou El Wafa, M.M. Foda
{"title":"一种解码BCH码的反向乘法算法(BMA)","authors":"M. Abou El Dahab, E. Abd El Naiem, A.M. Abou El Wafa, M.M. Foda","doi":"10.1109/NRSC.2001.929398","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel algorithm by which linear block codes could be decoded more easily than by existing decoding techniques. The algorithm is called \"back multiplication algorithm\" or BMA. This algorithm has the advantage of being easy to implement and offers less latency for the decoded message. However, it has some limitations concerning a number of codewords which do not follow the decoding process. Application is made to BCH codes types (15,7),(15,5) and satisfactory results are obtained. The limitation is observed when the algorithm is applied to BCH code (31,21).","PeriodicalId":123517,"journal":{"name":"Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A back multiplication algorithm (BMA) for decoding BCH codes\",\"authors\":\"M. Abou El Dahab, E. Abd El Naiem, A.M. Abou El Wafa, M.M. Foda\",\"doi\":\"10.1109/NRSC.2001.929398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a novel algorithm by which linear block codes could be decoded more easily than by existing decoding techniques. The algorithm is called \\\"back multiplication algorithm\\\" or BMA. This algorithm has the advantage of being easy to implement and offers less latency for the decoded message. However, it has some limitations concerning a number of codewords which do not follow the decoding process. Application is made to BCH codes types (15,7),(15,5) and satisfactory results are obtained. The limitation is observed when the algorithm is applied to BCH code (31,21).\",\"PeriodicalId\":123517,\"journal\":{\"name\":\"Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRSC.2001.929398\",\"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 of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.2001.929398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A back multiplication algorithm (BMA) for decoding BCH codes
In this paper, we present a novel algorithm by which linear block codes could be decoded more easily than by existing decoding techniques. The algorithm is called "back multiplication algorithm" or BMA. This algorithm has the advantage of being easy to implement and offers less latency for the decoded message. However, it has some limitations concerning a number of codewords which do not follow the decoding process. Application is made to BCH codes types (15,7),(15,5) and satisfactory results are obtained. The limitation is observed when the algorithm is applied to BCH code (31,21).