On Polar Coding for Binary Dirty Paper

Barak Beilin, David Burshtein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL) decoding with properly defined CRC is used for channel coding, and SCL encoding without CRC is used for source coding. The performance is compared to the best achievable rate of any coding scheme for binary DP using nested codes. A well known problem with nested polar codes for binary DP is the existence of frozen channel code bits that are not frozen in the source code. These bits need to be retransmitted in a second phase of the scheme, thus reducing transmission rate. We observe that the number of these bits is typically either zero or a small number, and provide an improved analysis, compared to that presented in the literature, on the size of this set and on its scaling with respect to the blocklength when the power constraint parameter is sufficiently large or the channel crossover probability sufficiently small.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1402-1406
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July
ISSN (Print)2157-8095

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/TerritoryFrance
CityParis
Period7/07/1912/07/19

Fingerprint

Dive into the research topics of 'On Polar Coding for Binary Dirty Paper'. Together they form a unique fingerprint.

Cite this