Kohei Ueda, Satoshi Suyama, Satoshi Nagata, N. Miki
{"title":"BP解码器下极性码的信息集优化","authors":"Kohei Ueda, Satoshi Suyama, Satoshi Nagata, N. Miki","doi":"10.1109/APWCS60142.2023.10234068","DOIUrl":null,"url":null,"abstract":"Application of the belief propagation (BP) decoding on the polar codes is one of the promising solutions for achieving low latency. To compensate for performance degradation caused by the BP decoding, we proposed the iterative algorithm to obtain the information set optimized for the BP decoding. By employing the proposed iterative algorithm, the performance were improved compared to the performance employing the information set optimized for the successive cancellation decoding.","PeriodicalId":375211,"journal":{"name":"2023 VTS Asia Pacific Wireless Communications Symposium (APWCS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Information Set Optimization for Polar Codes Under BP Decoder\",\"authors\":\"Kohei Ueda, Satoshi Suyama, Satoshi Nagata, N. Miki\",\"doi\":\"10.1109/APWCS60142.2023.10234068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Application of the belief propagation (BP) decoding on the polar codes is one of the promising solutions for achieving low latency. To compensate for performance degradation caused by the BP decoding, we proposed the iterative algorithm to obtain the information set optimized for the BP decoding. By employing the proposed iterative algorithm, the performance were improved compared to the performance employing the information set optimized for the successive cancellation decoding.\",\"PeriodicalId\":375211,\"journal\":{\"name\":\"2023 VTS Asia Pacific Wireless Communications Symposium (APWCS)\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 VTS Asia Pacific Wireless Communications Symposium (APWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APWCS60142.2023.10234068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 VTS Asia Pacific Wireless Communications Symposium (APWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APWCS60142.2023.10234068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Information Set Optimization for Polar Codes Under BP Decoder
Application of the belief propagation (BP) decoding on the polar codes is one of the promising solutions for achieving low latency. To compensate for performance degradation caused by the BP decoding, we proposed the iterative algorithm to obtain the information set optimized for the BP decoding. By employing the proposed iterative algorithm, the performance were improved compared to the performance employing the information set optimized for the successive cancellation decoding.