Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Analysis of the partitioned frequency-domain block LMS (PFBLMS) algorithm
Autore:
Chan, KS; Farhang-Boroujeny, B;
Indirizzi:
Natl Univ Singapore, Data Storage Inst, Singapore 0511, Singapore Natl Univ Singapore Singapore Singapore 0511 , Singapore 0511, Singapore Univ Utah, Dept Elect Engn, Salt Lake City, UT 84112 USA Univ Utah Salt Lake City UT USA 84112 Engn, Salt Lake City, UT 84112 USA
Titolo Testata:
IEEE TRANSACTIONS ON SIGNAL PROCESSING
fascicolo: 9, volume: 49, anno: 2001,
pagine: 1860 - 1874
SICI:
1053-587X(200109)49:9<1860:AOTPFB>2.0.ZU;2-E
Fonte:
ISI
Lingua:
ENG
Soggetto:
ACOUSTIC ECHO CANCELLATION; ADAPTIVE DIGITAL-FILTERS; EFFICIENT IMPLEMENTATION; PERFORMANCE;
Keywords:
adaptive filters; block LMS; FBLMS; frequency domain; partitioned FBLMS;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
--discip_EC--
Citazioni:
28
Recensione:
Indirizzi per estratti:
Indirizzo: Chan, KS Natl Univ Singapore, Data Storage Inst, Singapore 0511, SingaporeNatl Univ Singapore Singapore Singapore 0511 re 0511, Singapore
Citazione:
K.S. Chan e B. Farhang-Boroujeny, "Analysis of the partitioned frequency-domain block LMS (PFBLMS) algorithm", IEEE SIGNAL, 49(9), 2001, pp. 1860-1874

Abstract

In this paper, we present a new analysis of the partitioned frequency-domain block least-mean-square (PFBLMS) algorithm. We analyze the matrices thatcontrol the convergence rates of the various forms of the PEBLMS algorithmand evaluate their eigenvalues for both white and colored input processes. Because of the complexity of the problem, the detailed analyses are only given for the case where the filter input is a first-order autoregressive process (AR-1). However, the results are then generalized to arbitrary processes in a heuristic way by looking into a set of numerical examples. An interesting finding (that is consistent with earlier publications) is that the unconstrained PFBLMS algorithm suffers from slow modes of convergence, which the FBLMS algorithm does not. Fortunately, however, these modes are not present in the constrained PFBLMS algorithm. A simplified version of the constrained PFBLMS algorithm, which is known as the schedule-constrained PFBLMS algorithm, is also discussed, and the reason for its similar behavior to that of its fully constrained version is explained.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 10/07/20 alle ore 09:47:42