Tao Haihong

Method of resolving ambiguity for sparse array via modified sparse even array based on MUSIC algorithm

A novel method of resolving ambiguity via modified sparse even array based on MUSIC algorithm is proposed in this paper. Firstly, uses the data from original array to do DOA;Then, modified the array slightly. Finally, uses the two received data to do DOA in the same reference frame, which can separate the ambiguity angle from the two spectrum functions to get the real DOA. At the same time, the least adjust value of resolving ambiguity is given. In additional, both the measure function of resolving ambiguity and the relationship between resolving ambiguity ability and glip space are given. Simulation results and performance analysis verify that the algorithm is effective and feasible.

A novel space-borne antenna anti-jamming technique based on immunity genetic algorithm-maximum likelihood

A novel space-borne antenna nulling method is presented on rejecting strong multi-interference from the ground and air. Immune Genetic Algorithm for searching for the multi-extremum of maximum likelihood function has been developed, which is based on injecting vaccine pick-up adaptively. GA has the capability of the whole searching and is not limited by the selection of initial parameter. And the Immune algorithm possesses the advantage of availing oneself of characteristic information. The proposed method, combining GA with the Immune algorithm, can converge at the global optimum quickly and offer high resolution null point. Simulation examples, based on the spot survey data, are shown to illustrate the effectiveness and robustness of the proposed algorithm.

Robust Constrained LMS Adaptive Beamformer

In the paper, an approach is proposed for robust constrained LMS beamforming in the presence of pointing error, array geometry error and sensor phase error (generalized as array phase errors). The basic idea is to search the optimal weight vector with constrained LMS update, and jointly search the actual array steering vector of the desired signal based on steering vector-expanded algorithm. Despite its lower computational complexity however, it turns out that the proposed algorithm has improved performance. Compared with other recursive beamformers, simulations in the presence of given errors demonstrate that the presented algorithm has more effective and robust performance

Space-borne antenna adaptive anti-jamming method based on gradient-genetic algorithm

Abstract A novel space-borne antenna adaptive anti-jamming method based on the genetic algorithm (GA), which is combined with gradient-like reproduction operators is presented, to search for the best weight for pattern synthesis in radio frequency (RF). Combined, the GAs the capability of the whole searching is, but not limited by selection of the initial parameter, with the gradient algorithms advantage of fast searching. The proposed method requires a smaller sized initial population and lower computational complexity. Therefore, it is flexible to implement this method in the real-time systems. By using the proposed algorithm, the designer can efficiently control both main-lobe shaping and side-lobe level. Simulation results based on the spot survey data show that the algorithm proposed is efficient and feasible.

Novel Filter Design for detecting weak targets of slow speed out of multi-mode clutters

The paper presents a novel stagger MTI filter design algorithm, which can detect weak targets of slow speed out of multi-mode clutters. The method is carried out by slipping pulses, and the best pulse repetitive frequencies selected by gradient-GA make the first notches of the filter banks as shallow as possible, so the weak targets in the first notch can be detected. Multi-model clutters can be suppressed by MTI filter, and blind-velocity can be appeared out of three times velocity of sound. Combined GAs the capability of the whole searching and not limited by selection of initial parameter with the gradient algorithms advantage of fast searching, it can offer fewer initial population and low computation complexity. The simulation and performance analysis demonstrate the feasibility and validity of the algorithm