A new recursive algorithm to blindly recover input sequences

This paper presents a recursive algorithm of combinational optimization to blindly recover transmitted sequences of any length. The recursive algorithm is obtained by using a moving window with a forgetting factor. The exact initial sequence of the recursive algorithm is provided by quadratic programming, whose cost function is formed by using the residual in the left complement subspace of a received data matrix. Simulation results show that the algorithm converges quickly and has small bit error rate in blind recovery of input sequences.