Skip to main content

A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences

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

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

Included in the following conference series:

  • 916 Accesses

Abstract

We report some results of an extensive computer search for m ×n modular sonar sequences and estimate the number of inequivalent examples of size m ×n using a probabilistic approach. Evidence indicates strongly that a full size example exists with extremely small probability for large m.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Costas, J.P.: Medium constraints on sonar design and performance. FASCON CONV. Rec. 68A–68L (1975)

    Google Scholar 

  2. Erdös, P., Graham, R.L., Ruzsa, I.Z., Taylor, H.: Bounds for arrays of dots with distinct slopes or lengths. Combinatorica 12, 1–6 (1992)

    Article  MathSciNet  Google Scholar 

  3. Moreno, O., Games, R.A., Taylor, H.: Sonar sequences from costas arrays and the best known sonar sequences with up to 100 symbols. IEEE Trans. Inform. Theory 39(6) (November 1987)

    Google Scholar 

  4. Gagliardi, R., Robbins, J., Taylor, H.: Acquisition sequences in PPM communications. IEEE Trans. Inform. Theory IT-33, 738–744 (1987)

    Article  Google Scholar 

  5. Games, R.A.: An algebraic construction of sonar sequences using M-sequences. SIAM J. Algebraic Discrete Methods 8, 753–761 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Golomb, S.W., Gong, G.: Signal Design for Good Correlation. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  7. Golomb, S.W., Taylor, H.: Two-dimensional synchronization patterns for minimum ambiguity. IEEE Trans. Inform. Theory IT-28, 263–272 (1982)

    MathSciNet  Google Scholar 

  8. Yoon., S.-J., Song, H.-Y.: Existence of Modular Sonar Sequences of Twin-Prime Product Length. In: Golomb, S.W., Gong, G., Helleseth, T., Song, H.-Y. (eds.) SSC 2007. LNCS, vol. 4893, pp. 184–191. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Silverman, J., Vickers, V.E., Mooney, J.M.: On the number of Costas arrays as a function of array size. Proceedings of the IEEE 76(7) (July 1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Solomon W. Golomb Matthew G. Parker Alexander Pott Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, KH., Song, HY. (2008). A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85912-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85911-6

  • Online ISBN: 978-3-540-85912-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics