Performance and design of the dual sign algorithm with correlated input data

The number of iterations N_T required for the dual sign algorithm (DSA) to reach a prespecified residual error is derived without the assumption of white inputs. Transfer function and model reduction methods are applied to simplify the analysis. The result is a relationship between N_T and the design parameters with which optimisation can be achieved.