Estimation of Autoregressive Fading Channels Based on Two Cross-Coupled H∞ Filters
dc.contributor.author | Jamoos, Ali | |
dc.contributor.author | Grivel, Eric | |
dc.contributor.author | Christov, Nicolai | |
dc.contributor.author | Najim, Mohamed | |
dc.date.accessioned | 2018-08-13T07:36:34Z | |
dc.date.available | 2018-08-13T07:36:34Z | |
dc.date.issued | 2008-11-28 | |
dc.description.abstract | This paper deals with the on-line estimation of time-varying frequency-flat Rayleigh fading channels based on training sequences and using H∞ filtering. When the fading channel is approximated by an autoregressive (AR) process, the AR model parameters must be estimated. As their direct estimations from the available noisy observations at the receiver may yield biased values, the joint estimation of both the channel and its AR parameters must be addressed. Among the existing solutions to this joint estimation issue, Expectation Maximization (EM) algorithm or crosscoupled filter based approaches can be considered. They usually require Kalman filtering which is optimal in the H2 sense provided that the initial state, the driving process and measurement noise are independent, white and Gaussian. However, in real cases, these assumptions may not be satisfied. In addition, the state-space matrices and the noise variances are not necessarily accurately estimated. To take into account the above problem,we propose to use two crosscoupled H∞ filters. This method makes it possible to provide robust estimation of the fading channel and its AR parameters. | en_US |
dc.identifier.uri | https://dspace.alquds.edu/handle/20.500.12213/733 | |
dc.language.iso | en_US | en_US |
dc.publisher | Springer Publishing Company | en_US |
dc.subject | Rayleigh fading channels | en_US |
dc.subject | Autoregressive | en_US |
dc.subject | processes | en_US |
dc.subject | Kalman filtering | en_US |
dc.subject | H∞ filtering | en_US |
dc.title | Estimation of Autoregressive Fading Channels Based on Two Cross-Coupled H∞ Filters | en_US |
dc.type | Article | en_US |