Construction of Polar Codes Exploiting Channel Transformation Structure


C. Schnelling, A. Schmeink,


        Polar Codes are the first binary linear codes that provably achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels. Their construction is explicit as implied by the transformations that lead to channel polarization, and low-complexity encoding and decoding methods are available. While being explicitly defined, exact construction is intractable as it depends on calculating channel parameters of channels whose output alphabets grow exponentially in the code length. To overcome this problem, heuristics have been proposed. In this work, we show how to accelerate one popular construction method by introducing two modifications to the channel transformation step, leaving quality of the results unaffected.



Approximation methods;Decoding;Estimation;Memoryless systems;Time complexity;Upper bound;Channel polarization;code construction;polar codes

BibTEX Reference Entry 

	author = {Christopher Schnelling and Anke Schmeink},
	title = "Construction of Polar Codes Exploiting Channel Transformation Structure",
	pages = "2058-2061",
	journal = "{IEEE} Communications Letters",
	volume = "19",
	number = "12",
	doi = 10.1109/LCOMM.2015.2450739,
	month = Dec,
	year = 2015,
	hsb = RWTH-2016-00007,


 Download bibtex-file

Sorry, this paper is currently not available for download.