A common measure of conformational similarity in structural bioinformatics is the minimum root mean square deviation (RMSD) between the coordinates of two macromolecules. In many applications, the rotations relating the structures are not needed. Several common algorithms for calculating RMSDs require the computationally costly procedures of determining either the eigen decomposition or matrix ...

UMTS systems will employ long-code wideband CDMA modulation schemes. Receivers for this system are for computational reasons usually based on simple matched-filter techniques, and hence suffer from multiaccess interference. Decorrelating RAKE and MMSE receivers do not have this problem but, until now, were considered as too complex, due to the inversion of a large code matrix. As is shown in th...

An algorithm for inversion in GF(2) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid’s algorithm. In the algorithm, operations corresponding to several contiguous iterations of the VLSI algorithm proposed by Brunner et al. is represented as a matrix. They are calculated at once through the matrix efficiently by means of...

We address the problem of detecting slow moving targets from a moving radar system using spacetime adaptive processing (STAP) techniques. Optimum interference rejection requires the estimation and the inversion of an interference-plus-noise covariance matrix. To reduce the number of samples involved in the estimation and the computational cost inherent to the inversion, many suboptimum STAP tec...

We present an overview of recent results related to the single server queue with general independent and identically distributed service times and a batch Markovian arrival process (BMAP). The BMAP encompasses a wide range of arrival processes and yet, mathematically, the BMAP/G/I model is a relatively simple matrix generalization of the M/G/l queue. Stationary and transient distributions for t...

We investigate the properties of block matrices with block banded inverses to derive efficient matrix inversion algorithms for such matrices. In particular, we derive the following: (1) a recursive algorithm to invert a full matrix whose inverse is structured as a block tridiagonal matrix; (2) a recursive algorithm to compute the inverse of a structured block tridiagonal matrix. These algorithm...

In this paper the standard variational analysis scheme is modified, through a simple transform, to avoid the inversion of the background error covariance matrix. A close inspection of the modified scheme reveals that it is possible to use a filter to replace the multiplication of the covariance matrix. A variational analysis scheme using a filter is then formulated, which does not explicitly in...

Hard Raptor Codes (designed for erasure channels) are widely used for mobile multimedia content delivery, and yet they have not been investigated in the context of embedded systems where the energy dissipation is as important as the timing performance. The most time consuming part of Raptor decoder is the matrix inversion operation. This paper proposes a hardware accelerator, for two matrix inv...

The main cost of Gauss-Newton (GN) inversion of timedomain controlled-source electromagnetic (tCSEM) data is comprised of the multiple solutions of the forward problem and linear-algebraic operations using the Jacobian matrix. For large-scale 2.5D and 3D problems with multiple sources and receivers, this cost grows enormously for inversion algorithms using conventional finite-difference time-do...