53 research outputs found

    Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

    Get PDF
    The Multiple Shift Maximum Element Sequential Matrix Diagonalisation (MSME-SMD) algorithm is a powerful but costly method for performing approximate polynomial eigenvalue decomposition (PEVD) for space-time covariance-type matrices encountered in e.g. broadband array processing. This paper discusses a newly developed search method that restricts the order growth within the MSME-SMD algorithm. In addition to enhanced control of the polynomial degree of the paraunitary and parahermitian factors in this decomposition, the new search method is also computationally less demanding as fewer elements are searched compared to the original while the excellent diagonalisation of MSME-SMD is maintained

    Performance trade-offs in sequential matrix diagonalisation search strategies

    Get PDF
    Recently a selection of sequential matrix diagonalisation (SMD) algorithms have been introduced which approximate polynomial eigenvalue decomposition of parahermitian matrices. These variants differ only in the search methods that are used to bring energy onto the zero-lag. Here we analyse the search methods in terms of their computational complexities for different sizes of parahermitian matrices which are verified through simulated execution times. Another important factor for these search methods is their ability to transfer energy. Simulations show that the more computationally complex search methods transfer a greater proportion of the off-diagonal energy onto the zero-lag over a selected range of parahermitian matrix sizes. Despite their higher cost per iteration experiments indicate that the more complex search algorithms still converge faster in real time

    Maximum energy sequential matrix diagonalisation for parahermitian matrices

    Get PDF
    Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10% of the optimum energy transfer per iteration step

    Analysing the performance of divide-and-conquer sequential matrix diagonalisation for large broadband sensor arrays

    Get PDF
    A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is an extension of the ordinary EVD to polynomial matrices and will diagonalise a parahermitian matrix using paraunitary operations. Inspired by recent work towards a low complexity divide-and-conquer PEVD algorithm, this paper analyses the performance of this algorithm - named divide-and-conquer sequential matrix diagonalisation (DC-SMD) - for applications involving broadband sensor arrays of various dimensionalities. We demonstrate that by using the DC-SMD algorithm instead of a traditional alternative, PEVD complexity and execution time can be significantly reduced. This reduction is shown to be especially impactful for broadband multichannel problems involving large arrays

    Impact of fast-converging PEVD algorithms on broadband AoA estimation

    Get PDF
    Polynomial matrix eigenvalue decomposition (PEVD) algorithms have been shown to enable a solution to the broadband angle of arrival (AoA) estimation problem. A parahermitian cross-spectral density (CSD) matrix can be generated from samples gathered by multiple array elements. The application of the PEVD to this CSD matrix leads to a paraunitary matrix which can be used within the spatio-spectral polynomial multiple signal classification (SSP-MUSIC) AoA estimation algorithm. Here, we demonstrate that the recent low-complexity divide-and-conquer sequential matrix diagonalisation (DC-SMD) algorithm, when paired with SSP-MUSIC, is able to provide superior AoA estimation versus traditional PEVD methods for the same algorithm execution time. We also provide results that quantify the performance trade-offs that DC-SMD offers for various algorithm parameters, and show that algorithm convergence speed can be increased at the expense of increased decomposition error and poorer AoA estimation performance

    Divide-and-conquer sequential matrix diagonalisation for parahermitian matrices

    Get PDF
    A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and will diagonalise a parahermitian matrix via paraunitary operations. Inspired by the existence of low complexity divide-and-conquer solutions to eigenproblems, this paper addresses a divide-and-conquer approach to the PEVD utilising the sequential matrix diagonalisation (SMD) algorithm. We demonstrate that with the proposed techniques, encapsulated in a novel algorithm titled divide-and-conquer sequential matrix diagonalisation (DC-SMD), algorithm complexity can be significantly reduced. This reduction impacts on a number of broadband multichannel problems, including those involving large arrays

    Shortening of paraunitary matrices obtained by polynomial eigenvalue decomposition algorithms

    Get PDF
    This paper extends the analysis of the recently introduced row-shift corrected truncation method for paraunitary matrices to those produced by the state-of-the-art sequential matrix diagonalisation (SMD) family of polynomial eigenvalue decomposition (PEVD) algorithms. The row-shift corrected truncation method utilises the ambiguity in the paraunitary matrices to reduce their order. The results presented in this paper compare the effect a simple change in PEVD method can have on the performance of the paraunitary truncation. In the case of the SMD algorithm the benefits of the new approach are reduced compared to what has been seen before however there is still a reduction in both reconstruction error and paraunitary matrix order

    Cyclic-by-row approximation of iterative polynomial EVD algorithms

    Get PDF
    A recent class of sequential matrix diagonalisation (SMD) algorithms have been demonstrated to provide a fast converging solution to iteratively approximating the polynomial eigenvalue decomposition of a parahermitian matrix. However, the calculation of an EVD, and the application of a full unitary matrix to every time lag of the parahermitian matrix in the SMD algorithm results in a high numerical cost. In this paper, we replace the EVD with a limited number of Givens rotations forming a cyclic-by-row Jacobi sweep. Simulations indicate that a considerable reduction in computational complexity compared to SMD can be achieved with a negligible sacrifice in diagonalisation performance, such that the benefits in applying the SMD are maintained

    Memory and complexity reduction in parahermitian matrix manipulations of PEVD algorithms

    Get PDF
    A number of algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and will diagonalise a parahermitian matrix via paraunitary operations. This paper addresses savings — both computationally and in terms of memory use — that exploit the parahermitian structure of the matrix being decomposed, and also suggests an implicit trimming approach to efficiently curb the polynomial order growth usually observed during iterations of the PEVD algorithms. We demonstrate that with the proposed techniques, both storage and computations can be significantly reduced, impacting on a number of broadband multichannel problems

    Polynomial subspace decomposition for broadband angle of arrival estimation

    Get PDF
    In this paper we study the impact of polynomial or broadband subspace decompositions on any subsequent processing, which here uses the example of a broadband angle of arrival estimation technique using a recently proposed polynomial MUSIC (P-MUSIC) algorithm. The subspace decompositions are performed by iterative polynomial EVDs, which differ in their approximations to diagonalise and spectrally majorise s apce-time covariance matrix.We here show that a better diagonalisation has a significant impact on the accuracy of defining broadband signal and noise subspaces, demonstrated by a much higher accuracy of the P-MUSIC spectrum
    • …
    corecore