TY - GEN
T1 - Blind zero-forcing equalization without channel estimation
AU - Li, Xiaohua
AU - Fan, H.
N1 - Publisher Copyright: © 1999 IEEE.
PY - 1999
Y1 - 1999
N2 - We present methods for computing fractionally spaced zero-forcing blind equalizers with arbitrary delay directly from second order statistics of the observations without any channel identification. Such direct estimation, without even partial channel identification, completely avoids channel identification errors, resulting in better equalization performance. We first develop a batch type algorithm, then adaptive algorithms are obtained by linear prediction and gradient descent optimization. Our adaptive algorithms do not require channel order estimation, nor rank estimation. Compared with other second order statistics based approaches, ours do not require channel identification at all. On the other hand, compared with the CMA type algorithms, ours use only second order statistics, thus no local convergence problem exists and faster convergence can be achieved. Simulations show that our algorithms outperform most typical existing algorithms.
AB - We present methods for computing fractionally spaced zero-forcing blind equalizers with arbitrary delay directly from second order statistics of the observations without any channel identification. Such direct estimation, without even partial channel identification, completely avoids channel identification errors, resulting in better equalization performance. We first develop a batch type algorithm, then adaptive algorithms are obtained by linear prediction and gradient descent optimization. Our adaptive algorithms do not require channel order estimation, nor rank estimation. Compared with other second order statistics based approaches, ours do not require channel identification at all. On the other hand, compared with the CMA type algorithms, ours use only second order statistics, thus no local convergence problem exists and faster convergence can be achieved. Simulations show that our algorithms outperform most typical existing algorithms.
UR - https://www.scopus.com/pages/publications/0033315923
U2 - 10.1109/ACSSC.1999.831864
DO - 10.1109/ACSSC.1999.831864
M3 - Conference contribution
T3 - Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
SP - 1022
EP - 1026
BT - Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
A2 - Matthews, Michael B.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999
Y2 - 24 October 1999 through 27 October 1999
ER -