Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes

In this study, the authors study a turbo-coding (TC) scheme, whose constituent codes are designed using convolutional encoders. These encoders are finite-state sequence machines (FSSMs) operating over the Galois Field, GF(4). The scheme includes encryption polynomials whose coefficients are selected every L steps, from the set of optimal polynomials of GF(4). Two cases are considered for the polynomial selection: periodical and random. This kind of encoder was studied in a previous study and a correspondence between the randomness of the encoded sequence and performance of the TC was conjectured. The main contribution of this study is to systematically confirm this correspondence, by analysing the randomness of the output and performance of the TC using several randomness quantifiers. Three of the quantifiers are defined on the basis of recurrence plots. Other two quantifiers are defined on the basis of the information theory. All the quantifiers allow one to justify why the proposed TC works better with random selection of the optimal polynomials and with small values of L . In summary, it is shown that a random selection of polynomials and a small L produce FSSMs with enhanced randomness properties and it is also shown that they produce the best quality of the TC, measured by means of the corresponding bit error rate.

[1]  I. Percival,et al.  A spectral entropy method for distinguishing regular and irregular motion of Hamiltonian systems , 1979 .

[2]  G. Keller,et al.  Entropy of interval maps via permutations , 2002 .

[3]  Osvaldo A. Rosso,et al.  Randomizing nonlinear maps via symbolic dynamics , 2008 .

[4]  Sergio Callegari,et al.  Chaotic modulations can outperform random ones in electromagnetic interference reduction tasks , 2002 .

[5]  D. Ruelle,et al.  Recurrence Plots of Dynamical Systems , 1987 .

[6]  Alejandra Figliola,et al.  Time-frequency analysis of electroencephalogram series. III. Wavelet packets and information cost function , 1998 .

[7]  Jürgen Kurths,et al.  Recurrence plots for the analysis of complex systems , 2009 .

[8]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[9]  W. G. Chambers,et al.  Comments on "Chaotic digital encoding: an approach to secure communication" and reply , 1999 .

[10]  M Garavaglia,et al.  Characterization of Gaussian self-similar stochastic processes using wavelet-based informational tools. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  A. Plastino,et al.  Permutation entropy of fractional Brownian motion and fractional Gaussian noise , 2008 .

[12]  B. M. Gammel.  Hurst's rescaled range statistical analysis for pseudorandom number generators used in physical simulations , 1998 .

[13]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Osvaldo A. Rosso,et al.  Intensive statistical complexity measure of pseudorandom number generators , 2005 .

[15]  Jorge Castiñeira Moreira,et al.  Quasi-chaotic coding over GF(q) , 2006, IEEE Transactions on Communications.

[16]  Bahram Honary,et al.  Trellis-hopping Turbo Coding , 2006 .

[17]  Osvaldo A. Rosso,et al.  Mixing chaotic maps and electromagnetic interference reduction , 2012 .

[18]  M Garavaglia,et al.  Extracting features of Gaussian self-similar stochastic processes via the Bandt-Pompe approach. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Osvaldo A. Rosso,et al.  Statistical complexity measure of pseudorandom bit generators , 2005 .

[20]  Chetan N. Mathur,et al.  A MATHEMATICAL FRAMEWORK FOR COMBINING ERROR CORRECTION AND ENCRYPTION , 2007 .

[21]  Claudio R. Mirasso,et al.  Encryption test of pseudo-aleatory messages embedded on chaotic laser signals: An information theory approach , 2008 .

[22]  Werner Ebeling,et al.  PARTITION-BASED ENTROPIES OF DETERMINISTIC AND STOCHASTIC MAPS , 2001 .

[23]  Carl S. McTague,et al.  The organization of intrinsic computation: complexity-entropy diagrams and the diversity of natural information processing. , 2008, Chaos.

[24]  E. Basar,et al.  Wavelet entropy: a new tool for analysis of short duration brain electrical signals , 2001, Journal of Neuroscience Methods.

[25]  Jorge Castiñeira Moreira,et al.  EXIT chart analysis of nonlinear turbo coding over GF(4) , 2008, IET Commun..

[26]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[27]  Pierre L'Ecuyer,et al.  Uniform random number generation , 1994, Ann. Oper. Res..

[28]  Mathieu Sinn,et al.  Ordinal analysis of time series , 2005 .

[29]  B. Pompe,et al.  Permutation entropy: a natural complexity measure for time series. , 2002, Physical review letters.

[30]  Joshua D. Reiss,et al.  Construction of symbolic dynamics from experimental time series , 1999 .

[31]  Patrick Robertson,et al.  Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..

[32]  Karsten Keller,et al.  Symbolic Analysis of High-Dimensional Time Series , 2003, Int. J. Bifurc. Chaos.

[33]  D. R. Frey,et al.  Chaotic digital encoding: an approach to secure communication , 1993 .

[34]  O A Rosso,et al.  Distinguishing noise from chaos. , 2007, Physical review letters.

[35]  O A Rosso,et al.  Quantifiers for randomness of chaotic pseudo-random number generators , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[36]  Osvaldo A. Rosso,et al.  Bandt–Pompe approach to the classical-quantum transition , 2007 .

[37]  J. C. Moreira,et al.  Security and BER performance trade-off in wireless communication systems applications , 2009 .

[38]  Osvaldo A. Rosso,et al.  Random number generators and causality , 2006 .