Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.?

Chatzigeorgiou, Ioannis and Rodrigues, Miguel R. D. and Wassell, Ian J. and Carrasco, Rolando (2006) Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.? In: Proceedings of 2006 IEEE Information Theory Workshop. IEEE, NEW YORK, pp. 91-95. ISBN 1-4244-0067-8

Full text not available from this repository.

Abstract

In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lower error floor than that of their rate-1/3 parent codes. Results obtained from extrinsic information transfer charts and simulations support our conclusion.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
/dk/atira/pure/researchoutput/libraryofcongress/qa75
Subjects:
ID Code:
49532
Deposited By:
Deposited On:
22 Aug 2011 11:16
Refereed?:
Yes
Published?:
Published
Last Modified:
04 Oct 2020 08:25