Costas arrays are permutation matrices that meet the additional Costas condition. The Costas condition requires that when a Costas array defines the frequencies in a frequency jump burst and a signal is processed with a matched filter, then for any time or Doppler offset other than both zero, only one pulse will be at peak response at a time. Specific formulations of the Costas conditions provide a vector-matrix arithmetic representation where the matrix has eigenvalues that are square roots of integers and eigenvectors that can be scaled to have elements that are all integers. Polynomials are given for squared eigenvalues and for elements of scaled right eigenvector elements. A database of these singular value decompositions is provided on IEEE DataPort for orders from 3 to 1030, with left eigenvectors to order 100. We include proofs of validity and configuration. The right eigenvectors and the eigenvalues map a Costas array vector into its eigenspace. Functions of these vectors can be associated with system performance metrics so that these mapped vectors may be used to select and rank Costas arrays and is suitable for real-time system implementation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Singular Value Decomposition of a Matrix Representation of the Costas Condition for Costas Array Selection


    Contributors:


    Publication date :

    2021-04-01


    Size :

    2508761 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Modified Costas signal

    Levanon, N. / Mozeson, E. | IEEE | 2004


    Staggered Costas Signals

    Freedman, Avraham / Levanon, Nadav | IEEE | 1986


    Modified Costas Signal

    Levanon, N. | Online Contents | 2004


    Costas array generation and search methodology

    Beard, J.K. / Russo, J.C. / Erickson, K.G. et al. | IEEE | 2007


    Costas Array Generation and Search Methodology

    Beard, J.K. | Online Contents | 2007