Low-latency list decoding of polar codes with double thresholding

Fan, YouZhe; Chen, Ji; Xia, ChenYang; Tsui, Chi-Ying; Shen, Hui; Li, Bin

doi:10.1109/icassp.2015.7178128

Cited by 29 publications

(19 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analogous to the classic SC decoder, the SCL decoding scheme also suffers from a high latency due to the data dependencies associated with the decoding process. In this context, various low-latency SCL decoding schemes have been presented in [94], [104], [105], [108], [110], [111], [117]. Furthermore, the complexity of an SCL decoder is L times higher than that of a classic SC decoder, since it processes L candidate paths.…”

Section: Successive Cancellation List (Scl) Decodermentioning

confidence: 99%

Polar Codes and Their Quantum-Domain Counterparts

Babar

Egilmez

Xiang

et al. 2020

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation. By virtue of these attractive features, polar codes have provided fierce competition to both the turbo as well as the Low Density Parity Check (LDPC) codes, making its way into the 5G New Radio (NR). Realizing the significance of polar codes, in this paper we provide a comprehensive survey of polar codes, highlighting the major milestones achieved in the last decade. Furthermore, we also provide tutorial insights into the polar encoder, decoders as well as the code construction methods. We also extend our discussions to quantum polar codes with an emphasis on the underlying quantum-to-classical isomorphism and the syndromebased quantum polar codes.

show abstract

Section: Successive Cancellation List (Scl) Decodermentioning

confidence: 99%

Polar Codes and Their Quantum-Domain Counterparts

Babar

Egilmez

Xiang

et al. 2020

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…According to our measurement under typical code lengths, the main source of latency is now incurred by the general nodes whose constituent code rates are between 2 B and B−2 B . Motivated by [7]- [11], and thanks to the recent advances in efficient list pruning [14], [15], we find it profitable to further improve parallelism for ultra-low-latency applications. Our contributions are summarized below: 1) We propose to fully parallelize the processing of R1/SPC nodes via multi-bit hard estimation and flipping at intermediate stages.…”

Section: B Motivation and Our Contributionsmentioning

confidence: 99%

A Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency Communications

Zhang

Tong

et al. 2019

IEEE Access

View full text Add to dashboard Cite

We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations [7]- [13] improve parallelism with two approaches, i.e., multi-bit decision or reduced path splitting. In this paper, we combine the two procedures into one with an error-pattern-based architecture. It simultaneously generates a set of candidate paths for multiple bits with pre-stored patterns. For rate-1 (R1) or single parity-check (SPC) nodes, we prove that a small number of deterministic patterns are required to guarantee performance preservation. For general nodes, low-weight error patterns are indexed by syndrome in a look-up table and retrieved in O(1) time. The proposed flip-syndrome-list (FSL) decoder fully parallelizes all constituent code blocks without sacrificing performance, thus is suitable for ultra-low-latency applications. Meanwhile, two code construction optimizations are presented to further reduce complexity and improve performance, respectively.

show abstract

“…In a different approach, path metrics were approximately sorted with double thresholding method proposed in [26]. It compares 2L path metrics with two thresholds, AT and RT .…”

Section: B Path Metric Sortingmentioning

confidence: 99%

Hardware decoders for polar codes: An overview

Giard

Sarkis

Balatsoukas‐Stimming

et al. 2016

2016 IEEE International Symposium on Circuits and Systems (ISCAS)

Self Cite

View full text Add to dashboard Cite

Abstract-Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of LDPC codes to very high throughput or low-complexity decoders. In this work, we review the state of the art in polar decoders implementing the successive-cancellation, belief propagation, and list decoding algorithms, illustrating their advantages.

show abstract

Low-latency list decoding of polar codes with double thresholding

Cited by 29 publications

References 34 publications

Polar Codes and Their Quantum-Domain Counterparts

Polar Codes and Their Quantum-Domain Counterparts

A Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency Communications

Hardware decoders for polar codes: An overview

Contact Info

Product

Resources

About