By Topic

Stochastic Search for Costas Arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rickard, S. ; Sch. of Electr. Electron. & Mech. Eng., Univ. Coll. Dublin ; Healy, J.

We present methods for searching for Costas arrays of arbitrary size starting from a random permutation matrix. The permutation is made "more Costas" by swapping a small number of elements in the permutation so that number of repeated values within each line of the difference triangle is reduced. This process is iterated until each line of the difference triangle contains no repeated values which indicates that a Costas array has been found. In the event that the method cannot improve further the permutation, the process is started again from another random permutation. We compare the performance of variants of this method. Also, we present results of analysis and test runs on the database of known Costas arrays up to size 26 which show that such stochastic techniques are extremely unlikely to succeed for the N we are interested in, namely N>26. Also, as a result of the database analysis, we unveil a 23-by-23 Costas array with a most interesting property.

Published in:

Information Sciences and Systems, 2006 40th Annual Conference on

Date of Conference:

22-24 March 2006