 Upper bounds on the minimum distance for turbo codes using CPP interleaversLucian Trifina (),
Daniela Tarniceriu (),
Jonghoon Ryu () and
Ana-Mirela Rotopanescu ()
Telecommunication Systems: Modelling, Analysis, Design and Management, 2021, vol. 76, issue 3, No 7, 423-447 Abstract: Abstract Analysis of error correction performance for error correcting codes is very important when using such codes in digital communication systems. At medium-to-high signal-to-noise ratios, the distance spectrum of the error correcting code represents a good indicator for the error correction performance of the code. It is desired that the minimum distance of the code is as large as possible and that the corresponding multiplicity (i.e. the number of codewords having the weight equal to the minimum distance) is as small as possible. If we know an upper bound of the minimum distance of the code, then we have a good indication about the capabilities and the limitations of the code. One of the classes of the error correcting codes with the best performance is that of turbo codes. For such codes, establishing upper bounds on the minimum distance is challenging because it depends on the interleaver component of the turbo code. In this paper we consider turbo codes with component convolutional codes as in the Long Term Evolution standard. The interleaver lengths are of the form $$16 \varPsi $$ 16 Ψ or $$48 \varPsi $$ 48 Ψ , with $$ \varPsi $$ Ψ a product of different prime numbers greater than three. The first achievement in the paper is that for these interleaver lengths, we show that cubic permutation polynomials (CPP), with some constraints on the coefficients, when $$3 \not \mid (p_i-1)$$ 3 ∤ ( p i - 1 ) for a prime $$p_i > 3$$ p i > 3 , always have a true inverse CPP. The most accurate upper bounds on the minimum distance for turbo codes are achieved by identifying bit information sequences leading to a certain weight of the corresponding turbo-codeword. In this paper we have indentified such bit information sequences by means of the full range dual impulse method to estimate the weight of the turbo-codewords. For the previously mentioned turbo codes and CPP interleavers, we show that the minimum distance is upper bounded by the values of 38, 36, and 28, for three different classes of coefficients. Previously, it was shown that for the same interleaver lengths and for quadratic PP (QPP) interleavers, the upper bound of the minimum distance is equal to 38. Several examples show that $$d_{min}$$ d min -optimal CPP interleavers are better than $$d_{min}$$ d min -optimal QPP interleavers because the multiplicities corresponding to the minimum distances for CPPs are about a half of those for QPPs. A theoretical explanation in terms of nonlinearity degrees for this result is given for all considered interleaver lengths and for the class of CPPs for which the upper bound is equal to 38. Keywords: PP interleaver; CPP; QPP; Minimum distance; Upper bound; Turbo codes (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:76:y:2021:i:3:d:10.1007_s11235-020-00723-4 Ordering information: This journal article can be ordered from DOI: 10.1007/s11235-020-00723-4 Access Statistics for this article Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.