Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A New Method for Low Rank Transform Domain Adaptive Filtering (CROSBI ID 92474)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Raghothaman, Balaji ; Linebarger, Darel ; Begušić, Dinko A New Method for Low Rank Transform Domain Adaptive Filtering // IEEE transactions on signal processing, 48 (2000), 4; 1097-1109-x

Podaci o odgovornosti

Raghothaman, Balaji ; Linebarger, Darel ; Begušić, Dinko

engleski

A New Method for Low Rank Transform Domain Adaptive Filtering

This paper introduces a least squares, matrix-based framework for adaptive filtering that includes normalized least mean squares (NLMS), Affine projection (AP) and recursive least squares (RLS) as special cases. We then introduce a method for extracting a low-rank underdetermined solution from an overdetermined or a high-rank underdetermined least squares problem using a part of a unitary transformation. We show how to create optimal, low-rank transformations within this framework. For obtaining compuitationally competitive versions of our approach, we use the discrete Fourier transform (DFT). We convert the complex-valued DFT-based solution into a real solution. The most significant bottleneck in the optimal version of the algorithm lies in having to calculate the full-length transform domain error vector. We overcome this difficulty by using a statistical approach involving the transform of the signal rather than that of the error to estimate the best low-rank transform at each iteration. We also employ an innovative mixed domain approach, in which we jointly solve time and freuency domain equations. This allows us to achieve very good performance using a transform order that is lower than the length of the filter. Thus, we are able to achieve very fast convergence at low complexity. Using the acoustic echo cancellation problem, we show that our algorithm performs better than NLMS and AP and competes well with FTF-RLS for low SNR conditions. The algorithm lies between affine projection and FTF-RLS, both in terms of its complexity and its performance.

Acoustic echo cancellation; adaptive filtering; low rank; reduced rank; transform domain; mixed domain

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

48 (4)

2000.

1097-1109-x

objavljeno

1053-587X

Povezanost rada

Elektrotehnika

Indeksiranost