Skip to main content
SpringerLink
Log in

A hybrid algorithm for the search of long binary sequences with low aperiodic autocorrelations

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Binary sequences with low aperiodic autocorrelation play an important role in communication and radar. The search of long low autocorrelation binary sequences (LABS) is a classical but challenging research problem. Exhaustive sequence search is infeasible for large lengths due to its prohibitively high complexity. Albeit many algorithms on LABS search in the literature, they are effective for lengths up to a few hundred only. In this paper, we propose an efficient hybrid algorithm which combines the strength of coordinate descent algorithm and the simulated annealing algorithm. Our proposed hybrid algorithm can efficiently generate long LABS of lengths up to several thousand and outperforms existing approaches in most cases.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Aarts EHL, Van Laarhoven PJM (1985) Statistical cooling: a general approach to combinatorial optimization problems. Philips J Res 40(4):193–226

    MathSciNet  Google Scholar 

  • Barker RH (1953) Group synchronizing of binary digital systems. In: Jackson W (ed) Communication Theory, Academic Press, New York, pp. 273–287

  • Borwein P, Ferguson R (2005) Polyphase sequences with low autocorrelation. IEEE Trans Inf Theory 51(4):1564–1567

    Article  MathSciNet  Google Scholar 

  • Brest J, Boskovic B (2018) A heuristic algorithm for a low autocorrelation binary sequence problem with odd length and high merit factor. IEEE Access 32:4127–4134

    Article  Google Scholar 

  • Brglez F, Li XY, Stallmann MF, Militzer B (2003) Reliable cost predictions for finding optimal solutions to LABS problem: evolutionary and alternative algorithms. In: Proceedings of 5th international workshop on frontiers in evolutionary algorithms (FEA’2003) under JCIS’2003

  • Cohen MN, Fox MR, Baden JM (1990) Minimum peak sidelobe pulse compression codes. In: Proceedings of IEEE international radar conference, pp 633–639

  • Coxson GE, Russo J (2004) Efficient exhaustive search for optimal peak sidelobe binary codes. In: Proceedings of the IEEE 2004 national radar conference

  • Coxson GE, Cohen MN, Hirschel A (2001) New results on minimum-PSL binary codes. In: IEEE national radar conference

  • Deng H (1996) Synthesis of binary sequences with good autocorrelation and cross-correlation properties by simulated annealing. IEEE Trans Aerosp Electron Syst 32:98–107

    Article  Google Scholar 

  • Deng H (2004) Polyphase code design for orthogonal netted radar systems. IEEE Trans Signal Process 52(11):3126–3135

    Article  Google Scholar 

  • Deng X, Fan PZ (1999) New binary sequences with good aperiodic autocorrelations obtained by evolutionary algorithm. IEEE Commun Lett 3(10):288–290

    Article  Google Scholar 

  • Dzvonkovskaya A, Rohling H (2008) Long binary phase codes with good autocorrelation properties. In: Proceedings of 2008 international radar symposium, pp 1–4

  • Gallardo JE, Cotta C, Fernandez AJ (2007) A memetic algorithm for the low autocorrelation binary sequence problem. In: Proceedings of 9th annual conference on genetic and evolutionary computation, pp 1226–1233

  • Gamal AE, Hemachandra L, Shperling I, Wei V (1987) Using simulated annealing to design good codes. IEEE Trans Inf Theory 33:116–123

    Article  Google Scholar 

  • García E, Paredes JA, Álvarez FJ, CarmenPérez MC, García JJ (2015) Spreading sequences in active sensing: a review. Signal Process 106:88–105

    Article  Google Scholar 

  • Golay MJE (1977) Sieves for low autocorrelation binary sequences. IEEE Trans Inf Theory 23:43–51

    Article  Google Scholar 

  • Hu F, Fan PZ, Darnell M, Jin F (1997) Binary sequences with good aperiodic autocorrelation functions obtained by neural network search. Electron Lett 33(8):688–689

    Article  Google Scholar 

  • Huang MD, Romeo F, Sangiovanni-Vincentelli A (1986) An efficient general cooling schedule for simulated annealing. In: Proceedings of IEEE international conference CAD, pp 381–384

  • Kerahroodi MA, Aubry A, Maio AD, Naghsh MM, Modarres-Hashemi M (2017a) Design of binary sequences with low PSL/ISL. In: 2017 25th European signal processing conference (EUSIPCO), pp 2211–2215

  • Kerahroodi MA, Aubry A, Maio AD, Naghsh MM, Modarres-Hashemi M (2017b) A coordinate-descent framework to design low PSL/ISL sequences. IEEE Trans Signal Process 65:5942–5956

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  • Koike T, Yoshida S (2004) Genetic designing of near-optimal training sequences for spatial multiplexing transmissions. In: Proceedings of 10th Asia-Pacific conference on communications and 5th international symposium on multi-dimensional mobile communications, pp 474–478

  • Kretschmer FF, Gerlach K (1991) Low sidelobe radar waveforms derived from orthogonal matrices. IEEE Trans Aerosp Electron Syst 27:92–102

    Article  MathSciNet  Google Scholar 

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

  • Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21:1087–1091

    Article  Google Scholar 

  • Militzer B, Zamparelli M, Beule D (1998) Evolutionary search for low autocorrelated binary sequences. IEEE Trans Evol Comput 2(1):34–39

    Article  Google Scholar 

  • Mow WH, Du K-L, Wu WH (2015) New evolutionary search for long low autocorrelation binary sequences. IEEE Trans Aerosp Electron Syst 51(1):290–303

    Article  Google Scholar 

  • Natarajan B, Das S, Stevens D (2005) An evolutionary approach to designing complex spreading codes for DS-CDMA. IEEE Trans Wirel Commun 4(5):2051–2056

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Nunn CJ, Coxson GE (2009) Polyphase pulse compression codes with optimal peak and integrated sidelobes. IEEE Trans Aerosp Electron Syst 45(2):41–47

    Article  Google Scholar 

  • Rao KV, Reddy VU (1986) Biphase sequence generation with low sidelobe autocorrelation function. IEEE Trans Aerosp Electron Syst 22(2):128–133

    Article  Google Scholar 

  • Sangaiah AK, Medhane DV, Han T, Hossain MS, Muhammad G (2019) Enforcing position-based confidentiality with machine learning paradigm through mobile edge computing in real-time industrial informatics. IEEE Trans Ind Inf 15(7):4189–4196

    Article  Google Scholar 

  • Sangaiah AK, Hosseinabadi AAR, Shareh MB, Bozorgi Rad SY, Zolfagharian A, Chilamkurti N (2020) IoT resource allocation and optimization based on heuristic algorithm. Sensors 20(2):539

    Article  Google Scholar 

  • Soltanalian M, Stoica P (2012) Computational design of sequences with good correlation properties. IEEE Trans Signal Process 60:2180–2193

    Article  MathSciNet  Google Scholar 

  • Turyn R (1960) Optimum codes study. Sylvania electronic system AF19(604)-5473

  • Turyn R, Storer J (1961) On binary sequences. Proc Am. Math Soc 12(3):394–399

    Article  MathSciNet  Google Scholar 

  • Wang S, Ji X (2007) An efficient heuristics search for binary sequences with good aperiodic autocorrelations. In: Proceedings of IEEE international conference on wireless communications, networking and mobile computing (WiCom’07), pp 21–25

  • White S (1984) Concept of scale in simulated annealing. In: Proceedings of IEEE international conference on computer design, pp 646–651

Download references

Funding

This work was partly supported by the National Science Foundation of China under Grants 62071397 and 61771016.

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China

    Mingxing Zhang

  2. School of Mathematics, Southwest Jiaotong University, Chengdu, China

    Zhengchun Zhou, Meng Yang & Yang Yang

  3. School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK

    Zilong Liu

Authors
  1. Mingxing Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhengchun Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zilong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meng Yang.

Ethics declarations

Conflict of interest

All authors have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, M., Zhou, Z., Yang, M. et al. A hybrid algorithm for the search of long binary sequences with low aperiodic autocorrelations. Soft Comput 25, 12725–12744 (2021). https://doi.org/10.1007/s00500-021-06084-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-06084-7

Keywords

Search

Navigation