Matched symmetrical subspace detector

The optimal detection/estimation algorithms require large computing expenditures in the radar, sonar and etc. The paper presents the new Uniformly Most Powerful Test for matched detecting of the symmetrical signal subspace. The general (logical) shift operators group is used for describing of the symmetry. This algorithm may be used to reduce the complexity of matched detector for unknown signal subspace and for a signal processing in real time. The reduction brings appreciable hardware gains and a small performance penalties in some radar systems. The signal subspace model for moving-target indication in radar is considered. We used the new approach for creation of the sub-optimal detector with minimal computing expenditures.