Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels

Details Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels

2011-07-07

arxiv.org/abs/1107.1535v2

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221670