Space-time signal processing algorithms for moving antennas

Abstract

A review of work in the field of space-time signal processing (STSP), which takes into consideration complicated antenna motion, noises, and medium all together, is presented. The works led in three directions. The first one is the development of the theory of STSP for moving antennas, the second one is the development of fast STSP algorithms realized complicated multichannel processing with a few calculating efforts, and the third one is the implementation of the results in sonar. A new approach for optimizing STSP in complicated dynamic conditions is proposed. By using it new STSP algorithms for coherent and stochastic signals are developed. Research of these algorithms shows that in some cases complicated antenna motion plays a great positive role. STSP systems with mobile antennas may have essentially higher space-time selectivity and noise immunity than systems with static antennas. These effects may be used for system improvement. In systems with line arrays they can be used, in particular, for alienating ambiguity in the estimation of signal direction. A series of fast STSP algorithms for different types of moving antennas are developed. The results are obtained both for coherent and for stochastic signals. It is found that in the case of parallel processing in millions of space-time channels the new fast algorithms decrease calculating efforts by a factor of ten times and more. The main positions of the theory are confirmed by experimental research.