Design Of Polar Communication System Using Maximum Likelihood Decoding



The recently-discovered polar codes are seen as a major breakthrough in coding concept; they provably accomplish the academic capacity of distinct memory much less networks using the reduced complexity successive termination (SC) translating formula. Motivated by current growths in polar coding theory, we recommend a household of effective equipment applications for SC polar decoders. Nevertheless, these previous efforts concentrated on design of polar decoders through deterministic computation, while the behavior of stochastic polar decoder, which can have prospective advantages such as low complexity as well as strong error-resilience, has not been studied in existing literary works. This paper, for the very first time, checks out polar decoding making use of stochastic logic. Especially, the commonly-used succeeding termination (SC) algorithm is reformulated into the stochastic type. Several techniques that can potentially boost translating performance are reviewed and also evaluated. Simulation results reveal that a stochastic SC decoder can attain comparable error-correcting performance as its deterministic counterpart. This work can lead the way for future equipment style of stochastic polar codes decoders.


E. Arikan, “Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels,” IEEE Trans. on Inform. Theory, vol. 55, no. 7, pp. 3051 –3073, Jul. 2009.

I. Tal and A. Vardy, “How to construct polar codes,” submitted to IEEE Trans. Inform. Theory, available online as arXiv:1105.6164v2, 2011.

E. Sasoglu, E. Telatar, and E. Arikan, “Polarization for arbitrary discrete memoryless channels,” in Proc. IEEE Information Theory Workshop ITW 2009, 2009, pp. 144–148.

H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,” in IEEE ISIT 2010, Jun. 2010, pp. 913 –917.

N. Hussami, R. Urbanke, and S.B. Korada, “Performance of polar codes for channel and source coding,” in IEEE ISIT 2009, Jun. 2009, pp. 1488 –1492.

Ido Tal and Alexander Vardy, “List decoding of polar codes,” in Proc. (ISIT) Symp. IEEE Int Information Theory, 2011.

R. Gallager, Information Theory and Reliable Communications, John Wiley, New York, 1968.

M.P.C. Fossorier, M. Mihaljevic, and H. Imai, “Reduced complexity iterative decoding of low-density parity check codes based on belief propagation,” IEEE Trans. on Comm., vol. 47, no. 5, pp. 673 –680, May. 1999.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2018, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at