Sub-array RLS adaptive algorithm

A new sub-array asynchronous recursive least square algorithm (SARLS) is proposed. The number of elements of the smallest sub-array can be less than the number of interferers. The computational load of SARLS can be reduced to o(N) while similar array performance to that of RLS is obtained. When the sub-array size is small, SARLS will converge faster than the conventional RLS.