2017/05/15 by Seyyed Ali Hashemi, Hashemi, Seyyed Ali, Marco Mondelli +7 · 1 citation
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1705.05497
openalex publication_date 2017/05/15 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
Polar codes represent one of the major recent breakthroughs in coding theory\nand, because of their attractive features, they have been selected for the\nincoming 5G standard. As such, a lot of attention has been devoted to the\ndevelopment of decoding algorithms with good error performance and efficient\nhardware implementation. One of the leading candidates in this regard is\nrepresented by successive-cancellation list (SCL) decoding. However, its\nhardware implementation requires a large amount of memory. Recently, a\npartitioned SCL (PSCL) decoder has been proposed to significantly reduce the\nmemory consumption. In this paper, we examine the paradigm of PSCL decoding\nfrom both theoretical and practical standpoints: (i) by changing the\nconstruction of the code, we are able to improve the performance at no\nadditional computational, latency or memory cost, (ii) we present an optimal\nscheme to allocate cyclic redundancy checks (CRCs), and (iii) we provide an\nupper bound on the list size that allows MAP performance.\n