Pairwise optimal weight realization - Acceleration technique for set-theoretic adaptive parallel subgradient projection algorithm

Masahiro Yukawa, Isao Yamada

研究成果: Article査読

29 被引用数 (Scopus)

抄録

The adaptive parallel subgradient projection (PSP) algorithm was proposed in 2002 as a set-theoretic adaptive filtering algorithm providing fast and stable convergence, robustness against noise, and low computational complexity by using weighted parallel projections onto multiple time-varying closed half-spaces. In this paper, we present a novel weighting technique named pairwise optimal weight realization (POWER) for further acceleration of the adaptive PSP algorithm. A simple closed-form formula is derived to compute the projection onto the intersection of two closed half-spaces defined by a triplet of vectors. Using the formula inductively, the proposed weighting technique realizes a good direction of update. The resulting weights turn out to be pairwise optimal in a certain sense. The proposed algorithm has the inherently parallel structure composed of q primitive functions, hence its total computational complexity O(qrN) is reduced to O(rN) with q concurrent processors (r: a constant positive integer). Numerical examples demonstrate that the proposed technique for r =1 yields significantly faster convergence than not only adaptive PSP with uniform weights, affine projection algorithm, and fast Newton transversal filters but also the regularized recursive least squares algorithm.

本文言語English
ページ(範囲)4557-4571
ページ数15
ジャーナルIEEE Transactions on Signal Processing
54
12
DOI
出版ステータスPublished - 2006 12
外部発表はい

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

フィンガープリント 「Pairwise optimal weight realization - Acceleration technique for set-theoretic adaptive parallel subgradient projection algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル