{"title":"极性码的块顺序解码","authors":"Grigorii Trofimiuk, P. Trifonov","doi":"10.1109/ISWCS.2015.7454356","DOIUrl":null,"url":null,"abstract":"The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.","PeriodicalId":383105,"journal":{"name":"2015 International Symposium on Wireless Communication Systems (ISWCS)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Block sequential decoding of polar codes\",\"authors\":\"Grigorii Trofimiuk, P. Trifonov\",\"doi\":\"10.1109/ISWCS.2015.7454356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.\",\"PeriodicalId\":383105,\"journal\":{\"name\":\"2015 International Symposium on Wireless Communication Systems (ISWCS)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Symposium on Wireless Communication Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2015.7454356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2015.7454356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.