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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Costas, J.P.: Medium constraints on sonar design and performance. FASCON CONV. Rec. 68A–68L (1975)
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)
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)
Gagliardi, R., Robbins, J., Taylor, H.: Acquisition sequences in PPM communications. IEEE Trans. Inform. Theory IT-33, 738–744 (1987)
Games, R.A.: An algebraic construction of sonar sequences using M-sequences. SIAM J. Algebraic Discrete Methods 8, 753–761 (1987)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation. Cambridge University Press, Cambridge (2005)
Golomb, S.W., Taylor, H.: Two-dimensional synchronization patterns for minimum ambiguity. IEEE Trans. Inform. Theory IT-28, 263–272 (1982)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights 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)