Daniel Nicolas Bailon, Johann-Philipp Thiers, J. Freudenberger
{"title":"基于Plotkin结构和BCH分量码的级联码软输入译码","authors":"Daniel Nicolas Bailon, Johann-Philipp Thiers, J. Freudenberger","doi":"10.1109/ICCE-Berlin50680.2020.9352179","DOIUrl":null,"url":null,"abstract":"Low latency communication requires soft-input decoding of binary block codes with small to medium block lengths. In this work, we consider generalized multiple concatenated (GMC) codes based on the Plotkin construction. These codes are similar to Reed-Muller (RM) codes. In contrast to RM codes, BCH codes are employed as component codes. This leads to improved code parameters. Moreover, a decoding algorithm is proposed that exploits the recursive structure of the concatenation. This algorithm enables efficient soft-input decoding of binary block codes with small to medium lengths. The proposed codes and their decoding achieve significant performance gains compared with RM codes and recursive GMC decoding.","PeriodicalId":438631,"journal":{"name":"2020 IEEE 10th International Conference on Consumer Electronics (ICCE-Berlin)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Soft-input decoding of concatenated codes based on the Plotkin construction and BCH component codes\",\"authors\":\"Daniel Nicolas Bailon, Johann-Philipp Thiers, J. Freudenberger\",\"doi\":\"10.1109/ICCE-Berlin50680.2020.9352179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Low latency communication requires soft-input decoding of binary block codes with small to medium block lengths. In this work, we consider generalized multiple concatenated (GMC) codes based on the Plotkin construction. These codes are similar to Reed-Muller (RM) codes. In contrast to RM codes, BCH codes are employed as component codes. This leads to improved code parameters. Moreover, a decoding algorithm is proposed that exploits the recursive structure of the concatenation. This algorithm enables efficient soft-input decoding of binary block codes with small to medium lengths. The proposed codes and their decoding achieve significant performance gains compared with RM codes and recursive GMC decoding.\",\"PeriodicalId\":438631,\"journal\":{\"name\":\"2020 IEEE 10th International Conference on Consumer Electronics (ICCE-Berlin)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 10th International Conference on Consumer Electronics (ICCE-Berlin)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCE-Berlin50680.2020.9352179\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 10th International Conference on Consumer Electronics (ICCE-Berlin)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE-Berlin50680.2020.9352179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Soft-input decoding of concatenated codes based on the Plotkin construction and BCH component codes
Low latency communication requires soft-input decoding of binary block codes with small to medium block lengths. In this work, we consider generalized multiple concatenated (GMC) codes based on the Plotkin construction. These codes are similar to Reed-Muller (RM) codes. In contrast to RM codes, BCH codes are employed as component codes. This leads to improved code parameters. Moreover, a decoding algorithm is proposed that exploits the recursive structure of the concatenation. This algorithm enables efficient soft-input decoding of binary block codes with small to medium lengths. The proposed codes and their decoding achieve significant performance gains compared with RM codes and recursive GMC decoding.