Fast List Decoders for Polar Codes

Sarkis, Gabi; Giard, Pascal; Vardy, Alexander; Thibeault, Claude; Gross, Warren J.

doi:10.1109/jsac.2015.2504299

Cited by 156 publications

(172 citation statements)

References 30 publications

(77 reference statements)

Supporting

Mentioning

161

Contrasting

Order By: Relevance

“…We note that the detection metric proposed in the sequel has some similarities with the path metric used in list decoding of polar codes [16], [17]. However, the path metric used in list decoding is proportional to the likelihood of each estimated codeword given that a valid codeword was transmitted and given a noisy observation of that codeword.…”

Section: Proposed Blind-detection Methodsmentioning

confidence: 99%

Blind detection of polar codes

Giard

Balatsoukas‐Stimming

Burg

2017

2017 IEEE International Workshop on Signal Processing Systems (SiPS)

Self Cite

View full text Add to dashboard Cite

Abstract-Polar codes were recently chosen to protect the control channel information in the next-generation mobile communication standard (5G) defined by the 3GPP. As a result, receivers will have to implement blind detection of polar coded frames in order to keep complexity, latency, and power consumption tractable. As a newly proposed class of block codes, the problem of polar-code blind detection has received very little attention. In this work, we propose a low-complexity blind-detection algorithm for polar-encoded frames. We base this algorithm on a novel detection metric with update rules that leverage the a priori knowledge of the frozen-bit locations, exploiting the inherent structures that these locations impose on a polar-encoded block of data. We show that the proposed detection metric allows to clearly distinguish polar-encoded frames from other types of data by considering the cumulative distribution functions of the detection metric, and the receiver operating characteristic. The presented results are tailored to the 5G standardization effort discussions, i.e., we consider a short low-rate polar code concatenated with a CRC.

show abstract

Section: Proposed Blind-detection Methodsmentioning

confidence: 99%

Blind detection of polar codes

Giard

Balatsoukas‐Stimming

Burg

2017

2017 IEEE International Workshop on Signal Processing Systems (SiPS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…was proposed in [15] which was able to decode constituent codes in a polar code in parallel. This resulted in fewer number of time steps to finish the decoding process.…”

Section: Arxiv:170308208v2 [Csit] 29 Aug 2017mentioning

confidence: 99%

“…This resulted in fewer number of time steps to finish the decoding process. However, the SCL decoder in [15] is based on an empirical approach to decode constituent Rate-1 and SPC codes and cannot guarantee the same error-correction performance as the conventional SCL decoder. Moreover, all the decoders in [13]- [15] require a large sorter to select the surviving candidate codewords.…”

Section: Arxiv:170308208v2 [Csit] 29 Aug 2017mentioning

confidence: 99%

“…However, the SCL decoder in [15] is based on an empirical approach to decode constituent Rate-1 and SPC codes and cannot guarantee the same error-correction performance as the conventional SCL decoder. Moreover, all the decoders in [13]- [15] require a large sorter to select the surviving candidate codewords. Since the sorter in the hardware implementation of SCL decoders has a long and dominant critical path which is dependent on the number of its inputs [10], increasing the number of PMs results in a longer critical path and a lower operating frequency.…”

Section: Arxiv:170308208v2 [Csit] 29 Aug 2017mentioning

confidence: 99%

“…The result of Theorem 1 provides an exact number of path forks in Rate-1 nodes for each list size in SCL decoding in order to guarantee error-correction performance preservation. The Rate-1 node decoder of [15] empirically states that two path forks are required to preserve the error-correction performance. The following remarks are the direct results of Theorem 1.…”

Section: A Guaranteed Error-correction Performance Preservationmentioning

confidence: 99%

See 2 more Smart Citations

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Hashemi¹,

Condo²,

Gross³

2017

IEEE Trans. Signal Process.

Self Cite

162

135

View full text Add to dashboard Cite

Abstract-Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of path splitting required to decode rate one and single parity check codes. Thus, the number of splitting can be limited while guaranteeing exactly the same error-correction performance as if the paths were forked at each bit estimation. We call the new decoding algorithms Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of path forks in a practical application can be tuned to achieve desirable speed, while keeping the error-correction performance almost unchanged. Hardware architectures implementing both algorithms are then described and implemented: it is shown that our design can achieve 1.86 Gb/s throughput, higher than the best state-of-the-art decoders.

show abstract

A DSEL for high throughput and low latency software‐defined radio on multicore CPUs

Cassagne¹,

Tajan

Aumage

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis article presents a new Domain Specific Embedded Language (DSEL) dedicated to Software‐Defined Radio (SDR). From a set of carefully designed components, it enables to build efficient software digital communication systems, able to take advantage of the parallelism of modern processor architectures, in a straightforward and safe manner for the programmer. In particular, proposed DSEL enables the combination of pipelining and sequence duplication techniques to extract both temporal and spatial parallelism from digital communication systems. We leverage the DSEL capabilities on a real use case: a fully digital transceiver for the widely used DVB‐S2 standard designed entirely in software. Through evaluation, we show how proposed software DVB‐S2 transceiver is able to get the most from modern, high‐end multicore CPU targets.

show abstract

Fast List Decoders for Polar Codes

Cited by 156 publications

References 30 publications

Blind detection of polar codes

Blind detection of polar codes

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

A DSEL for high throughput and low latency software‐defined radio on multicore CPUs

Contact Info

Product

Resources

About