HAL CCSD
Identification of bilinear forms with the kalman filter
Dogariu, Laura Maria
Ciochina, Silviu
Paleologu, Constantin
Benesty, Jacob
Piantanida, Pablo
University Politehnica of Bucharest [Romania] (UPB)
Institut National de la Recherche Scientifique [Québec] (INRS)
Laboratoire des signaux et systèmes (L2S) ; Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
International audience
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2018)
Calgary, Canada
hal-01742448
https://centralesupelec.hal.science/hal-01742448
https://centralesupelec.hal.science/hal-01742448
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2018), Apr 2018, Calgary, Canada. ⟨10.1109/icassp.2018.8461971⟩
DOI: 10.1109/icassp.2018.8461971
info:eu-repo/semantics/altIdentifier/doi/10.1109/icassp.2018.8461971
en
[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]
info:eu-repo/semantics/conferenceObject
Conference papers
In this paper, we develop the Kalman filter for the identification of bilinear forms. In this framework, the bilinear term is defined with respect to the impulse responses of a spatiotemporal model, which resembles a multiple-input/single-output system. Recently, the identification of such bilinear forms was addressed in terms of the Wiener filter and conventional adaptive algorithms, i.e., least-mean-square and recursive least-squares. In this work, apart from the derivation of the Kalman filter tailored for the identification of bilinear forms, a simplified (i.e., low complexity) version of the algorithm is also presented. Simulation results support the theoretical findings and indicate the good performance of the proposed solutions.
2018-04-15