Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Wireless Personal Co...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Wireless Personal Communications
Article . 2019 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Tracking Performance of Robust RLS Algorithm for MIMO Channel Estimation

Authors: Hasan Raza; Noor M. Khan;

Tracking Performance of Robust RLS Algorithm for MIMO Channel Estimation

Abstract

A robust recursive least square (RRLS) algorithm that has been designed for SISO communications by Bhotto and Antoniou (IEEE Signal Process Lett 18(3):185–188, 2011) is unable to work for MIMO system because of single error constraint. In this paper, a modified version of RRLS algorithm with the application of MIMO channel estimation is introduced. An RRLS algorithm is modified in such a way that it can provide much faster convergence rate in MIMO channel estimation than that of RLS and variable forgetting factor RLS (VFF-RLS) algorithms. Moreover, the optimum forgetting factor is derived for MIMO RRLS in order to minimize the error function. Simulation results show that the MIMO RRLS provides fast convergence performance as compared to RLS and VFF-RLS algorithms without additional multiplication complexity, however, an additional linear term of N in the addition complexity of modified MIMO RRLS does not enhance its computational complexity and keeps it almost equivalent to those of RLS and VFF-RLS algorithms. Moreover, it is observed that the optimum forgetting factor is highly dependent on RRLS scaling parameter, $$E_b/N_o$$, doppler shift and number of antennas.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!