© The Institution of Engineering and Technology
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.
References
-
-
1)
-
3. Abbasfar, A., Yao, K.: ‘An efficient and practical architecture for high speed turbo decoders’. IEEE Vehicular Technology Conf., Orlando, Florida, USA, October 2003, pp. 337–341.
-
2)
-
4. Kim, D.H., Kim, S.W.: ‘Bit-level stopping of turbo decoding’, IEEE Commun. Lett., 2006, 10, (3), pp. 183–185 (doi: 10.1109/LCOMM.2006.1603378).
-
3)
-
1. Muller, O., Baghdadi, A., Jezequel, M.: ‘Bandwidth reduction of extrinsic information exchange in turbo decoding’, IET Electron. Lett., 2006, 42, (19), pp. 1104–1105 (doi: 10.1049/el:20062209).
-
4)
-
2. Vogt, J., Finger, A.: ‘Improving the max-log-MAP turbo decoder’, IEE Electron. Lett., 2000, 36, (23), pp. 1937–1939 (doi: 10.1049/el:20001357).
-
5)
-
5. Shao, W., Brackenbury, L.: ‘Early stopping turbo decoders: a high-throughput, low-energy bit-level approach and implementation’, IET Commun., 2010, 4, (17), pp. 2115–2124 (doi: 10.1049/iet-com.2009.0174).
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2015.3965
Related content
content/journals/10.1049/el.2015.3965
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Computation reduction for turbo decoding through window skipping