Recursive blind equalization with an optimal bounding ellipsoid algorithm

International audienceIn this paper, we present an algorithm for blind equalization i.e. equalization without training sequence. The proposed algorithm is based on the reformulation of the equalization problem in a set membership identification problem. Among the Set Membership Identification methods, the chosen algo- rithm is an optimal bounding ellipsoid type algorithm. This algorithm has a low computational burden which allows to use it easily in real time. Note that in this paper the equalizer is a finite impulse response filter. An analysis of the algo- rithm is provided. In order to show the good performance of the proposed approach some simulations are performed