Optimal search for binary skew-symmetric sequences with minimal levels of side lobes

: pp. 410–419
Received: September 11, 2020
Accepted: October 01, 2020
Lviv Polytechnic National University
Lviv Polytechnic National University
Lviv Polytechnic National University
National Army Academy

Signal-code constructions with modulating binary sequences are widely used in multichannel radiocommunication systems, radar, and other information systems.  Among these sequences, there are those that provide the minimum levels of side lobes of the aperiodic autocorrelation function and, accordingly, the required secrecy, noise immunity, resolution, and other important characteristics and parameters.  The paper describes an alternative approach for solving optimization task that involves a complete full search for the optimal binary skew-symmetric sequences with odd dimension $l$ using a criterion of minimum side lobes of the aperiodic autocorrelation function.  The proposed method based on performing two consecutive steps: optimizing in the space of dimension $L < 0.5(l-5)$ of the objective functions with respect to the levels of side lobes of the aperiodic autocorrelation function and solving of an equation system which specifies the aperiodic autocorrelation function.  The right sides of the equation system present the levels of the side lobes that are obtained as the result of completing the first operation.  The developed methodology includes an analysis of the structure of sets of binary sequences; finding correlations between the structural components using the methods of group theory; establishing analytical forms that define the functional relationships between the levels of side lobes of the aperiodic autocorrelation function.  The article presents an example of application and results of modeling of the offered algorithm to identify optimal binary sequences.

  1. Skolnik M. I., Goossens M., Braams J., Carlisle D., Rowley C.  Radar Handbook.  New York, McGraw-Hill (2008).
  2. Sklar B.  Digital Communication. Fundamentals and Application.  Prentice Hall (2001).
  3. Varakin L. E.  Communication systems with noise-like signals.  Moscow, Radio and communication (1985), (in Russian).
  4. Kupriyanov A. I., Shustov L. N.  Electronic warfare. Fundamentals of theory.  Moscow, University book (2017), (in Russian).
  5. Kuzyk A.  Comparative analysis of complex signals based on continuous and discrete frequency modulation.  2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET). 61–63 (2016).
  6. Miskiv A., Miskiv V.-M., Prudyus I., Yankevych R., Fabirovskyy S.  Model of the periodic autocorrellation function of code binary sequences for wireless noise imune data transmission systems signals synthesis.  2018 IEEE 4th International Symposium on Wireless Systems within the International Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS). 221–224 (2018).
  7. Antonyuk V., Prudyus I., Nichoga V., Kawalec A.  Integration of passive coherent radar system into the passive TDOA system.  2012 13th International Radar Symposium. 354–358 (2012).
  8. Combat air strategy: An ambition vision on the future. GOV.uk. https://www.gov.uk/government/publications/combat-air-strategy-anambitious-vision-for-the-future.
  9. Jedwab J.  What can be used instead of a Barker sequence?  Contemp. Math. 461, 153–178 (2008).
  10. Packebusch T., Mertens S.  Low autocorrelation binary sequences.  J. Phys. A: Math. Theor. 49 (16), 165001 (2016).
  11. Barker R. H.  Group synchronizing of binary digital systems Communication Theory.  In W. Jackson, editor, Communication Theory, Academic Press, New York, 273–287 (1953).
  12. Turyn R., Storer J.  On binary sequences.  Proc. Amer. Math. Soc. 12, 394–399 (1961).
  13. Schmidt K.-U., Willms J.  Barker sequences of odd length.  Designs, Codes and Cryptography. 80, 409–414 (2015).
  14. Leung K. H., Schmidt B.  The field descent method.  Designs, Codes and Cryptography. 36, 171–188 (2005).
  15. Prestwich S. D.  Improved Branch-and-Bound for Low Autocorrelation Binary Sequences.  Preprint arXiv:1305.6187, 1–9 (2013).
  16. Boškovic B., Brglez F., Brest J.  Low-autocorrelation binary sequences: On improved merit factors and runtime predictions to achieve them.  Applied Soft Computing. 56, 262–285 (2017).
  17. Mow W. H., Du K., Wu W. H.  New evolutionary search for long low autocorrelation binary sequences.  IEEE Transactions on Aerospace and Electronic Systems. 51 (1), 290–303 (2015).
  18. Dimitrov M., Baitcheva T., Nikolov N.  Efficient Generation of Low Autocorrelation Binary Sequences.  IEEE Signal Processing Letters. 27, 341–345 (2020).
  19. Miskiv V.-M. V., Prudyus I. N., Yankevych R. V.  Optimization of Code Constructions of Binary Sequences Class on a Basis of Set-Theoretical Representation. Radioelectronics and Communications Systems. 61 (7), 292–305 (2018).
  20. Miskiv V.-M., Kaniewski P., Prudyus I., Konatowski S.  Method of synthesis of signal-code constructions for secretive noise-proof data transmission radio systems.  XII Conference on Reconnaissance and Electronic Warfare Systems. 11055, 386–392 (2019).
  21. Matuszewski J.  The methods of class pattern forming in order to emitters recognition.  Przeglad Elektrotechniczny. 84 (5), 104–108 (2008).
  22. Miskiv V., Prudyus I., Yankevych R.  Properties of binary code sequences on the periodical convolution.  2017 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo). 1–4 (2017).
  23. Mis'kiv A., Mis'kiv V., Prudyus I., Yankevych R.  Discrete sequencies with optimal aperiodic autocorrelation functions. Conditions for existance.  2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET). 1264–1267 (2018).
  24. Birkhoff G., Bartee T. C.  Modern Applied Algebra.  New York, McGraw-Hill (1970).
  25. Goodman S. E., Hedetniemi S. T.  Introduction to the Design and Analysis of Algorithms.  New York, McGraw-Hill (1977).
  26. Moon J. W., Moser L.  On the correlation function of random binary sequences.  SIAM J. Appl. Math. 16 (2), 340–343 (1968).
  27. Jedwab J., Yoshida Y.  The peak sidelobe level of families of binary sequences.  IEEE Transactions on Information Theory. 52 (5), 2247–2254 (2006).
  28. Dmitriev D., Jedwab J.  Bounds on the growth rate of the peak sidelobe level of binary sequences.  Advances in Mathematics of Communications. 1 (4), 461–475 (2007).
Mathematical Modeling and Computing, Vol. 7, No. 2, pp. 410–419 (2020)