Conjugate gradient method in adaptive bilinear filtering

Tamal Bose, Mei Qin Chen

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

The application of the Conjugate Gradient (CG) method for the identification of bilinear systems is investigated. An algorithm based on the CG method is developed for adaptive bilinear digital filtering. In this algorithm, the optimization is done over blocks of input and output data rather than a single pair of data. However, only one iteration and coefficient update is done for every sample of data. This, coupled with the fact that the CG method used here does not require a line search makes it very efficient in computation. Simulation results show that this algorithm outperforms the LMS and RLS algorithms in terms of speed of convergence. A preconditioning technique is also applied to further accelerate the convergence in some cases.

Original languageEnglish (US)
Pages (from-to)1503-1508
Number of pages6
JournalIEEE Transactions on Signal Processing
Volume43
Issue number6
DOIs
StatePublished - Jun 1995
Externally publishedYes

Fingerprint

Conjugate gradient method
Adaptive filtering

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Conjugate gradient method in adaptive bilinear filtering. / Bose, Tamal; Chen, Mei Qin.

In: IEEE Transactions on Signal Processing, Vol. 43, No. 6, 06.1995, p. 1503-1508.

Research output: Contribution to journalArticle

@article{14eed178b1f54990a9f30a4f15f1f4d4,
title = "Conjugate gradient method in adaptive bilinear filtering",
abstract = "The application of the Conjugate Gradient (CG) method for the identification of bilinear systems is investigated. An algorithm based on the CG method is developed for adaptive bilinear digital filtering. In this algorithm, the optimization is done over blocks of input and output data rather than a single pair of data. However, only one iteration and coefficient update is done for every sample of data. This, coupled with the fact that the CG method used here does not require a line search makes it very efficient in computation. Simulation results show that this algorithm outperforms the LMS and RLS algorithms in terms of speed of convergence. A preconditioning technique is also applied to further accelerate the convergence in some cases.",
author = "Tamal Bose and Chen, {Mei Qin}",
year = "1995",
month = "6",
doi = "10.1109/78.388864",
language = "English (US)",
volume = "43",
pages = "1503--1508",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Conjugate gradient method in adaptive bilinear filtering

AU - Bose, Tamal

AU - Chen, Mei Qin

PY - 1995/6

Y1 - 1995/6

N2 - The application of the Conjugate Gradient (CG) method for the identification of bilinear systems is investigated. An algorithm based on the CG method is developed for adaptive bilinear digital filtering. In this algorithm, the optimization is done over blocks of input and output data rather than a single pair of data. However, only one iteration and coefficient update is done for every sample of data. This, coupled with the fact that the CG method used here does not require a line search makes it very efficient in computation. Simulation results show that this algorithm outperforms the LMS and RLS algorithms in terms of speed of convergence. A preconditioning technique is also applied to further accelerate the convergence in some cases.

AB - The application of the Conjugate Gradient (CG) method for the identification of bilinear systems is investigated. An algorithm based on the CG method is developed for adaptive bilinear digital filtering. In this algorithm, the optimization is done over blocks of input and output data rather than a single pair of data. However, only one iteration and coefficient update is done for every sample of data. This, coupled with the fact that the CG method used here does not require a line search makes it very efficient in computation. Simulation results show that this algorithm outperforms the LMS and RLS algorithms in terms of speed of convergence. A preconditioning technique is also applied to further accelerate the convergence in some cases.

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

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

U2 - 10.1109/78.388864

DO - 10.1109/78.388864

M3 - Article

VL - 43

SP - 1503

EP - 1508

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 6

ER -