A reduced complexity kalman-like algorithm for channel estimation and equalization

Yau Hee Kho, Desmond P. Taylor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The error rate performance of a previously developed reduced complexity channel estimator, known as the generalized least mean squares (GLMS) algorithm, is investigated in conjunction with a minimum-mean-square-error (MMSE) decision feedback equalizer (DFE). The channel estimator is based on the theory of polynomial prediction and Taylor series expansion of the underlying channel model in time domain. It is a simplification of the generalized recursive least squares (GRLS) estimator, achieved by replacing the online recursive computation of the 'intermediate' matrix by an offline pre-computed matrix. Similar to the GRLS estimator, it is able to operate in Rayleigh or Rician fading environment without reconfiguration of the state transition matrix to accommodate the non-random mean components. Simulation results show that it is able to offer a trade-off between reduced complexity channel estimation and good system performance.

Original languageEnglish
Title of host publicationIET Conference Publications
Pages235-238
Number of pages4
Edition545 CP
DOIs
Publication statusPublished - 2008
Externally publishedYes
EventIET 2nd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2008 - Beijing, China
Duration: Oct 12 2008Oct 15 2008

Other

OtherIET 2nd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2008
CountryChina
CityBeijing
Period10/12/0810/15/08

Fingerprint

Channel estimation
Decision feedback equalizers
Taylor series
Mean square error
Polynomials

Keywords

  • Channel estimation
  • Equalization
  • Wireless communications

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Kho, Y. H., & Taylor, D. P. (2008). A reduced complexity kalman-like algorithm for channel estimation and equalization. In IET Conference Publications (545 CP ed., pp. 235-238) https://doi.org/10.1049/cp:20080980

A reduced complexity kalman-like algorithm for channel estimation and equalization. / Kho, Yau Hee; Taylor, Desmond P.

IET Conference Publications. 545 CP. ed. 2008. p. 235-238.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kho, YH & Taylor, DP 2008, A reduced complexity kalman-like algorithm for channel estimation and equalization. in IET Conference Publications. 545 CP edn, pp. 235-238, IET 2nd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2008, Beijing, China, 10/12/08. https://doi.org/10.1049/cp:20080980
Kho YH, Taylor DP. A reduced complexity kalman-like algorithm for channel estimation and equalization. In IET Conference Publications. 545 CP ed. 2008. p. 235-238 https://doi.org/10.1049/cp:20080980
Kho, Yau Hee ; Taylor, Desmond P. / A reduced complexity kalman-like algorithm for channel estimation and equalization. IET Conference Publications. 545 CP. ed. 2008. pp. 235-238
@inproceedings{4d03984c321248309a1dab69ba8a3d10,
title = "A reduced complexity kalman-like algorithm for channel estimation and equalization",
abstract = "The error rate performance of a previously developed reduced complexity channel estimator, known as the generalized least mean squares (GLMS) algorithm, is investigated in conjunction with a minimum-mean-square-error (MMSE) decision feedback equalizer (DFE). The channel estimator is based on the theory of polynomial prediction and Taylor series expansion of the underlying channel model in time domain. It is a simplification of the generalized recursive least squares (GRLS) estimator, achieved by replacing the online recursive computation of the 'intermediate' matrix by an offline pre-computed matrix. Similar to the GRLS estimator, it is able to operate in Rayleigh or Rician fading environment without reconfiguration of the state transition matrix to accommodate the non-random mean components. Simulation results show that it is able to offer a trade-off between reduced complexity channel estimation and good system performance.",
keywords = "Channel estimation, Equalization, Wireless communications",
author = "Kho, {Yau Hee} and Taylor, {Desmond P.}",
year = "2008",
doi = "10.1049/cp:20080980",
language = "English",
isbn = "9780863419256",
pages = "235--238",
booktitle = "IET Conference Publications",
edition = "545 CP",

}

TY - GEN

T1 - A reduced complexity kalman-like algorithm for channel estimation and equalization

AU - Kho, Yau Hee

AU - Taylor, Desmond P.

PY - 2008

Y1 - 2008

N2 - The error rate performance of a previously developed reduced complexity channel estimator, known as the generalized least mean squares (GLMS) algorithm, is investigated in conjunction with a minimum-mean-square-error (MMSE) decision feedback equalizer (DFE). The channel estimator is based on the theory of polynomial prediction and Taylor series expansion of the underlying channel model in time domain. It is a simplification of the generalized recursive least squares (GRLS) estimator, achieved by replacing the online recursive computation of the 'intermediate' matrix by an offline pre-computed matrix. Similar to the GRLS estimator, it is able to operate in Rayleigh or Rician fading environment without reconfiguration of the state transition matrix to accommodate the non-random mean components. Simulation results show that it is able to offer a trade-off between reduced complexity channel estimation and good system performance.

AB - The error rate performance of a previously developed reduced complexity channel estimator, known as the generalized least mean squares (GLMS) algorithm, is investigated in conjunction with a minimum-mean-square-error (MMSE) decision feedback equalizer (DFE). The channel estimator is based on the theory of polynomial prediction and Taylor series expansion of the underlying channel model in time domain. It is a simplification of the generalized recursive least squares (GRLS) estimator, achieved by replacing the online recursive computation of the 'intermediate' matrix by an offline pre-computed matrix. Similar to the GRLS estimator, it is able to operate in Rayleigh or Rician fading environment without reconfiguration of the state transition matrix to accommodate the non-random mean components. Simulation results show that it is able to offer a trade-off between reduced complexity channel estimation and good system performance.

KW - Channel estimation

KW - Equalization

KW - Wireless communications

UR - http://www.scopus.com/inward/record.url?scp=69249117025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69249117025&partnerID=8YFLogxK

U2 - 10.1049/cp:20080980

DO - 10.1049/cp:20080980

M3 - Conference contribution

SN - 9780863419256

SP - 235

EP - 238

BT - IET Conference Publications

ER -