Skip to Main content Skip to Navigation
Conference papers

Recursive blind equalization with an optimal bounding ellipsoid algorithm

Mathieu Pouliquen 1, 2 Miloud Frikel 1, 2 Matthieu Denoual 3 
2 Equipe Automatique - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
3 Equipe Electronique - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-normandie-univ.archives-ouvertes.fr/hal-01826043
Contributor : Mathieu Pouliquen Connect in order to contact the contributor
Submitted on : Thursday, June 28, 2018 - 10:49:30 PM
Last modification on : Saturday, June 25, 2022 - 9:51:58 AM

Identifiers

  • HAL Id : hal-01826043, version 1

Citation

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⟩

Share

Metrics

Record views

54