Jamming Cancellation Approximation Least Squares Problem Stable Solution Recurrent Solution Neural Networks Incremental Training Filtered SVD Greville Formula
Institute of Information Theories and Applications FOI ITHEA
Two jamming cancellation algorithms are developed based on a stable solution of least squares
problem (LSP) provided by regularization. They are based on filtered singular value decomposition (SVD) and
modifications of the Greville formula. Both algorithms allow an efficient hardware implementation. Testing results
on artificial data modeling difficult real-world situations are also provided.