A block exact fast affine projection algorithm

Masashi Tanaka*, Shoji Makino, Junji Kojima

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)

Abstract

This paper describes .a block (affine) projection algorithm that has exactly the same convergence rate as the original sample-by-sample algorithm and smaller computational complexity than the fast affine projection algorithm. This is achieved by 1) introducing a correction term'that compensates for the filter output difference between the sample-by-sample projection algorithm and the straightforward block projection algorithm, and 2) applying a fast finite impulse response (FIR) filtering technique to compute filter outputs and to update the filter. We describe how to choose a pair of block lengths that gives the longest filter length under a constraint on the total computational complexity and processing delay. An example shows that the filter length can be doubled if a delay of a few hundred samples is permissible.

Original languageEnglish
Pages (from-to)79-86
Number of pages8
JournalIEEE Transactions on Speech and Audio Processing
Volume7
Issue number1
DOIs
Publication statusPublished - 1999
Externally publishedYes

Keywords

  • Adaptive filtering
  • Affine projection
  • Block exact

ASJC Scopus subject areas

  • Software
  • Acoustics and Ultrasonics
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A block exact fast affine projection algorithm'. Together they form a unique fingerprint.

Cite this