Exploring Costas Arrays Search Through Bidirectional Circular Linked Lists

This paper explores the optimization of Costas arrays search through the utilization of bidirectional circular linked lists. Costas arrays are integral in various applications, such as wireless communication, optical wireless communications, radar, sonar, owing to their autocorrelation properties. While enumeration and algebraic construction are primary methods for obtaining Costas arrays, there remains room for improvement in existing vector-based enumeration algorithms. Building upon these algorithms, this paper introduces the use of bidirectional circular linked lists to enhance storage efficiency for column indices. This transformation simplifies the process of generating permutation matrices by converting it into permutation generation, thereby eliminating the need to verify generated permutations as permutation matrices and reducing algorithm complexity. Empirical results demonstrate a significant enhancement in search efficiency following the implementation of bidirectional circular linked lists.