A Superfast Super-Resolution Method for Radar Forward-Looking Imaging

The super-resolution method has been widely used for improving azimuth resolution for radar forward-looking imaging. Typically, it can be achieved by solving an undifferentiable [Formula: see text] regularization problem. The split Bregman algorithm (SBA) is a great tool for solving this undifferentiable problem. However, its real-time imaging ability is limited to matrix inversion and iterations. Although previous studies have used the special structure of the coefficient matrix to reduce the computational complexity of each iteration, the real-time performance is still limited due to the need for hundreds of iterations. In this paper, a superfast SBA (SFSBA) is proposed to overcome this shortcoming. Firstly, the super-resolution problem is transmitted into an [Formula: see text] regularization problem in the framework of regularization. Then, the proposed SFSBA is used to solve the nondifferentiable [Formula: see text] regularization problem. Different from the traditional SBA, the proposed SFSBA utilizes the low displacement rank features of Toplitz matrix, along with the Gohberg-Semencul (GS) representation to realize fast inversion of the coefficient matrix, reducing the computational complexity of each iteration from [Formula: see text] to [Formula: see text]. It uses a two-order vector extrapolation strategy to reduce the number of iterations. The convergence speed is increased by about 8 times. Finally, the simulation and real data processing results demonstrate that the proposed SFSBA can effectively improve the azimuth resolution of radar forward-looking imaging, and its performance is only slightly lower compared to traditional SBA. The hardware test shows that the computational efficiency of the proposed SFSBA is much higher than that of other traditional super-resolution methods, which would meet the real-time requirements in practice.