Selection of a Closed-Form Expression Polynomial Orthogonal Basis for Robust Nonlinear System Identification
Polynomial nonlinear system identification suffers from numerical instability related to the ill-conditioning of the involved matrices. Orthogonal methods consist in conditioning the input signal in order to reduce the eigenvalues spread of the correlation matrix. The selection of an appropriate orthogonalization procedure, for robustness improvement, resort to signal statistics. Consequently, several orthogonal polynomial bases are proposed in the literature. Most of them use iterative processes and imply a considerable computational cost. Actually, with the growth of real-time applications, it is important to generate non-iterative orthogonal procedures, allowing optimization of algorithm-architecture adequacy. Our papers motivation is based on the complexity reduction aspect related to the orthogonalization process. Therefore we propose to focus on closed-form expressions of commonly used orthogonal polynomials bases namely the Shifted-Legendre orthogonal polynomials and the Hermite polynomials. A robustness study in terms of numerical stability enhancement of the two bases is carried on. Through comparative simulations results, the basis allowing the best matrix conditioning and an ease generalization for real-time applications with less restrictive hypothesis is selected in order to study the robustness of a polynomial nonlinear system identification scheme. Computer simulations are carried out to emphasize the advantages of the proposed scheme using different performance criteria for both the optimal case and the adaptive case, in terms of numerical stability and convergence rate. We propose to experiment the identification of the power amplifiers, for radio mobile applications and the loudspeakers for audio applications.
robustness nonlinear system orthogonalization procedures complexity reduction numerical stability polynomial identification