极性码的快速列表解码:附加节点的解码器

2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) Pub Date : 2018-04-15 DOI:10.1109/WCNCW.2018.8369002

M. Hanif, Maryam Haghighi Ardakani, M. Ardakani

{"title":"极性码的快速列表解码:附加节点的解码器","authors":"M. Hanif, Maryam Haghighi Ardakani, M. Ardakani","doi":"10.1109/WCNCW.2018.8369002","DOIUrl":null,"url":null,"abstract":"This work focuses on fast successive-cancellation list decoding of polar codes. We propose list decoders for five newly-identified types of nodes in the decoding tree of a polar code. The proposed list decoders significantly improve the decoding speed by determining the best paths and calculating their corresponding path metrics without computing bit log-likelihood ratios.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Fast list decoding of polar codes: Decoders for additional nodes\",\"authors\":\"M. Hanif, Maryam Haghighi Ardakani, M. Ardakani\",\"doi\":\"10.1109/WCNCW.2018.8369002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work focuses on fast successive-cancellation list decoding of polar codes. We propose list decoders for five newly-identified types of nodes in the decoding tree of a polar code. The proposed list decoders significantly improve the decoding speed by determining the best paths and calculating their corresponding path metrics without computing bit log-likelihood ratios.\",\"PeriodicalId\":122391,\"journal\":{\"name\":\"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW.2018.8369002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2018.8369002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

本文主要研究了极化码的快速连续消列译码。我们提出了五种新识别的极点码解码树节点类型的列表解码器。所提出的列表解码器通过确定最佳路径并计算其相应的路径度量，而无需计算位对数似然比，从而显着提高了解码速度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast list decoding of polar codes: Decoders for additional nodes

This work focuses on fast successive-cancellation list decoding of polar codes. We propose list decoders for five newly-identified types of nodes in the decoding tree of a polar code. The proposed list decoders significantly improve the decoding speed by determining the best paths and calculating their corresponding path metrics without computing bit log-likelihood ratios.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

自引率

0.00%

发文量