The Wiener filter solves the Wiener-Hopf equation and may be approximated by the multi-stage nested Wiener filter (MSNWF) which lies in the Krylov subspace of the covariance matrix of the observation and the cross-correlation vector between the observation and the desired signal. Moreover, since the covariance matrix is Hermitian, the Lanczos algorithm can be used to compute the Krylov subspace basis. The conjugate gradient (CG) method is another approach to solving a system of linear equations. We derive the relationship between the CG method and the Lanczos based MSNWF and finally transform the formulas of the MSNWF into those of the CG algorithm. Consequently, we present a CG based MSNWF where the filter weights and the mean square error (MSE) are updated at each iteration step. The resulting algorithm is used for linear equalization of the received signal in an enhanced data rates for GSM evolution (EDGE) system. Simulation results demonstrate the ability of the MSNWF to reduce receiver complexity while maintaining the same level of system performance.
展开▼
