Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders
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.
Integrity signals
Registry
Cites
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.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“Belief propagation (BP) algorithm is a widely used approach for iterative decoding over factor graph [28].”
Method
Cited by
Simultaneous Wireless Information and Power Transfer (SWIPT): Recent Advances and Future Challenges
Ponnimbaduge Perera, T. D., Jayakody, D. N. K., Sharma, S. K., Chatzinotas, S., & Li, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2783901 · Cited by 920
“An early stopping criteria for polar BP decoding to reduce energy dissipation and decoding latency has been proposed in [181] and [182].”
BackgroundState-of-Charge Estimation of Li-Ion Battery in Electric Vehicles: A Deep Neural Network Approach
How, D. N. T., Hannan, M. A., Lipu, M. S. H., Sahari, K. S. M., Ker, P. J., & Muttaqi, K. M. (2020) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2020.3004294 · Cited by 337
“The equations of all the error metric are expressed as follows: In order to prevent overfitting, backpropagation training is used in conjunction with the early stopping training scheme [33].”
MethodHannan, M. A., How, D. N. T., Mansor, M. B., Hossain Lipu, M. S., Ker, P., & Muttaqi, K. (2021) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2021.3065194 · Cited by 70
“To mitigate overfitting, the early stopping [33] technique was used to halt the training if the loss on the validation set does not show any improvement for 15 consecutive epochs.”
Method
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders. https://app.cochat.ai/papers/10.1109/tsp.2014.2366712
- The paper
- Yuan, B., & Parhi, K. K. (2014). Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2014.2366712
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.