Article

Optimum block adaptive filtering algorithms using the preconditioning technique

Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul
IEEE Transactions on Signal Processing (Impact Factor: 2.79). 04/1997; 45(3):773 - 778. DOI: 10.1109/78.558502
Source: IEEE Xplore

ABSTRACT

We propose three block adaptive algorithms using the
preconditioning technique. The Toeplitz-preconditioned optimum block
adaptive (TOBA) algorithm employs a preconditioner assumed to be
Toeplitz, the symmetric successive overrelaxation (SSOR)-preconditioned
optimum block adaptive (SOBA) algorithm uses a product of triangular
matrices as a preconditioner, and the circulant-preconditioned OBA
(COBA) algorithm is based on a circulant preconditioner. It is also
shown that their tracking properties and convergence rates are superior
to those of the OBA algorithm, the self-orthogonizing block adaptive
filter (SOBAF), and the normalized frequency-domain OBA (NFOBA)
algorithm

0 Followers
 · 
3 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: As a version of the optimum block adaptive (OBA) algorithm, a nested optimum block adaptive (NOBA) algorithm is proposed for finite impulse response (FIR) block adaptive filters. In this paper, we introduce a new updating procedure called the nested iteration technique that updates the filter tap weights several times rather than only once for each data block, as in the OBA algorithm. Thus; the proposed algorithm achieves faster convergence speed although its computational load is higher than the OBA algorithm. The NOBA algorithm is formulated by minimizing an estimate of the block mean-square error (BMSE) as an objective function. Through computer simulations, it is shown that the proposed algorithm is superior to the normalized least mean-square (NLMS) algorithm in convergence rate regardless of stationarity, whereas the OBA algorithm is inferior to the NLMS algorithm. It is also shown that the tracking property of the NOBA algorithm is better than that of the OBA algorithm, and it is almost comparable to that of the NLMS algorithm.
    No preview · Article · Aug 1995 · Signal Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a new block adaptive algorithm as a variant of the Toeplitz-preconditioned optimum block adaptive (TOBA) algorithm. The proposed algorithm is formulated by combining the TOBA algorithm with a data-reusing scheme that is realized by processing blocks of data in an overlapping manner, as in the optimum block adaptive shifting (OBAS) algorithm. Simulation results show that the proposed algorithm is superior to the OBAS and TOBA algorithms in both convergence rate and tracking property of input signal conditioning.
    No preview · Article · Mar 1996 · Signal Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: As a new block adaptive algorithm based on the preconditioned conjugate gradient method, the TBCG is formulated by employing a Toeplitz preconditioner assumed to be symmetric Toeplitz. By computer simulations, it is shown that the convergence rate of the proposed algorithm is superior to those of the BCG and NLMS, and comparable to the RLS. Moreover, like the RLS, the convergence property of the proposed algorithm is insensitive to the eigenvalue spread of input signals.
    No preview · Article · Nov 1998 · Signal Processing
Show more