DocumentCode
2134203
Title
The low-cost implement method of blind two-step equalization algorithm
Author
Wu, Tao ; Dai, Songyin ; Wei, Xin ; Yu, Lei
Author_Institution
Dept. of Opt. & Electron. Equip., Acad. of Equip., Beijing, China
fYear
2012
fDate
21-23 April 2012
Firstpage
3603
Lastpage
3606
Abstract
To reduce the computational cost of two-step equalization algorithm brought by extracting the orthogonal basis of equalizer coefficient vector space using Singularity Value Decomposition (SVD), a low-cost implement method of blind two-step equalization algorithm is proposed, which obtains the orthogonal basis of equalizer coefflcient vector space using Gram-Schmidt orthogonalization to the first P columns of the inverse of the measurement auto-correlation matrix. It reduces the computational complexity from O(K3) to KP2, where P ≪ K. An adaptive implementation of the low-cost method is presented to update the equalizer coefficient vector real time, which has the computational complexity of O(K2). Numerical simulations show that the low-cost method has an advantage of computational simplicity and shares the same performance with the origin one, and the adaptive implementation has higher convergence speed and less steady residual error than the existing adaptive algorithm at present.
Keywords
adaptive equalisers; blind equalisers; computational complexity; matrix algebra; singular value decomposition; Gram-Schmidt orthogonalization; O(K2); O(K3); auto-correlation matrix; blind two-step equalization algorithm; computational complexity; equalizer coefficient vector space; low-cost implement method; singularity value decomposition; Blind Equalization; Gram-Schmidt Orthogonalization; MMSE Rule; Orthogonal Basis;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on
Conference_Location
Yichang
Print_ISBN
978-1-4577-1414-6
Type
conf
DOI
10.1109/CECNet.2012.6202259
Filename
6202259
Link To Document