Vectorization of the DLMS transversal adaptive filter

The subject of high sampling rate realizations for transversal adaptive filters is addressed. In particular, a vectorized version of the delayed least mean squares (DLMS) algorithm is derived using look-ahead computation techniques. The resulting parallel algorithm is then mapped onto a linear array of highly pipelined processing modules, which can accept an input vector of arbitrary length, and compute the corresponding output vector in a single clock cycle. The proposed system is shown to be capable of implementing transversal adaptive filters at sampling rates which are theoretically without bound. The performance of the proposed system is analyzed and simulation results are presented to verify the convergence properties of the algorithm under varying degrees of vectorization