Sparse Identification of Volterra Models for Power Amplifiers Without Pseudoinverse Computation
Juan A. Becerra, María J. Madero‐Ayora, Javier Reina‐Tosina, Carlos Crespo‐Cadenas
Abstract
We present a new formulation of the doubly orthogonal matching pursuit (DOMP) algorithm for the sparse recovery of Volterra series models. The proposal works over the covariance matrices by taking advantage of the orthogonal properties of the solution at each iteration and avoids the calculation of the pseudoinverse matrix to obtain the model coefficients. A detailed formulation of the algorithm is provided along with a computational complexity assessment, showing a fixed complexity per iteration compared with its previous versions in which it depends on the iteration number. Moreover, we empirically demonstrate the reduction in computational complexity in terms of runtime and highlight the pruning capabilities through its application to the digital predistortion of a class J power amplifier operating under 5G-NR signals with the bandwidth of 20 and 30 MHz, concluding that this proposal significantly outperforms existing techniques in terms of computational complexity.