Recursive blind equalization with an optimal bounding ellipsoid algorithm

Mathieu Pouliquen (1, 2) , Miloud Frikel (1, 2) , Matthieu Denoual (3)

1 LAC - Laboratoire d'automatique de Caen
2 Equipe Automatique - Laboratoire GREYC - UMR6072
3 Equipe Electronique - Laboratoire GREYC - UMR6072

In 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 algorithm 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 algorithm is provided. In order to show the good performance of the proposed approach some simulations are performed.

Keywords: Abstracts; Finite impulse response filters; Robustness; Blind equalisers; FIR filters; Blind Equalization; FIR equalizer

Domains: Engineering Sciences [physics]; Automatic

Mathieu Pouliquen, Miloud Frikel, Matthieu Denoual. Recursive blind equalization with an optimal bounding ellipsoid algorithm. 2014 22nd European Signal Processing Conference (EUSIPCO), Sep 2014, Lisbonne, Portugal. pp.2240-2244. ⟨hal-01826043⟩