Matched symmetrical subspace detector

Optimal detection/estimation algorithms require large computing expenditures when applied to radar, sonar etc. The paper presents a new uniformly most powerful test for matched detection of the symmetrical signal subspace. The general (logical) shift operators group is used to describe the symmetry. This algorithm may be used to reduce the complexity of a matched detector for unknown signal subspace and for signal processing in real time. The reduction brings appreciable hardware gains and 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 the creation of a sub-optimal detector with minimal computing expenditure