2021Unpublished venueRequires access

Reliability Based Candidate Selection of List Decoding for Polar Code

Daeson Kim, Sehyoung Kim, Inhyoung Kim, Min Goo Kim

Open publisher page 3 citations

Abstract

Polar code is adapted as the channel coding scheme for control channel in 5G NR. The basic algorithm of polar code is the successive cancelation (SC) decoding but its performance is not good enough and decoding latency is relatively high. So the simplified successive cancelation list(SSCL) decoding is generally used. When the SSCL is operated, path metric calculator generates children candidates and the number of children candidates influenced on the H/W complexity. The reliability of children candidates is affected by that of their parent candidates. The number of children candidates is adaptively selected according to the reliability of their parent candidate and the total number of children candidates could be reduced. Our proposed algorithm reduces H/W complexity of polar decoder while preserving decoding performance.

About this research paper

What this paper is about

Polar code is adapted as the channel coding scheme for control channel in 5G NR. The basic algorithm of polar code is the successive cancelation (SC) decoding but its performance is not good enough and decoding latency is relatively high. So the simplified successive cancelation list(SSCL) decoding is generally used. When the SSCL is operated, path metric calculator generates children candidates and the number of children candidates influenced on the H/W complexity. The reliability of children candidates is affected by that of their parent candidates. The number of children candidates is adaptively selected according to the reliability of their parent candidate and the total number of children candidates could be reduced. Our proposed algorithm reduces H/W complexity of polar decoder while preserving decoding performance.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Polar code is adapted as the channel coding scheme for control channel in 5G NR. The basic algorithm of polar code is the successive cancelation (SC) decoding but its performance is not good enough and decoding latency is relatively high. So the simplified successive cancelation list(SSCL) decoding is generally used. When the SSCL is operated, path metric calculator generates children candidates and the number of children candidates influenced on the H/W complexity. The reliability of children candidates is affected by that of their parent candidates. The number of children candidates is adaptively selected according to the reliability of their parent candidate and the total number of children candidates could be reduced. Our proposed algorithm reduces H/W complexity of polar decoder while preserving decoding performance.

Key concepts: Decoding methods, Polar code, List decoding, Computer science, Polar, Sequential decoding, Coding (social sciences), Reliability (semiconductor)

Related papers

Back to paper searchBrowse research topicsOriginal source
Reliability Based Candidate Selection of List Decoding for Polar Code — Research Paper | ScholarLens