This paper deals with the identification of an autoregressive (AR) process disturbed by an additive moving-average (MA) noise. Our approach operates as follows: Firstly, the AR parameters are estimated by using the overdetermined high-order Yule–Walker equations. The variance of the AR process driving process can be deduced by means of an orthogonal projection between two types of estimates of AR process correlation vectors. Then, the correlation sequence of the MA noise is estimated. Secondly, the MA parameters are obtained by using inner–outer factorization. To study the relevance of the resulting method, we compare it with existing algorithms, and we analyze the identifiability limits. The identification approach is then combined with Kalman filtering for channel estimation in mobile communication systems.
Abdou, A., Turcu, F., Grivel, E., Diversi, R., Ferré, G. (2015). Identifying an autoregressive process disturbed by a moving-average noise using inner–outer factorization. SIGNAL, IMAGE AND VIDEO PROCESSING, 9(S1), 235-244 [10.1007/s11760-015-0803-3].
Identifying an autoregressive process disturbed by a moving-average noise using inner–outer factorization
DIVERSI, ROBERTO;
2015
Abstract
This paper deals with the identification of an autoregressive (AR) process disturbed by an additive moving-average (MA) noise. Our approach operates as follows: Firstly, the AR parameters are estimated by using the overdetermined high-order Yule–Walker equations. The variance of the AR process driving process can be deduced by means of an orthogonal projection between two types of estimates of AR process correlation vectors. Then, the correlation sequence of the MA noise is estimated. Secondly, the MA parameters are obtained by using inner–outer factorization. To study the relevance of the resulting method, we compare it with existing algorithms, and we analyze the identifiability limits. The identification approach is then combined with Kalman filtering for channel estimation in mobile communication systems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.