Fast surface-search algorithm for adaptive FIR filtering

Da Zheng Feng, Wei Xing Zheng

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

This paper proposes a fast surface search (FSS) algorithm for adaptive FIR filtering. The proposed algorithm depends on the efficient calculation of the fast gain vector (FGA) defined in [13], and the rank-one updating formula of the correlation matrix of the input vector sequence. This algorithm is of computational complexity O(M), which is comparable with the fast recursive least squares transversal filters for adaptive FIR filtering. The global convergence of the proposed algorithm is studied by the Lyapunov indirect method. The performances of the relative algorithms are shown via computer simulations.

Original languageEnglish
Title of host publication2004 7th International Conference on Signal Processing Proceedings, ICSP
Pages374-377
Number of pages4
Publication statusPublished - 2004
Event2004 7th International Conference on Signal Processing Proceedings, ICSP - Beijing, China
Duration: 31 Aug 20044 Sept 2004

Publication series

Name2004 7th International Conference on Signal Processing Proceedings, ICSP

Conference

Conference2004 7th International Conference on Signal Processing Proceedings, ICSP
Country/TerritoryChina
CityBeijing
Period31/08/044/09/04

Fingerprint

Dive into the research topics of 'Fast surface-search algorithm for adaptive FIR filtering'. Together they form a unique fingerprint.

Cite this