Home > Research > Publications & Outputs > Can punctured rate-1/2 turbo codes achieve a lo...
View graph of relations

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Publication date2006
Host publicationProceedings of 2006 IEEE Information Theory Workshop
EditorsPZ Fan, P Li, R Yeung
Place of PublicationNEW YORK
Number of pages5
ISBN (Print)1-4244-0067-8
Original languageEnglish


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.