On bit error rate performance of polar codes in finite regime

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 188-194

  Eslami, A ^a   Pishro Nik, H ^a  

^a University of Massachusetts at Amherst   (United States)

Author keywords

Belief propagation; Binary erasure channel; Error floor; Polar codes

Indexed keywords

BELIEF PROPAGATION; BELIEF PROPAGATION DECODING; BER PERFORMANCE; BINARY ERASURE CHANNEL; BIT ERROR RATE PERFORMANCE; BIT ERROR RATE SIMULATIONS; DECODING FAILURE; ERROR FLOOR; GAUSSIAN CHANNELS; LDPC CODES; LOW COMPLEXITY; MEMORYLESS CHANNELS; ORDERS OF MAGNITUDE; POLAR CODES; STOPPING DISTANCE; STOPPING SET;

ALGORITHMS; BACKPROPAGATION; DECODING; ERROR CORRECTION; FLOORS; SIGNAL ENCODING;

BIT ERROR RATE;

EID: 79952418090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706906     Document Type: Conference Paper

References (24)

1. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Transactions o Information Theory, vol. 55, pp. 3051-3073, July 2009.
2. E. Arikan, "Source polarization," in IEEE International Symposium on Information Theory (ISIT), June 2010.
3. E. Arikan, "A performance comparison of polar codes and reed-muller codes," IEEE Communications Letters, vol. 12, no. 6, pp. 447-449, 2008.
4. N. Hussami, S. Korada, and R. Urbanke, "Performance of polar codes for channel and source coding," in IEEE International Sympousiom on Information Theory (ISIT), 2009.
5. R. Mori and T. Tanaka, "Performance and construction of polar codes on symmetric binary-input memoryless channels," in IEEE International Sympousiom on Information Theory (ISIT), pp. 1496-1500, 2009.
6. S. Hassani, S. Korada, and R. Urbanke, "The compound capacity of polar codes," in 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 16-21, 2009.
7. S. Korada, E. Sasoglu, and R. Urbanke, "Polar codes: Characterization of exponent, bounds, and constructions," in IEEE International Symposium on Information Theory (ISIT), pp. 1483-1487, 2009.
8. S. Korada and R. Urbanke, "Polar codes are optimal for lossy source coding," IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 1751-1768, 2010.
9. E. Sasoglu, E. Telatar, and E. Arikan, "Polarization for arbitrary discrete memoryless channels," in IEEE Information Theory Workshop (ITW), pp. 144-148, 2009.
10. S. Hassani and R. Urbanke, "On the scaling of polar codes: The behavior of polarized channels," in IEEE International Symposium on Information Theory (ISIT), June 2010.
11. S. Korada, A. Montanari, E. Telatar, and R. Urbanke, "An emprical scaling law for polar codes," in IEEE International Symposium on Information Theory (ISIT), June 2010.
12. T. Tanaka and R. Mori, "Refined rate of channel polarization," in IEEE International Symposium on Information Theory (ISIT), June 2010.
13. R. Muri and T. Tanaka, "Channel polarization on q-ary discrete memoryless channels by atbitrary kernels," in IEEE International Symposium on Information Theory (ISIT), June 2010.
14. H. Cornie and S. Korada, "Lossless source coding with polar codes," in IEEE International Symposium on Information Theory (ISIT), June 2010.
15. M. Karzand and E. Telatar, "Polar codes for q-ary source coding," in IEEE International Symposium on Information Theory (ISIT), June 2010.
16. H. Mahdavifar and A. Vardy, "Achieving the secrecy capaity of wiretap channels using polar codes," in IEEE International Symposium on Information Theory (ISIT), June 2010.
17. M. Bakshi, S. Jaggi, and M. Effros, "Concatenated polar codes," in IEEE International Symposium on Information Theory (ISIT), June 2010.
18. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 50, pp. 439-454, 2004.
19. H. Pishro-Nik and F. Fekri, "Results on punctured low-density paritycheck codes and improved iterative decoding techniques," IEEE Trans. on Inform. Theory, vol. 53, pp. 599-614, February 2007.
20. C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finitelength analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, 2002.
21. C. Di, T. J. Richardson, and R. L. Urbanke, "Weight distribution of lowdensity parity-check codes," IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 4839-4855, 2006.
22. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of ldpc code ensembles," IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 929-953, 2005.
23. A. Orlitsky, R. Urbanket, K.Viswanathan, and J. Zhang, "Stopping sets and the girth of tanner graphs," in IEEE International Symposium on Information Theory (ISIT), June 2002.
24. M. Esmaeili and M. Gholami, "Geometrically-structured maximum-girth ldpc block and convolutional codes," IEEE Journal on Selected Areas in Communications, vol. 27, no. 6, pp. 831-845, 2009.