Adaptive filter theory (3rd ed.)
Adaptive filter theory (3rd ed.)
Analysis of initialization and numerical instability of fast RLS algorithms
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Adaptive Filtering: Algorithms and Practical Implementation
Adaptive Filtering: Algorithms and Practical Implementation
A Generalized Memory Polynomial Model for Digital Predistortion of RF Power Amplifiers
IEEE Transactions on Signal Processing
A new Volterra predistorter based on the indirect learningarchitecture
IEEE Transactions on Signal Processing
Multichannel fast QRD-LS adaptive filtering: new technique andalgorithms
IEEE Transactions on Signal Processing
| Hi-index | 35.68 |
Multichannel fast QR decomposition RLS (MC-FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is that they lack an explicit weight vector term, limiting themselves to problems seeking an estimate of the output error signal. This paper presents techniques which allow us to use MC-FQRD-RLS algorithms with applications that previously have required explicit knowledge of the adaptive filter weights.We first consider a multichannel system identification setup and present how to obtain, at any time, the filter weights associated with the MC-FQRD-RLS algorithm. Thereafter, we turn to problems where the filter weights are periodically updated using training data, and then used for fixed filtering of a useful data sequence, e.g., burst-trained equalizers. Finally, we consider a particular control structure, indirect learning, where a copy of the coefficient vector is filtering a different input sequence than that of the adaptive filter. Simulations are carried out for Volterra system identification, decision feedback equalization, and adaptive predistortion of high-power amplifiers. The results verify our claims that the proposed techniques achieve the same performance as the inverse QRD-RLS algorithm at a much lower computational cost.