
Computation reduction for turbo decoding through window skipping
Author(s) -
Martina M.,
Condo C.,
Roch M.R.,
Masera G.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.3965
Subject(s) - decoding methods , computation , computer science , algorithm , reduction (mathematics) , turbo code , turbo , entropy (arrow of time) , word error rate , thresholding , mathematics , artificial intelligence , engineering , geometry , physics , quantum mechanics , automotive engineering , image (mathematics)
A simple and effective technique to skip the computation of reliable portions of a frame (windows) for turbo code decoding is proposed. The proposed criterion relies on a very simple approximation of cross‐entropy measure by means of thresholding. This criterion features negligible complexity and low‐memory requirements. Simulation results show that, in the best case, up to 20% of windows can be skipped with no error‐rate degradation. Such a significant computation reduction can be exploited to directly reduce the power consumption as well.