A block exact fast affine projection algorithm

Masashi Tanaka, Shoji Makino, Junji Kojima

研究成果: Article査読

41 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)79-86
ページ数8
ジャーナルIEEE Transactions on Speech and Audio Processing
7
1
DOI
出版ステータスPublished - 1999
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • 音響学および超音波学
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学

フィンガープリント

「A block exact fast affine projection algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル