A stopping criterion is an indispensable function to reduce unnecessary power consumption and decoding delay in turbo decoding. Until now, a common design philosophy in previous works has involved using the entire block of information from the MAP decoder and its input/output information to calculate the stopping index. It is an intuitive method but suffers from heavy memory requirements and high calculation complexity. In this paper, a low-complexity stopping criterion is proposed that avoids the aforementioned disadvantages. A general abstraction model is utilized to analyze the design bottleneck of stopping criteria. Instead of using an entire block of information, a compact representation derived from the internal information of the MAP decoder at a single time instant is used as a low-complexity stopping index. Theoretical explanation is provided to justify the feasibility of the proposed criterion. Simulation results show that the proposed criterion can reduce the complexity of stopping criterion dramatically while continuing to achieve the same level of performance as previous works.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sun-Ting LIN, Shou-Sheu LIN, Je-An LAI, "A Low-Complexity Stopping Criterion for Turbo Decoding Using Forward State Metrics at a Single Time Instant" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 3, pp. 722-729, March 2013, doi: 10.1587/transcom.E96.B.722.
Abstract: A stopping criterion is an indispensable function to reduce unnecessary power consumption and decoding delay in turbo decoding. Until now, a common design philosophy in previous works has involved using the entire block of information from the MAP decoder and its input/output information to calculate the stopping index. It is an intuitive method but suffers from heavy memory requirements and high calculation complexity. In this paper, a low-complexity stopping criterion is proposed that avoids the aforementioned disadvantages. A general abstraction model is utilized to analyze the design bottleneck of stopping criteria. Instead of using an entire block of information, a compact representation derived from the internal information of the MAP decoder at a single time instant is used as a low-complexity stopping index. Theoretical explanation is provided to justify the feasibility of the proposed criterion. Simulation results show that the proposed criterion can reduce the complexity of stopping criterion dramatically while continuing to achieve the same level of performance as previous works.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.722/_p
Copy
@ARTICLE{e96-b_3_722,
author={Sun-Ting LIN, Shou-Sheu LIN, Je-An LAI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Low-Complexity Stopping Criterion for Turbo Decoding Using Forward State Metrics at a Single Time Instant},
year={2013},
volume={E96-B},
number={3},
pages={722-729},
abstract={A stopping criterion is an indispensable function to reduce unnecessary power consumption and decoding delay in turbo decoding. Until now, a common design philosophy in previous works has involved using the entire block of information from the MAP decoder and its input/output information to calculate the stopping index. It is an intuitive method but suffers from heavy memory requirements and high calculation complexity. In this paper, a low-complexity stopping criterion is proposed that avoids the aforementioned disadvantages. A general abstraction model is utilized to analyze the design bottleneck of stopping criteria. Instead of using an entire block of information, a compact representation derived from the internal information of the MAP decoder at a single time instant is used as a low-complexity stopping index. Theoretical explanation is provided to justify the feasibility of the proposed criterion. Simulation results show that the proposed criterion can reduce the complexity of stopping criterion dramatically while continuing to achieve the same level of performance as previous works.},
keywords={},
doi={10.1587/transcom.E96.B.722},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - A Low-Complexity Stopping Criterion for Turbo Decoding Using Forward State Metrics at a Single Time Instant
T2 - IEICE TRANSACTIONS on Communications
SP - 722
EP - 729
AU - Sun-Ting LIN
AU - Shou-Sheu LIN
AU - Je-An LAI
PY - 2013
DO - 10.1587/transcom.E96.B.722
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2013
AB - A stopping criterion is an indispensable function to reduce unnecessary power consumption and decoding delay in turbo decoding. Until now, a common design philosophy in previous works has involved using the entire block of information from the MAP decoder and its input/output information to calculate the stopping index. It is an intuitive method but suffers from heavy memory requirements and high calculation complexity. In this paper, a low-complexity stopping criterion is proposed that avoids the aforementioned disadvantages. A general abstraction model is utilized to analyze the design bottleneck of stopping criteria. Instead of using an entire block of information, a compact representation derived from the internal information of the MAP decoder at a single time instant is used as a low-complexity stopping index. Theoretical explanation is provided to justify the feasibility of the proposed criterion. Simulation results show that the proposed criterion can reduce the complexity of stopping criterion dramatically while continuing to achieve the same level of performance as previous works.
ER -