Block conjugate gradient algorithms for adaptive filtering

Cited 9 time in webofscience Cited 11 time in scopus
  • Hit : 460
  • Download : 0
Two adaptive algorithms based on the conjugate gradient method are presented for finite impulse response (FIR) block adaptive filters. First, the block conjugate gradient (BCG) algorithm is derived from minimization of an estimate of the block mean-square error (BMSE). Using the fast convolution technique, the BCG algorithm is then extended to the frequency domain BCG (FBCG) algorithm that yields significant computational savings over the BCG algorithm, especially for a large filter-tap order. Through computer simulations, it is shown that although the adaptation accuracy of the BCG or the FBCG is nearly equal to that of the optimum block adaptive (OBA) algorithm, its convergence property is superior to that of the OBA algorithm under any input conditions. Moreover, it is also shown that their convergence rate is as fast as the recursive least-squares (RLS) algorithms for a relatively small eigenvalue spread.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1996-11
Language
English
Article Type
Article
Keywords

FREQUENCY-DOMAIN; DIGITAL-FILTERS; TRANSVERSAL FILTERS; IMPLEMENTATION

Citation

SIGNAL PROCESSING, v.55, no.1, pp.65 - 77

ISSN
0165-1684
DOI
10.1016/S0165-1684(96)00120-X
URI
http://hdl.handle.net/10203/72849
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0