Recursive least-squares backpropagation algorithm for stop-and-go decision-directed blind equalization

Shafayat Abrar*, Azzedine Zerguine, Maamar Bettayeb

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

Stop-and-go decision-directed (S & G-DD) equalization is the most primitive blind equalization (BE) method for the cancelling of intersymbol-interference in data communication systems. Recently, this scheme has been applied to complex-valued multilayer feedforward neural network, giving robust results with a lower mean-square error at the expense of slow convergence. To overcome this problem, in this work, a fast converging recursive least squares (RLS)-based complex-valued backpropagation learning algorithm is derived for S & G-DD blind equalization. Simulation results show the effectiveness of the proposed algorithm in terms of initial convergence.

Original languageEnglish
Pages (from-to)1472-1481
Number of pages10
JournalIEEE Transactions on Neural Networks
Volume13
Issue number6
DOIs
StatePublished - Nov 2002

Bibliographical note

Funding Information:
The authors acknowledge the support of KFUPM. The authors like to thank the anonymous reviewers for their constructive suggestions which has helped improve the paper.

Keywords

  • Complex-valued backpropagation algorithm
  • Recursive least squares (RLS) algorithm
  • Stop-and-go decision-directed (S & G-DD) blind equalization (BE) algorithm

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Recursive least-squares backpropagation algorithm for stop-and-go decision-directed blind equalization'. Together they form a unique fingerprint.

Cite this