Polar code (coding theory)

In information theory, a polar code is a linear block error correcting code developed by Erdal Arıkan.[1] It is the first code with an explicit construction to provably achieve the channel capacity for symmetric binary-input, discrete, memoryless channels (B-DMC) with polynomial dependence on the gap to capacity. Notably, polar codes have encoding and decoding complexity O(n \log n), which makes them practical for many applications.

Simulating Polar Codes

One can implement a simulation environment of polar codes in any programming language such as MATLAB, C++ etc.

It typically involves modelling an encoder, a decoder, a channel (such as AWGN, BSC, BEC), and a code-construction module.

An example MATLAB implementation is available at,[2] including a series of introductory video tutorials.

See also

References

  1. ↑ Arikan, E. (July 2009). "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels". IEEE Transactions on Information Theory 55 (7): 3051–73. arXiv:0807.3917v5. doi:10.1109/TIT.2009.2021379.
  2. ↑ "www.polarcodes.com". Resources on Polar Codes.


This article is issued from Wikipedia - version of the Monday, March 21, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.