Multilevel polarization of polar codes over arbitrary discrete memoryless channels
Authors:
- 1 September 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1718-1725
Abstract
It is shown that the original construction of polar codes suffices to achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two, levels so that the synthesized channels are either useless, perfect or "partially perfect". Given a coset decomposition of the input alphabet, there exists a corresponding partially perfect channel whose outputs uniquely determine the coset where the channel input symbol belongs to. By a slight modification of the encoding and decoding rules, it is shown that perfect transmission of certain information letters over partially perfect channels is possible. It is also shown through an example that polar codes do not achieve the capacity of coset codes over arbitrary channels.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Multilevel polarization for nonbinary codes and parallel channels2011
- On the capacity of Abelian group codes over discrete memoryless channels2011
- Channel polarization on q-ary discrete memoryless channels by arbitrary kernels2010
- Polarization for arbitrary discrete memoryless channels2009
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009