A Fast Convergence Algorithm for Adaptive FIR Filters with Sparse Taps

Akihiko SUGIYAMA  Shigeji IKEDA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E77-A   No.4   pp.681-687
Publication Date: 1994/04/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Adaptive Signal Processing
adaptive filter,  fast convergence,  flat delay,  echo cancellation,  

Full Text: PDF>>
Buy this Article

This paper proposes a fast convergence algorithm for adaptive FIR filters with sparse taps. Coefficient values and positions are simultaneously controlled. The proposed algorithm consists of two stages: flat-delay estimation and tapposition control with a constraint. The flat-delay estimation is carried out by estimating the significant dispersive region of the impulse response. The constrained tap-position control is achieved by imposing a limit on the new-tap-position search. Simulation results show that the proposed algorithm reduces the convergence speed by up to 85% over the conventional algorithms for a white signal input. For a colored signal, it also converges in 40% of the convergence time by the conventional algorithms. The proposed algorithm is applicable to adaptive FIR filters which are to model a path with long flat delay, such as echo cancelers for satellite-link communications.