CoChat

Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders

Yuan, Bo, Parhi, Keshab K. · 2014 · IEEE Transactions on Signal Processing
Cited by 216

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Capacity-achieving polar codes have gained significant attention in recent years. In general, polar codes can be decoded by either successive cancellation (SC) or the belief propagation (BP) algorithm. However, unlike SC decoders, performance optimizations for BP decoders have not been fully explored yet. In this paper, we explore novel early stopping criteria for polar BP decoding to significantly reduce energy dissipation and decoding latency. First, we propose two detection-type novel early stopping criteria for detecting valid outputs. For polar (1024, 512) codes, these two stopping criteria can reduce the number of iterations by up to 42.5% at 3.5 dB. Then, we propose a novel channel condition estimation approach, which can help select different stopping criteria in different SNR regions. Furthermore, the hardware architectures of polar BP decoders with the proposed stopping criteria are presented and developed. Synthesis results show that with the use of the proposed stopping criteria, the energy dissipation, and average latency of polar (1024, 512) BP decoder can be reduced by 10% ~ 30% with 2% ~ 5% hardware overhead, and average throughput can be increased by 20% ~ 55%.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2014.2366712

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 216

Metadata

Authors
Yuan, B., & Parhi, K. K.
Venue
IEEE Transactions on Signal Processing
Published
2014-12
Volume
62
Issue
24
Pages
6496-6506
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2087852282
Cited by
216
References
1
FWCI
14.64
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.