Polarization for arbitrary discrete memoryless channels

Understand

Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels.

• Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for the binary case leads to polarization.
• This method can be extended to channels of composite input alphabet sizes by decomposing such channels into a set of channels with prime input alphabet sizes.
• It is also shown that all discrete memoryless channels can be polarized by randomized constructions.