Fast Blind Adaptive Channel Shortening Using Signal Subspace

In cyclic-prefixed communication systems, if the delay spread of the channel is longer than the cyclic prefix (CP) a channel-shortening equalizer (CSE) can be used to restore the desired operation of such systems. Since in time-varying environment we are interested in fast adaptive equalizer with tracking capability, the aim of this paper is to propose RLS-type algorithm for channel shortening. In this paper, we first propose an RLS-type algorithm to estimate the eigenvector corresponding to the smallest eigenvalue of a matrix and based on this algorithm we develop an RLS-type blind channel shortener. We also, based on PAST algorithm, propose an RLS-type update rule to shorten the channel under MMSE criterion. Simulations show the speed advantage of the proposed algorithms.