Skip to main content
SpringerLink
Log in

Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80

  • Conference paper
  • First Online:
Sequences and Their Applications - SETA 2014 (SETA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8865))

Included in the following conference series:

Abstract

A brief survey of the problem to find binary sequences with minimum peak sidelobe of aperiodic autocorrelation is given. Results of an exhaustive search for minimum peak sidelobe level sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe level up to length 80 is given. Such sequence families are important in low probability of intercept radar. Examples of optimal binary minimum peak sidelobe sequences having high merit factor for each length \(N\in [2,80]\) are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Moon, J.W., Moser, L.: On the correlation function of random binary sequences. SLAM J. Appl. Math. 16(12), 340–343 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  2. Mercer, I.D.: Autocorrelations of random binary sequences. Comb. Probab. Comput. 15(5), 663–671 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dmitriev, D., Jedwab, J.: Bounds on the growth rate of the peak sidelobe level of binary sequences. Adv. Math. Commun. 1(4), 461–475 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Schmidt, K.-U.: Binary sequences with small peak sidelobe level. IEEE Trans. Inf. Theor. 58(4), 2512–2515 (2012)

    Article  Google Scholar 

  5. Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005)

    Book  Google Scholar 

  6. Davis, J.A.: Almost difference sets and reversible divisible difference sets. Arch. Math. (Basel) 59(6), 595–602 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Arasu, K.T., Ding, C., Helleseth, T., Kumar, P.V., Martisen, H.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theor. 47, 2934–2943 (2001)

    Article  MATH  Google Scholar 

  8. Ding, C., Pott, A., Wang, Q.: Constructions of almost difference sets from finite fields. Des. Codes Crypt. 72(3), 581–592 (2013)

    Article  MathSciNet  Google Scholar 

  9. Ein-Dor, L., Kanter, I., Kinzel, W.: Low autocorrelated multiphase sequences. Phys. Rev. (E) 65(2), 020102-1–020102-4 (2002)

    Google Scholar 

  10. Mertens, S.: On the ground state of the Bernasconi model. J. Phys. A: Math. Gen. 41, 3731–3749 (1998)

    Article  Google Scholar 

  11. Lindner, J.: Binary sequences up to length 40 with best possible autocorrelation function. Electron. Lett. 11(21), 507 (1975)

    Article  Google Scholar 

  12. Cohen, M.N., Fox, M.R., Baden, J.M.: Minimum peak sidelobes pulse compression codes. In: Proceedings of the IEEE International Radar Conference, Arlington, VA, pp. 633–638, May 1990

    Google Scholar 

  13. Coxson, G.E., Russo, J.: Efficient exhaustive search for optimal-peak-sidelobe binary codes. IEEE Trans. Aerosp. Electron. Syst. 41, 302–308 (2005)

    Article  Google Scholar 

  14. Elders-Boll, H., Schotten, H., Busboom, A.: A comparative study of optimization methods for the synthesis of binary sequences with good correlation properties. In: 5th IEEE Symposium on Communication and Vehicular Technology in the Benelux, pp. 24–31. IEEE (1997)

    Google Scholar 

  15. Leukhin, A.N., Potekhin, E.N.: Optimal peak sidelobe level sequences up to length 74. In: IEEE Conference Publications: Conference Proceedings “European Microwave Conference, EuMC’2013”, Nuremberg, Germany, pp. 1807–1810, 7–10 October 2013

    Google Scholar 

  16. Leukhin, A.N., Shuvalov, A.S., Potekhin, E.N.: A Bernascony model for constructing ground-state spin systems. Bull. Russ. Acad. Sci. Phys. 78(3), 207–209 (2014)

    Article  Google Scholar 

  17. Kerdock, A.M., Mayer, R., Bass, D.: Longest binary pulse compression codes with given peak sidelobe levels. Proc. IEEE 74(2), 366 (1986)

    Article  Google Scholar 

  18. Nunn, C.J., Coxson, G.E.: Best-known autocorrelation peak sidelobe levels for binary codes of length 71 to 105. IEEE Trans. Aerosp. Electron. Syst. 44(1), 392–395 (2008)

    Article  Google Scholar 

  19. Militzer, B., Zamparelli, M., Beule, D.: Evalutionary search for low autocorrelated binary sequences. IEEE Trans. Evol. Comput. 2(1), 34039 (1998)

    Article  Google Scholar 

  20. Prestwich, S.: A hybrid local search algorithm for low-autocorrelation binary sequences, Technical report, Department of computer science, National University of Ireland at Cork (2001)

    Google Scholar 

  21. Prestwich, S.: Exploiting relaxation in local search for LABS. Ann. Oper. Res. 1, 129–141 (2007)

    Article  MathSciNet  Google Scholar 

  22. Brglez, F., Viao, Y., Stallmann, M., Militzer, B.: Reliable cost predictions for finding optimal solutions to LABS problem: evolutionary and alternative algorithms. In: International Workshop on Frontiers in Evolutionary Algorithms (2003)

    Google Scholar 

  23. Borwein, P.; Ferguson, R.; Knauer, J.: The merit factor problem

    Google Scholar 

  24. Dotú, I., Van Hentenryck, P.: A note on low autocorrelation binary sequences. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 685–689. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Gallarado, J., Cotta, C., Fernandez, A.: A memetic algorithm for the low autocorrelation binary sequence problem. In: Genetic and Evolutionary Computation Conference, pp. 1226–1233. ACM (2007)

    Google Scholar 

  26. Dorigo, M., Stutzle, T.: Ants Colony Optimization. MIT Press, Cambridge (2004)

    Book  Google Scholar 

  27. Kirkpatrick, S., Gelatt, D., Veechi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  28. Holland, J.: Adaptation in Natural and Artificial Ecosystems, 2nd edn. MIT Press, Cambridge (1992)

    Google Scholar 

  29. Stutzle, T.; Hoos, H.; Analyzing the run-time behavior of iterated local search for the TSP. In: 3rd Metaheuristics International Conference, pp. 449–453 (1999)

    Google Scholar 

  30. Rego, C., Alidaee, B.: Tabu Search and Scatter Search. Kluwer Academic Publishers, Norwell (2005)

    MATH  Google Scholar 

  31. Hansen, P., Mladenovic, N.: A tutorial on variable neighborhood search, TR G-2003-16, Gerad (2003)

    Google Scholar 

  32. Du, K.L., Wu, W.H., Mow, W.H.: Determination of long binary sequences having low autocorrelation functions. United States patent, no. US 8,493,245 B2, 23 July 2013

    Google Scholar 

  33. Signalslab. http://signalslab.volgatech.net

  34. Schmidt, K.-U.: The peak sidelobe level of random binary sequences. Bull. Lond. Math. Soc. 46(3), 643–652 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  35. Jedwab, J., Yoshida, K.: The peak sidelobe level of families of binary sequences. IEEE Tran. Inform. Theor. 52, 2247–2254 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work is supported by the grants: grant of Russian Foundation of Basic Research 12-07-00552 and project of Russian Ministry of Education and Science 1856.

Author information

Authors and Affiliations

  1. Mari State University, Yoskar-Ola, 424000, Russia

    Anatolii N. Leukhin & Egor N. Potekhin

Authors
  1. Anatolii N. Leukhin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Egor N. Potekhin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Anatolii N. Leukhin or Egor N. Potekhin .

Editor information

Editors and Affiliations

  1. Otto-von-Guericke University, Magdeburg, Germany

    Kai-Uwe Schmidt

  2. Austrian Academy of Sciences, Linz, Austria

    Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Leukhin, A.N., Potekhin, E.N. (2014). Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80. In: Schmidt, KU., Winterhof, A. (eds) Sequences and Their Applications - SETA 2014. SETA 2014. Lecture Notes in Computer Science(), vol 8865. Springer, Cham. https://doi.org/10.1007/978-3-319-12325-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12325-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12324-0

  • Online ISBN: 978-3-319-12325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation