• DocumentCode
    2554390
  • Title

    A novel adaptive direction finding using Kalman algorithm

  • Author

    Chen, Y.-H. ; Chiang, C.-T.

  • Author_Institution
    Inst. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
  • fYear
    1993
  • fDate
    June 28 1993-July 2 1993
  • Firstpage
    1888
  • Abstract
    In an attempt to improve the convergence rate, the authors introduce a novel Kalman noise-subspace estimator for the estimation of DOAs (directions of arrival). If the initial conditions are properly chosen as an identity matrix form, the Kalman-based estimator can estimate the complete noise subspace without a priori knowledge of the number of sources and the inflation method. The estimated weight vectors of the proposed algorithm are proved to approximately converge to the noise subspace for the high-SNR scenario. Simulation results show that the proposed algorithm has a much faster convergence rate and better mean square error performance than J. F. Yang and M. Kaveh´s (1988) method.<>
  • Keywords
    adaptive Kalman filters; adaptive estimation; computational complexity; convergence of numerical methods; direction-of-arrival estimation; eigenvalues and eigenfunctions; radio direction-finding; simulation; DOA estimation; Kalman noise-subspace estimator; adaptive direction finding; algorithm; convergence rate; directions of arrival; estimated weight vectors; identity matrix; mean square error performance; Convergence; Direction of arrival estimation; Equations; Kalman filters; Linear antenna arrays; Matrix decomposition; Multiple signal classification; Noise measurement; Power measurement; Signal to noise ratio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Antennas and Propagation Society International Symposium, 1993. AP-S. Digest
  • Conference_Location
    Ann Arbor, MI, USA
  • Print_ISBN
    0-7803-1246-5
  • Type

    conf

  • DOI
    10.1109/APS.1993.385573
  • Filename
    385573