DOI:https://doi.org/10.15407/kvt213.03.036
Cybernetics and Computer Engineering, 2023, 3(213)
Revunova E.G., DSc (Engineering),
Leading Researcher of Neural Information Processing Technologies Department
https://orcid.org/0000-0002-3053-7090,
e-mail: egrevunova@gmail.com
International Research and Training Center for Information Technologies
and Systems of the National Academy of Sciences of Ukraine
and the Ministry of Education and Science of Ukraine,
40, Acad. Glushkova av., Kyiv, 03187, Ukraine
RANDOMIZED MATRIX CALCULATIONS AND SINGULAR VALUE DECOMPOSITION FOR THE EFFECTIVE JAMMING CANCELLATION IN RADIOLOCATION SYSTEMS
Introduction. Impact of the jamming leads to the high losses since it decreases effectiveness of radiolocation systems, anti-aircraft missile systems and communication systems. Strategies of forming and setting of the jamming are improving and the power of the jamming increases. In this regard, it is important to improve jamming cancellation systems.
The task of the improvement for based on matrix calculations methods of the jamming cancellation is actual considering the breakthrough development of the computational methods which allows realization by digital circuit engineering. These include the most modern machine learning algorithms aimed at solving signal processing tasks.
The requirement of the stable operation is important for the jamming cancellation systems under conditions of uncertainty. Other demand is an operation in the real time and a simple hardware implementation.
The purpose of the paper is to increase the efficiency of the jamming cancellation in the antenna system (under conditions of uncertainty) based on the new randomized computation methods and their realization by the matrix-processor architecture.
Results. The approach based on singular value decomposition and random projection is proposed. It provides effective jamming cancellation in the antenna systems under conditions of uncertainty that is, the sample has small length, there is an own noise of the measuring system, the input-output transformation matrix have undefined numerical rank and there is no prior information about useful signal.
Conclusions. The increase of the efficiency of the jamming cancellation includes the increase of the stability and jamming cancellation coefficient, and the reduction of the computational complexity.
The increase of the jamming cancellation coefficient is provided by use of stable discrete ill-posed inverse problems solution methods of the signal recovery based on random projection and singular value decomposition. The decrease of the computational complexity is achieved by the realization of random projection and singular value decomposition as the processor array which make parallel computations.
Keywords: jamming, discrete ill-posed problem, antenna system singular value decomposition, random projection.
Download full text!
REFERENCES
1 Monzingo R.A., Miller T.W. Introduction to Adaptive Arrays. John Wiley. Chichester, 1980, 541 p.
2 Schmidt R.O. Multiple Emitter Location and Signal Parameter Estimation. IEEE Trans. Antennas Propagation. 1986, Vol. 34, pp. 276-280.
https://doi.org/10.1109/TAP.1986.1143830
3 Schmidt R.O. A signal subspace approach to multiple emitter location spectral estimation. PhD thesis. Stanford University. 1981, 201 p.
4 Krim H., Viberg M. Two decades of array signal processing research: The parametric approach. IEEE Signal Processing Magazine. 1996, Vol. 13, N 4, pp. 67-94.
https://doi.org/10.1109/79.526899
5 Bartlett M.S. Smoothing periodograms from time series with continuous spectra. Nature. 1948, Vol. 161, pp. 686-687.
https://doi.org/10.1038/161686a0
6 Panahi A., Viberg M. Fast lasso based DOA tracking. Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). 4th IEEE International Workshop. 2011, pp. 397-400.
https://doi.org/10.1109/CAMSAP.2011.6136036
7 Panahi A. Viberg M. A novel method of DOA tracking by penalized least squares. Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). 5th IEEE International Workshop, 2013, pp. 61-64.
https://doi.org/10.1109/CAMSAP.2013.6714007
8 Zheng J.M., Kaveh M. Sparse Spatial Spectral Estimation: A Covariance Fitting Algorithm, Performance and Regularization. IEEE Trans. Signal Processing. 2013, Vol. 61, N. 11, pp. 2767-2777.
https://doi.org/10.1109/TSP.2013.2256903
9 Hu N., Ye Z.F., Xu X., Bao M. DOA estimation for sparse array via sparse signal reconstruction. IEEE Transactions on Aerospace and Electronic Systems. 2013, Vol. 49, N. 2, pp. 760-772.
https://doi.org/10.1109/TAES.2013.6494379
10 Hansen, P. Rank-deficient and discrete ill-posed problems. Numerical aspects of linear inversion. Philadelphia: SIAM. 1998, 247 p.
https://doi.org/10.1137/1.9780898719697
11 Sarlos T. Improved Approximation Algorithms for Large Matrices via Random Projections. Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science. 2006, pp. 143-152.
https://doi.org/10.1109/FOCS.2006.37
12 Woolfe F., Liberty E., Rokhlin V., Tygert M. A fast randomized algorithm for the approximation of matrices. Applied and Computational. Harmon. Anal. 2008, Vol. 25, pp. 335-366.
https://doi.org/10.1016/j.acha.2007.12.002
13 Rokhlin V., Szlam A., Tygert M. A randomized algorithm for principal component analysis. SIAM Journal Matrix Anal. Application. 2009, Vol. 31, pp. 1100-1124.
https://doi.org/10.1137/080736417
14 Martinsson P.G. A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix. SIAM Journal on Matrix Analysis and Applications. 2011, Vol. 32, N 4, pp. 1251-1274.
https://doi.org/10.1137/100786617
15 Woodruff D.P. Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science. 2014, Vol. 10, pp. 1-157.
https://doi.org/10.1561/0400000060
16 Revunova E. G., Tyshchuk A.V. A Model Selection Criterion for Solution of Discrete Ill-Posed Problems Based on the Singular Value Decomposition. The 7th International Workshop on Inductive Modelling (IWIM 2015). Kyiv-Zhukyn. July 20-24, 2015, pp. 43-47.
17 Revunova E.G. Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection. Cybernetics and Systems Analysis. 2016, Vol. 52, N.4, pp.647-664.
https://doi.org/10.1007/s10559-016-9868-4
18 Revunova E.G. Analytical study of the error components for the solution of discreteill-posed problems using random projections. Cybernetics and Systems Analysis. 2015, Vol. 51, N. 6, pp. 978-991.
https://doi.org/10.1007/s10559-015-9791-0
19 Revunova E.G. Averaging over matrices in solving discrete ill-posed problems on the basis of random projection. Proc. CSIT 17. 2017, Vol. 1, pp. 473-478.
https://doi.org/10.1109/STC-CSIT.2017.8098831
20 Revunova E.G. Solution of the Discrete ill-posed problem on the basis of singular value decomposition and random projection. Advances in Intelligent Systems and Computing II. Cham: Springer. 2017, pp. 434-449.
https://doi.org/10.1007/978-3-319-70581-1_31
21 Revunova E.G. Increasing the accuracy of solving discrete ill-posed problems by the random projection method. Cybernetics and Systems Analysis. 2018, Vol. 54, N 5, pp. 842-852.
https://doi.org/10.1007/s10559-018-0086-0
22 Forsythe G.E., Henrici P. The cyclic Jacobi method for computing the principal values of a complex matrix. Trans. Amer. Math. Soc. 1960, Vol. 94, pp. 1-23.
https://doi.org/10.1090/S0002-9947-1960-0109825-2
23 Brent R.P., Luk F.T. The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays. SIAM J. Sci. and Stat. Comput. 1985, Vol. 6, pp. 69-84.
https://doi.org/10.1137/0906007
24 Brent R.P. Parallel algorithms for digital signal processing. Proceedings of the NATO Advanced Study Institute on Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms. Leuven, Belgium. 1988, pp. 93-110.
https://doi.org/10.1007/978-3-642-75536-1_5
25 Schreiber R. Solving eigenvalue and singular value problems on an undersized systolic array. SIAM Journal Sci. Stat. Comput. 1986, Vol. 7, N. 2, pp. 441-451.
https://doi.org/10.1137/0907029
Received 28.04.2023