Polarization for arbitrary discrete memoryless channels

Details Polarization for arbitrary discrete memoryless channels Polarization for arbitrary discrete memoryless channels

2009-08-03

arxiv.org/abs/0908.0302v1

Computer Science

Information Theory

12 pages

Scientific paper

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. The introduction of randomness does not change the order of complexity of polar code construction, encoding, and decoding. A previous result on the error probability behavior of polar codes is also extended to the case of arbitrary discrete memoryless channels. The generalization of polarization to channels with arbitrary finite input alphabet sizes leads to polar-coding methods for approaching the true (as opposed to symmetric) channel capacity of arbitrary channels with discrete or continuous input alphabets.

Affiliated with

Also associated with

No associations

Rating

Polarization for 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 Polarization for arbitrary discrete memoryless channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polarization for arbitrary discrete memoryless channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454345