RLS-Laguerre lattice adaptive filtering: error-feedback, normalized, and array-based algorithms
نویسندگان
چکیده
This paper develops several lattice structures for RLS Laguerre adaptive filtering including a posteriori and a priori based lattice filters with error-feedback, array-based lattice filters, and normalized lattice filters. All structures are efficient in that their computational cost is proportional to the number of taps, albeit some structures require more multiplications or divisions than others. The performance of all filters, however, can differ under practical considerations, such as finite-precision effects and regularization. Simulations are included to illustrate these facts.
منابع مشابه
RLS-Laguerre lattice adaptive filtering: error feedback and array-based algorithms
This paper develops lattice structures for RLS Laguerre adaptive filtering including error-feedback and array-based lattice versions. All structures are efficient in that their computational cost is proportional to the number of taps. Although these structures are theoretically equivalent, their performance can differ under practical considerations, such as finite-precision effects and regulari...
متن کاملOrder-recursive RLS Laguerre adaptive filtering
This paper solves the problem of designing recursive-least-squares (RLS) lattice (or order-recursive) algorithms for adaptive filters that do not involve tapped-delay-line structures. In particular, an RLS–Laguerre lattice filter is obtained.
متن کاملOn Extended RLS Lattice Adaptive Variants: Error-Feedback, Normalized, and Array-Based Recursions
Error-feedback, normalized, and array-based recursions represent equivalent RLS lattice adaptive filters which are known to offer better numerical properties under finite-precision implementations. This is the case when the underlying data structure arises from a tapped-delay-line model for the input signal. On the other hand, in the context of a more general orthonormality-based input model, t...
متن کاملQRD - RLS Adaptive Filtering
The main limitation of FQRD-RLS algorithms is that they lack an explicit weight vector term. Furthermore, they do not directly provide the variables allowing for a straightforward computation of the weight vector as is the case with the conventional QRD-RLS algorithm, where a back-substitution procedure can be used to compute the coefficients. Therefore, the applications of the FQRD-RLS algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 49 شماره
صفحات -
تاریخ انتشار 2001