Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao
{"title":"基于极性的Turbo产品码的近最优解码","authors":"Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao","doi":"10.1109/WCSP.2019.8927852","DOIUrl":null,"url":null,"abstract":"In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Near Optimal Decoding of Polar-based Turbo Product Codes\",\"authors\":\"Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao\",\"doi\":\"10.1109/WCSP.2019.8927852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.\",\"PeriodicalId\":108635,\"journal\":{\"name\":\"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2019.8927852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2019.8927852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Near Optimal Decoding of Polar-based Turbo Product Codes
In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.