Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Tracking of linear time-variant systems
 
conference paper

Tracking of linear time-variant systems

Haykin, S
•
Sayed, Ali H.  
•
Zeidler, J
Show more
1995
Conference Record on the IEEE Military Communications Conference, 1995. MILCOM'95
IEEE Military Communications Conference - MILCOM

In this paper we exploit the one-to-one correspondences between the recursive least-squares (RLS) and Kalman variables to formulate extended forms of the RLS algorithm. Two particular forms are considered, one pertaining to a system identification problem and the other to the tracking of a chirped sinusoid in additive noise. For both applications, experiments are presented that demonstrate the tracking optimality of the extended RLS algorithms, compared with the standard RLS and least-mean-squares (LMS) algorithms.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/MILCOM.1995.483537
Author(s)
Haykin, S
Sayed, Ali H.  
Zeidler, J
Yee, P
Wei, P
Date Issued

1995

Published in
Conference Record on the IEEE Military Communications Conference, 1995. MILCOM'95
Volume

2

Start page

602

End page

606

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ASL  
Event nameEvent placeEvent date
IEEE Military Communications Conference - MILCOM

San Diego, CA, USA

November 5-8, 1995

Available on Infoscience
December 19, 2017
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/143003
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés