A Fast Polar Code List Decoder Architecture Based on Sphere Decoding

Hashemi, Seyyed Ali; Condo, Carlo; Gross, Warren J.

doi:10.1109/tcsi.2016.2619324

Cited by 98 publications

(86 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The advantage of SSCL is that it not only guarantees the error-correction performance preservation, but also it uses the same sorter as in the conventional SCL algorithm. To further increase the throughput and reduce the latency of SSCL, the matrix reordering idea in [18] was used to develop the SSCL-SPC decoder in [19]. While SSCL-SPC uses the same sorter as in the conventional SCL, it provides an exact reformulation for L = 2 and its approximations bring negligible error-correction performance loss with respect to SSCL.…”

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

confidence: 99%

“…It was shown in [19] that the time step requirements of Rate-0, Rep, and Rate-1 nodes of length N s in SSCL decoding can be represented as…”

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

“…2) SSCL-SPC Decoding: In [19], a low-complexity approach was proposed to decode SPC nodes which resulted in exact reformulations for L = 2 and its approximations for other list sizes brought negligible error-correction performance degradation. The pruned tree of SSCL-SPC for the same example as in Fig.…”

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

“…which consists of one time step for (18), N s − 1 time steps for (19), and one time step for (20). The SSCL-SPC algorithm reduces the number of required time steps to decode SPC nodes by almost a factor of three, but as in the case of Rate-1 nodes, it fails to address the effect of list size on the maximum number of required path forks.…”

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

“…For codes of higher rates, the number of Rate-1 nodes of larger length increases [19]. Therefore, when the list size is also large,…”

Section: A Guaranteed Error-correction Performance Preservationmentioning

confidence: 99%

See 4 more Smart Citations

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Hashemi¹,

Condo²,

Gross³

2017

IEEE Trans. Signal Process.

Self Cite

166

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

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

confidence: 99%

“…It was shown in [19] that the time step requirements of Rate-0, Rep, and Rate-1 nodes of length N s in SSCL decoding can be represented as…”

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

Section: Successive-cancellation List Decodingmentioning

confidence: 99%

“…For codes of higher rates, the number of Rate-1 nodes of larger length increases [19]. Therefore, when the list size is also large,…”

Section: A Guaranteed Error-correction Performance Preservationmentioning

confidence: 99%

See 3 more Smart Citations

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Hashemi¹,

Condo²,

Gross³

2017

IEEE Trans. Signal Process.

Self Cite

166

135

View full text Add to dashboard Cite

show abstract

Deep Learning Techniques for Decoding Polar Codes

Gross

Doan

Mambou

et al. 2019

Machine Learning for Future Wireless Communications

View full text Add to dashboard Cite

Low Latency Architecture Design for Decoding 5G NR Polar Codes

Mouhoubi

Nour

Baghdadi

2022

Design and Architecture for Signal and Image Processing

View full text Add to dashboard Cite

Polar codes have been adopted as the coding scheme in the control channel of the 3rd Generation Partnership Project (3GPP) New Radio (NR) standard for 5G. However, the challenging requirements introduced by the 5G control channel in terms of block length and code rate flexibility render unsuitable most of the published hardware polar decoder implementations. Indeed, these latter focused mainly on successive cancellation decoders with ultra-high throughput, limited flexibility and error correction capabilities. With stringent constraints on end-toend delay and error correction, the 5G NR context steers towards lowlatency list-based decoder architectures. In this context, we propose an original flexible list-based hardware architecture for decoding 5G NR polar codes that can support all the frame sizes and code rates defined in 3GPP with a worst-case decoding latency below 24 µs.

show abstract

A Fast Polar Code List Decoder Architecture Based on Sphere Decoding

Cited by 98 publications

References 19 publications

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Deep Learning Techniques for Decoding Polar Codes

Low Latency Architecture Design for Decoding 5G NR Polar Codes

Contact Info

Product

Resources

About