Search

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. [ABSTRACT FROM AUTHOR]

The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t ≠ s. Two paths from s to t are said to be node-disjoint i ff they do not have any common vertices except for their endpoints. Distributed solutions to the node-disjoint paths problem have numerous applications such as secure message transmission, reliable routing, and network survivability. In this paper, we present a simple distributed algorithm that is both stabilizing and inherently stabilizing under a realistic model that describes system interfaces and implementation issues in detail to route messages over all shortest node-disjoint paths from one process to another in an n-dimensional hypercube network. [ABSTRACT FROM AUTHOR]