By Topic

Enhancing the super exponential method of blind equalisation with the fast RLS Kalman algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Toh, B.E. ; Dept. of Electron. & Electr. Eng., Leeds Univ., UK ; McLernon, D.C. ; Lakkis, I.

A method for efficiently implementing super exponential (SE) blind equalisation is proposed. The method, based on fast Kalman filtering theory, is recursive in order and in time, and leads to a significant reduction in the number of arithmetic operations. Using the order update by partitioning the covariance matrix of the first hundred data in a specific form, a fast initialisation is implemented. The resulting algorithm achieves the same theoretical fast convergence characteristics as the original SE algorithm but with a significant reduction in arithmetic operations

Published in:

Electronics Letters  (Volume:32 ,  Issue: 2 )