Skip to main content
Springer Nature Link
Log in

A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels

  • Conference paper
Sequences and Their Applications - SETA 2004 (SETA 2004)

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

Included in the following conference series:

Abstract

The group structure of the 2-dimensional sidelobe-invariant transformations for binary arrays is characterized. The design of an efficient exhaustive backtracking search algorithm, which exploits such group structure to reduce the search space and, in the meantime, applies the partially determined autocorrelation values as backtracking conditions, is presented. As a consequence of applying the algorithm, all optimal binary arrays with minimum peak sidelobe levels consisting of up to 49 elements are obtained and tabulated.

This work was supported by the National Science Foundation of China (NSFC) and the Research Grants Council of Hong Kong (RGC) joint research scheme with Project No. N_HKUST617/02 (No. 60218001).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alquaddoomi, S., Scholtz, R.A.: On the nonexistence of Barker arrays and related matters. IEEE Transactions on Information Theory 35(5), 1048–1057 (1989)

    Article  MathSciNet  Google Scholar 

  2. Kutruff, H., Quadt, H.P.: Ebene Schallstrallergruppen mit Ungebündelter Abstrahlung (Plane sound source arrays with omnidirectional radiation). Acoustica 50, 273–279 (1982)

    Google Scholar 

  3. El-Khamy, S.E., Abdel-Alim, O.A., Rushdi, A.M., Banah, A.H.: Code-fed omnidirectional arrays. IEEE Journal of Oceanic Engineering 14(4), 384–395 (1989)

    Article  Google Scholar 

  4. Skinner, G.K.: Imaging with coded-aperture masks. Nucl. Instrum. Methods 220, 33–40 (1984)

    Google Scholar 

  5. Tirkel, A.Z., Hall, T.E.: A unique watermark for every image. IEEE Multimedia 8(4), 30–37 (2001)

    Article  Google Scholar 

  6. Cohen, M.N., Fox, M.R., Baden, J.M.: Minimum peak sidelobe pulse compression codes. In: Proc. of 1990 IEEE Radar Conference, May 7-10, pp. 633–638 (1990)

    Google Scholar 

  7. Fourdan, L.M.: About the enumeration of best biphase codes. IEEE Transactions on Signal Processing 39(6), 1427–1428 (1991)

    Article  Google Scholar 

  8. Mow, W.H.: Comments on About enumeration of best biphase codes. IEEE Trans. on signal Processing 42(7), 18–76 (1994)

    MathSciNet  Google Scholar 

  9. Smith, T.L.: Extra-special groups of order 32 as Galois groups. Canad. J. Math. 46, 886–896 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Golomb, S.W., Baumert, L.D.: Backtrack programming. Journal ACM 124), 516–524 (1965)

    Article  MathSciNet  Google Scholar 

  11. Golay, M.J.E., Harris, D.B.A.: New search for skewsymmetric binary sequences with optimal merit factors. IEEE Transactions on Information Theory 36(5), 1163–1166 (1990)

    Article  Google Scholar 

  12. Mow, W.H.: Enumeration techniques for best N-phase codes. Electronics Letters 29(10), 907–908 (1993)

    Article  Google Scholar 

  13. Coxson, G.E., Hirschel, A., Cohen, M.N.: New results on minimum-PSL binary codes. In: Proc. of 2001 IEEE Radar Conference, May 1-3, pp. 153–156 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India

    Gummadi S. Ramakrishna

  2. Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong S.A.R, China

    Wai Ho Mow

Authors
  1. Gummadi S. Ramakrishna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wai Ho Mow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. University of Ilinois at Urbana-Champaign, 1406 West Green Street, IL 61801, Urbana, USA

    Dilip Sarwate

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramakrishna, G.S., Mow, W.H. (2005). A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_26

Download citation

  • DOI: https://doi.org/10.1007/11423461_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26084-4

  • Online ISBN: 978-3-540-32048-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics