在极码的编码和解码中对低熵位使用确定性决策

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI:10.1109/ALLERTON.2015.7447169

Rémi A. Chou, M. Bloch

{"title":"在极码的编码和解码中对低熵位使用确定性决策","authors":"Rémi A. Chou, M. Bloch","doi":"10.1109/ALLERTON.2015.7447169","DOIUrl":null,"url":null,"abstract":"We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes\",\"authors\":\"Rémi A. Chou, M. Bloch\",\"doi\":\"10.1109/ALLERTON.2015.7447169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7447169\",\"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 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 33

摘要

我们展示了如何用确定性决策取代极性码编码和解码中的一些随机决策。具体来说，我们证明了低熵比特上的随机决策可以被argmax决策所取代，而不会损失任何性能。我们说明了这个结果在极性编码的情况下对Wyner-Ziv问题和信道编码的有用性。

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

查看原文本刊更多论文

Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes

We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.

求助全文

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

来源期刊

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

自引率

0.00%

发文量