Abstract
The performance of linear filters degrade drastically when applied to mitigate intersymbol interference caused by channels with frequent nulls in their spectral characteristics like, e.g., time-dispersive radio channels. In such cases, the well-known decision feedback equalizer (DFE) is one possible nonlinear approach to improve the quality of the receiver. However, adapting the DFE filter coefficients to equalize time-varying channels is computationally intense, especially if the dimension of the observation vector is very high. In this paper, we apply the conjugate gradient (CG) algorithm to a conventional minimum mean square error (MMSE) DFE in order to reduce its computational complexity. Moreover, we compare its performance to the one of MMSE DFE versions which are based on the computationally efficient least-mean-square (LMS) or recursive least-squares (RLS) algorithm, respectively. The analysis additionally includes a detailed investigation of computational complexity with respect to the required number of floating point operations (FLOPs). Simulation results when applied to a digital communications system show the ability of the CG based MMSE DFE to outperform either the LMS and the RLS based MMSE DFE although its computational complexity is even smaller in most of the cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.