Performance of Successive-Cancellation List Decoding of Extended-Minimum Distance Polar Codes 


Vol. 38,  No. 1, pp. 109-117, Jan.  2013


PDF
  Abstract

Polar codes are the first provable error correcting code achieving the symmetric channel capacity in a wide case of binary input discrete memoryless channel(BI-DMC). However, finite length polar codes have an error floor problem with successive-cancellation list(SCL) decoder. From previous works, we can solve this problem by concatenating CRC(Cyclic Redundancy Check) codes. In this paper we propose to make polar codes having extended-minimum distance from original polar codes without outer codes using correlation with generate matrix of polar codes and that of RM(Reed-Muller) codes. And we compare performance of proposed polar codes with that of polar codes concatenating CRC codes.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. Ryu, J. Y. Kim, J. Kim, S. Kim, "Performance of Successive-Cancellation List Decoding of Extended-Minimum Distance Polar Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 1, pp. 109-117, 2013. DOI: .

[ACM Style]

Daehyeon Ryu, Jae Yoel Kim, Jong-Hwan Kim, and Sang-Hyo Kim. 2013. Performance of Successive-Cancellation List Decoding of Extended-Minimum Distance Polar Codes. The Journal of Korean Institute of Communications and Information Sciences, 38, 1, (2013), 109-117. DOI: .

[KICS Style]

Daehyeon Ryu, Jae Yoel Kim, Jong-Hwan Kim, Sang-Hyo Kim, "Performance of Successive-Cancellation List Decoding of Extended-Minimum Distance Polar Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 1, pp. 109-117, 1. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880