REVUNOVA E.G.1, DSc (Engineering),
Leading Researcher of the Department of Neural Information Processing Technologies
https://orcid.org/0000-0002-3053-7090, e-mail: egrevunova@gmail.com
DESIATERYK O.O.1,2, PhD,
Assistant1, Chair of Algebra and Computer Mathematics; Senior Researcherof the Department of Digital Systems for Ecological Monitoring
https://orcid.org/0000-0002-7591-3846, e-mail: sasha.desyaterik@gmail.com
1International 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. Glushkov av., Kyiv, 03187, Ukraine
2Taras Shevchenko University of Kyiv, Faculty of Mechanics and Mathematics
4 e, Acad. Glushkov av., Kyiv, 03127, Ukraine
INFORMATION TECHNOLOGY OF JAMMING CANCELLATION
Introduction. Impact of the jamming leads to the high losses since it decreases effectiveness of radiolocation 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.
Communication. 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 makes parallel computations.
Keywords: information technology, jamming, machine learning, algorithms, singular value decomposition, random projection, conditions of uncertainty, signal recovery.
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, p. 276-280.
https://doi.org/10.1109/TAP.1986.1143830
3. 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, p. 61-64.
https://doi.org/10.1109/CAMSAP.2013.6714007
4. 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, p. 2767-2777.
https://doi.org/10.1109/TSP.2013.2256903
5. 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
6. 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, p. 647-664.
https://doi.org/10.1007/s10559-016-9868-4
7. Revunova E.G. Analytical study of the error components for the solution of discrete ill-posed problems using random projections. Cybernetics and Systems Analysis. 2015, Vol. 51, N. 6, p. 978-991.
https://doi.org/10.1007/s10559-015-9791-0
8. 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, p. 434-449.
https://doi.org/10.1007/978-3-319-70581-1_31
9. 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, p. 842-852.
https://doi.org/10.1007/s10559-018-0086-0
10. 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, p. 69-84.
https://doi.org/10.1137/0906007
11. 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, p. 93-110.
https://doi.org/10.1007/978-3-642-75536-1_5
12. Schreiber R. Solving eigenvalue and singular value problems on an undersized systolic array. SIAM Journal Sci. Stat. Comput. 1986, Vol. 7, N. 2, p. 441-451.
https://doi.org/10.1137/0907029
Received 18.09.2024