• DocumentCode
    148256
  • Title

    On the SC decoder for any polar code of length N =ln

  • Author

    Xianbin Wang ; Zhaoyang Zhang ; Liang Zhang

  • Author_Institution
    Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China
  • fYear
    2014
  • fDate
    6-9 April 2014
  • Firstpage
    485
  • Lastpage
    489
  • Abstract
    Polar codes can achieve symmetric capacity of a channel with a simple encoder and a successive cancellation (SC) decoder, both with complexity of the order of O(N log N). Polar codes of length N = ln may have a faster polarization rate compared to polar codes of length N = 2n. In this paper, we introduce a simple and explicit method to obtain the recursive formulas of SC decoder for any polar code of length ln, which helps us better understand the essence of SC decoding. Based on this, we give a complete proof that the simplified SC decoding introduced in previous works can also be applicable for polar codes of all kinds of kernels.
  • Keywords
    channel capacity; decoding; SC decoder; channel capacity; polar code; successive cancellation decoder; symmetric capacity; Complexity theory; Decoding; Educational institutions; Kernel; Memoryless systems; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2014 IEEE
  • Conference_Location
    Istanbul
  • Type

    conf

  • DOI
    10.1109/WCNC.2014.6952076
  • Filename
    6952076
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=148256