Reduced-complexity multiple parameters estimation via toeplitz matrix triple iteration reconstruction with bistatic MIMO radar

In this advanced exploration, we focus on multiple parameters estimation in bistatic Multiple-Input Multiple-Output(MIMO) radar systems, a crucial technique for target localization and imaging. Our research innovatively addresses the joint estimation of the Direction of Departure(DOD), Direction of Arrival(DOA), and Doppler frequency for incoherent targets. We propose a novel approach that significantly reduces computational complexity by utilizing the TemporalSpatial Nested Sampling Model(TSNSM). Our methodology begins with a multi-linear mapping mechanism to efficiently eliminate unnecessary virtual Degrees of Freedom(DOFs) and reorganize the remaining ones. We then employ the Toeplitz matrix triple iteration reconstruction method, surpassing the traditional Temporal-Spatial Smoothing Window(TSSW) approach, to mitigate the single snapshot effect and reduce computational demands. We further refine the highdimensional ESPRIT algorithm for joint estimation of DOD, DOA, and Doppler frequency, eliminating the need for additional parameter pairing. Moreover, we meticulously derive the Cramér-Rao Bound(CRB) for the TSNSM. This signal model allows for a second expansion of DOFs in time and space domains, achieving high precision in target angle and Doppler frequency estimation with low computational complexity. Our adaptable algorithm is validated through simulations and is suitable for sparse array MIMO radars with various structures, ensuring higher precision in parameter estimation with less complexity burden.

An iterative algorithm for solving ill-conditioned linear least squares problems

Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.

Efcient Iterative Solutions to General Coupled Matrix Equations

Linear matrix equations are encountered in many systems and control applications.In this paper,we consider the general coupled matrix equations（including the generalized coupled Sylvester matrix equations as a special case）l t=1EstYtFst = Gs,s = 1,2,···,l over the generalized reflexive matrix group（Y1,Y2,···,Yl）.We derive an efcient gradient-iterative（GI） algorithm for fnding the generalized reflexive solution group of the general coupled matrix equations.Convergence analysis indicates that the algorithm always converges to the generalized reflexive solution group for any initial generalized reflexive matrix group（Y1（1）,Y2（1）,···,Yl（1））.Finally,numerical results are presented to test and illustrate the performance of the algorithm in terms of convergence,accuracy as well as the efciency.

Stability analysis for discrete linear systems with state saturation by a saturation-dependent Lyapunov functional

This paper concerns the stability analysis problem of discrete linear systems with state saturation using a saturation-dependent Lyapunov functional. We introduce a free matrix characterized by the sum of the absolute value of each elements for each row less than 1, which makes the state with saturation constraint reside in a convex polyhedron. A saturation-dependent Lyapunov functional is then designed to obtain a sufficient condition for such systems to be globally asymptotically stable. Based on this stability criterion, the state feedback control law synthesis problem is also studied. The obtained results are formulated in terms of bilinear matrix inequalities that can be solved by the presented iterative linear matrix ineoualitv algorithm. Two numerical examoles are used to demonstrate the effectiveness of the nronosed method_

Accurate Reliability Analysis Methods for Approximate Computing Circuits

In recent years,Approximate Computing Circuits(ACCs)have been widely used in applications with intrinsic tolerance to errors.With the increased availability of approximate computing circuit approaches,reliability analysis methods for assessing their fault vulnerability have become highly necessary.In this study,two accurate reliability evaluation methods for approximate computing circuits are proposed.The reliability of approximate computing circuits is calculated on the basis of the iterative Probabilistic Transfer Matrix(PTM)model.During the calculation,the correlation coefficients are derived and combined to deal with the correlation problem caused by fanout reconvergence.The accuracy and scalability of the two methods are verified using three sets of approximate computing circuit instances and more circuits in Evo Approx8 b,which is an approximate computing circuit open source library.Experimental results show that relative to the Monte Carlo simulation,the two methods achieve average error rates of 0.46%and 1.29%and time overheads of 0.002%and 0.1%.Different from the existing approaches to reliability estimation for approximate computing circuits based on the original PTM model,the proposed methods reduce the space overheads by nearly 50%and achieve time overheads of 1.78%and 2.19%.

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication problems

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication （EHL） problems is presented. First, by introducing a special matrix splitting iteration method into the traditional compound direct iterative method, the full matrices for the linear systems of equations are transformed into sparse banded ones with any half-bandwidth; then, an extended Thomas method which can solve banded linear systems with any half-bandwidth is derived to accelerate the computing speed. Through the above two steps, the computational complexity of each iteration is reduced approximately from O（N^3/3） to O（β^2N）, where N is the total number of nodes, and β is the half-bandwidth. Two kinds of numerical results of transient EHL line contact problems under sinusoidal excitation or pure normal approach process are obtained. The results demonstrate that the new algorithm increases computing speed several times more than the traditional compound direct iterative method with the same numerical precision. Also the results show that the new algorithm can get the best computing speed and robustness when the ratio, half-bandwidth to total number of nodes, is about 7.5% 10.0% in moderate load cases.