Universal polar decoding with channel knowledge at the encoder

Polar coding over a class of binary input discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the symmetric capacity of convex and one-sided sets of channels. This result makes the polar decoder the first low complexity O(N logN) decoder proved to be universal over one sided sets of symmetric channels.

[1]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[2]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[3]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[4]  Lizhong Zheng,et al.  Linear Universal Decoding for Compound Channels , 2010, IEEE Transactions on Information Theory.

[5]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[6]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[7]  Thomas M. Fischer.  Some Remarks on the Role of Inaccuracy in Shannon’s Theory of Information Transmission , 1978 .

[8]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[9]  Mine Alsan.  A novel partial order for the information sets of polar codes over B-DMCs , 2014, 2014 IEEE International Symposium on Information Theory.

[10]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .