Browse by author
Lookup NU author(s): Emeritus Professor Rolando Carrasco
The objective of this paper is two-fold. Initially, we present an analytic technique to rapidly evaluate an approximation to the union bound on the bit error probability of turbo codes. This technique exploits the most significant terms of the union bound, which can be calculated straightforwardly by considering the properties of the constituent convolutional encoders. Subsequently, we use the bound approximation to demonstrate that specific punctured rate-1/2 turbo codes can achieve a lower error floor than that of their rate-1/3 parent codes. In particular, we propose pseudo-random puncturing as a means of improving the bandwidth efficiency of a turbo code and simultaneously lowering its error floor.
Author(s): Chatzigeorgiou I, Rodrigues MRD, Wassell IJ, Carrasco RA
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: IEEE Journal on Selected Areas in Communications: IEEE International Symposium on Information Theory
Year of Conference: 2009
Pages: 944-953
Date deposited: 08/03/2010
ISSN: 0733-8716
Publisher: IEEE
URL: http://dx.doi.org/10.1109/JSAC.2009.090812
DOI: 10.1109/JSAC.2009.090812
Library holdings: Search Newcastle University Library for this item
ISBN: 15580008