TY - GEN
T1 - Conjugate Gradient based MMSE Decision Feedback equalization
AU - Dietl, Guido
AU - Salam, Sabik
AU - Utschick, Wolfgang
AU - Nossek, Josef A.
PY - 2008
Y1 - 2008
N2 - 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 timevarying 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.
AB - 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 timevarying 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.
UR - http://www.scopus.com/inward/record.url?scp=62449119036&partnerID=8YFLogxK
U2 - 10.1109/ISWCS.2008.4726111
DO - 10.1109/ISWCS.2008.4726111
M3 - Conference contribution
AN - SCOPUS:62449119036
SN - 9781424424894
T3 - ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems
SP - 523
EP - 527
BT - ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems
T2 - 2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08
Y2 - 21 October 2008 through 24 October 2008
ER -