An improved subspace approach for high resolution array processing

An improved subspace approach for high-resolution array processing is presented. The approach is formulated as a constrained least squares minimization problem. The relationship that the proposed approach has to other subspace techniques is explored. Numerical results to illustrate the performance achievable are presented.<
>