✦ LIBER ✦

Fast generalized affine projection algorithm

✍ Scribed by Sundar G. Sankaran; A. A. (Louis) Beex

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 177 KB
Volume: 14
Category: Article
ISSN: 0890-6327
DOI: 10.1002/1099-1115(200009)14:6<623::aid-acs607>3.0.co;2-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Gauss-Seidel fast affine projection

The Gauss-Seidel fast affine projection algorithm for multichannel active noise control and sound reproduction systems

✍ Martin Bouchard; Felix Albu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB 👁 2 views

## Abstract In the field of adaptive filtering, the fast implementations of affine projection algorithms are known to provide a good tradeoff between convergence speed and computational complexity. Such algorithms have recently been published for multichannel active noise control systems. Previous

A fast algorithm for bounded generalized

A fast algorithm for bounded generalized processing networks

✍ J. David Fuller; B. Lan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 854 KB

Fast Spectral Projection Algorithms for

Fast Spectral Projection Algorithms for Density-Matrix Computations

✍ Gregory Beylkin; Nicholas Coult; Martin J Mohlenkamp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB

We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in, e.g., the Kohn-Sham iteration, and so obtain the electron density. We compute the spectral projector by constructing the matrix sign function through a simple

A Fast Algorithm for Grid Generation

✍ Stephen A. Jordan; Malcolm L. Spaulding 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Fast Search Algorithms for VQ Codebook G

Fast Search Algorithms for VQ Codebook Generation

✍ Jim Z.C. Lai; C.C. Lue 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter

Fast maximum intensity projection algori

Fast maximum intensity projection algorithm using shear warp factorization and reduced resampling

✍ Laifa Fang; Yi Wang; Bensheng Qiu; Yuancheng Qian 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 549 KB

## Abstract Maximal intensity projection (MIP) is routinely used to view MRA and other volumetric angiographic data. The straightforward implementation of MIP is ray casting that traces a volumetric data set in a computationally expensive manner. This article reports a fast MIP algorithm using shea