• DocumentCode
    1899671
  • Title

    Rooting versus joint diagonalization in 2-D harmonic retrieval

  • Author

    Pesavento, Marius ; Böhme, Johann E.

  • Author_Institution
    Signal Theor. Group, Ruhr-Univ., Bochum, Germany
  • fYear
    2004
  • fDate
    18-21 July 2004
  • Firstpage
    303
  • Lastpage
    307
  • Abstract
    We address the problem of estimating the harmonics of a two-dimensional exponential mixture. A new algorithms that exploits the multiple-invariance structure is proposed. Unlike previous ESPRIT type methods for two- or multi-dimensional harmonic estimation that are based on joint diagonalization the new algorithm uses polynomial rooting to efficiently obtain the parameters of interest. We reveal a close relations to the recently proposed MD-RARE and show that in the new algorithm, referred to as the rooted multiple-invariance MD-ESPRIT, the degrees of the characteristic polynomials are reduced by a factor two compared to the MD-RARE polynomials. This leads to lower computational complexity and improved numerical stability of the estimation procedure.
  • Keywords
    array signal processing; computational complexity; harmonic analysis; numerical stability; polynomials; 2-D harmonic retrieval; computational complexity; joint diagonalization; multidimensional harmonic estimation; multiple-invariance structure; numerical stability; polynomial rooting; two-dimensional exponential mixture; Additive noise; Array signal processing; Computational complexity; Covariance matrix; Mobile communication; Numerical stability; Parameter estimation; Polynomials; Sensor arrays; Sensor phenomena and characterization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2004
  • Print_ISBN
    0-7803-8545-4
  • Type

    conf

  • DOI
    10.1109/SAM.2004.1502958
  • Filename
    1502958