Early Stopping for Interleaver Recovering of Turbo Codes
Peidong Yu, Hua Peng, Jing Li

TL;DR
This paper introduces an early stopping technique for interleaver recovery in turbo codes, reducing wasted computation and preventing error propagation without sacrificing recovery accuracy.
Contribution
It proposes a theoretically grounded early stopping method that improves efficiency and robustness of interleaver parameter recovery algorithms.
Findings
Significant reduction in unnecessary computations.
Maintains high probability of correct interleaver recovery.
Effective stopping criterion based on theoretical thresholds.
Abstract
Parameter recovering of channel codes is important in applications such as cognitive radio. The main task for that of a turbo code is to recover the interleaver. The existing optimal algorithm recovers interleaver parameters incrementally one by one. This algorithm continues till the end even if it has failed in the halfway. And there would be lots of wasted computation, as well as incorrectly recovered parameters that will badly deteriorate turbo decoding performance. To address such drawbacks, this paper proposes an early stopping method for the algorithm. Thresholds needed for the method are set through theoretical analysis. Simulations show that the proposed method is able to stop the algorithm in time after it has failed, while no significant degradation in the correct recovering probability is observed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Error Correcting Code Techniques · Algorithms and Data Compression
