Abstract
We propose applying an approximate Fourier series to evaluate efficiently the bit-error-rate (BER) performance of finite-length linear equalization (LE) and decision feedback equalization (DFE). By extending the Fourier series, we enable BER calculations for quadrature phase-shift keying (QPSK) transmission on complex channels with in-phase and crosstalk intersymbol interference (ISI). The BER calculation is based on determining the residual ISI samples and background Gaussian noise variance at the equalizer output for static channels or for realizations of quasi-static fading channels. A simple bound on the series error magnitude in terms of the Fourier series parameters ensures the required accuracy and precision. Improved state transition probability estimates are derived and verified by simulation for an approximate Markov model of the DFE error propagation for the case in which residual ISI exists even when the previous decisions stored in the feedback filter (FBF) are correct. We demonstrate the ease and widespread applicability of our approach by producing results which elucidate a variety of equalization tradeoffs. Our analysis includes symbol-spaced and fractionally spaced minimum mean-square error (MMSE)-LE, zero-forcing (ZF)-LE, and MMSE-DFE (with and without error propagation) on static ISI channels and multipath channels with quasi-static Rayleigh fading; a comparison between suboptimum and optimum receiver filtering in conjunction with equalization; and an assessment of the accuracy of some widely used equalization BER approximations and bounds.
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.