Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Foundations of Computing and Decision Sciences

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Pipelined architectures for the LMS adaptive Volterra filter

Glentis G.-O., Georgoulakis K.

Foundations of Computing and Decision Sciences

2006

Vol. 31, No. 2

135-155

In this paper, efficient pipelined architectures for Least Mean Square (LMS) adaptive filtering and system identification of discrete-time Volterra models is presented. First, the multichannel embedding is adopted for the transformation of the discrete-time Volterra model to an equivalent multi-input single output format. Then, the LMS algorithm with delayed coefficients adaptation is applied, for the identification of the model parameters. The adaptation delay introduced in the computational flow of the adaptive scheme, allows for a pipelined implementation, however, the convergence and tracking properties of the algorithm are affected. Proper correction terms are subsequently introduced that compensate the adaptation delay and give results identical to the original LMS algorithm, subject to a latency delay.

Adaptive least squares algorithms for two dimensional system identification and filtering: a unified approach

Glentis G.-O., Georgoulakis K.

Foundations of Computing and Decision Sciences

2003

Vol. 28, No. 2

95-112

In this paper, a unified approach is presented for adaptive Least Squares Two-Dimensional system identification and linear filtering. First, a unified deterministic Least Squares criterion is introduced, and subsequently utilized for the derivation of a general algorithmic framework for the adaptive Two-Dimensional system identification and filtering. Overdetermined, as well as underdetermined Least Squares Two-Dimensional adaptive algorithms are derived, from the proposed general adaptive scheme. In this way, known Two-Dimensional adaptive algorithms are interpreted as special cases of a general algorithmic form. Moreover, new adaptive algorithms are derived, following the proposed methodology.

Performance analysis of the frequency domain LMS adaptive filter using the sliding DFT

Glentis G.-O., Georgoulakis K.

Foundations of Computing and Decision Sciences

2002

Vol. 27, No. 1

27-41

In this paper the performance of the Frequency Domain LMS adaptive filter is investigated, for the case when the Sliding Discrete Fourier Transform is utilized for the frequency domain data transformation. A statistical performance analysis in terms of the mean, and the mean squared error of the filter parameters is presented. The convergence speed of the algorithm is analyzed in terms of the eigenvalue spread of the input signal autocorrelation matrix. The theoretical analysis results are verified by computer simulations.