{"title":"Simplified Kalman estimation of fading mobile radio channels: high performance at LMS computational load","authors":"L. Lindbom","doi":"10.1109/ICASSP.1993.319507","DOIUrl":null,"url":null,"abstract":"Low-complexity algorithms for channel estimation in Rayleigh fading environments are presented. The channel estimators are presumed to operate in conjunction with a Viterbi decoder, or an equalizer. The algorithms are based on simplified internal modeling of time-invariant channel coefficients and approximation of a Kalman estimator. A novel averaging approach is used to replace the online update of the Riccati equation with a constant matrix. The associated Kalman gain is expressed in an analytical form. Compared with RLS (recursive least squares) tracking, both a significantly lower bit error rate and a much lower computational complexity are achieved.<<ETX>>","PeriodicalId":428449,"journal":{"name":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"68","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1993.319507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 68
Abstract
Low-complexity algorithms for channel estimation in Rayleigh fading environments are presented. The channel estimators are presumed to operate in conjunction with a Viterbi decoder, or an equalizer. The algorithms are based on simplified internal modeling of time-invariant channel coefficients and approximation of a Kalman estimator. A novel averaging approach is used to replace the online update of the Riccati equation with a constant matrix. The associated Kalman gain is expressed in an analytical form. Compared with RLS (recursive least squares) tracking, both a significantly lower bit error rate and a much lower computational complexity are achieved.<>