Relation of CLSS algorithm to KT and music methods

The relation of the constrained least square subspace (CLSS) algorithm, which was proposed for high resolution array processing previously, to the more classic subspace approaches of MUSIC and KT is shown. The MUSIC and KT algorithms are shown to be special cases of the proposed constrained least square subspace approach. This provides further insight into the new algorithm. Additional simulation results are also included to illustrate the performance of the various algorithms.