Xue Jin

A large number of transducers employed in the multibeam imaging sonar array significantly increases the hardware complexity, costs, and computational load. Although a great amount of work has been done to minimize the number of transducers in the array, one can verify that these methods do not provide optimal results when applied to the case of multiple beams. In this paper, a novel thinning method is proposed for multiple-beam conditions where the number of transducers is minimized by an iterative process. Optimal common transducers’ positions are selected by a wind-driven optimization (WDO) algorithm, and transducers’ weights are optimized by convex optimization in order to suppress the peak sidelobe level (PSLL). The performance of the proposed method is evaluated via simulations and experiments. Results show that the method is applicable to the minimization of the number of transducers under hundreds of beam conditions, and consequently reduces the complexity of the imaging sonar system with imaging performance still acceptable.

SAR raw signal simulation under the case of maneuver and high-speed has been a challenging and urgent work recently. In this paper, a new method based on one-dimensional fast Fourier transform (1DFFT) algorithm is presented for raw signal simulation of maneuvering target for missile-borne SAR. Firstly, SAR time-domain raw signal model is given and an effective Range Frequency Azimuth Time (RFAT) algorithm based on 1DFFT is derived. In this algorithm, the “Stop and Go” (SaG) model is adopted and the wide radar scattering characteristic of target is taken into account. Furthermore, the “Inner Pulse Motion” (IPM) model is employed to deal with high-speed case. This new RFAT method can handle the maneuvering cases, high-speed cases, and bistatic radar cases, which are all possible in the missile-borne SAR. Besides, this raw signal simulation adopts the electromagnetic scattering calculation so that we do not need a scattering rate distribution map as the simulation input. Thus, the multiple electromagnetic reflections can be considered. Simulation examples prove the effectiveness of our method.

The generalized Radon-Fourier transform (GRFT) has been proposed to detect radar weak maneuvering targets by realizing coherent integration via jointly searching in motion parameter space. Two main drawbacks of GRFT are the heavy computational burden and the blind speed side lobes (BSSL) which will cause serious false alarms. The BSSL learning-based particle swarm optimization (BPSO) has been proposed before to reduce the computational burden of GRFT and solve the BSSL problem simultaneously. However, the BPSO suffers from an apparent loss in detection performance compared with GRFT. In this paper, a fast implementation algorithm of GRFT using the BSSL learning-based modified wind-driven optimization (BMWDO) is proposed. In the BMWDO, the BSSL learning procedure is also used to deal with the BSSL phenomenon. Besides, the MWDO adjusts the coefficients in WDO with Levy distribution and uniform distribution, and it outperforms PSO in a noisy environment. Compared with BPSO, the proposed method can achieve better detection performance with a similar computational cost. Several numerical experiments are also provided to demonstrate the effectiveness of the proposed method.

It should be noted that the peak sidelobe level (PSLL) significantly influences the performance of the multibeam imaging sonar. Although a great amount of work has been done to suppress the PSLL of the array, one can verify that these methods do not provide optimal results when applied to the case of multiple patterns. In order to suppress the PSLL for multibeam imaging sonar array, a hybrid algorithm of binary particle swarm optimization (BPSO) and convex optimization is proposed in this paper. In this algorithm, the PSLL of multiple patterns is taken as the optimization objective. BPSO is considered as a global optimization algorithm to determine best common elements’ positions and convex optimization is considered as a local optimization algorithm to optimize elements’ weights, which guarantees the complete match of the two factors. At last, simulations are carried out to illustrate the effectiveness of the proposed algorithm in this paper. Results show that, for a sparse semicircular array with multiple patterns, the hybrid algorithm can obtain a lower PSLL compared with existing methods and it consumes less calculation time in comparison with other hybrid algorithms.