Recursive blind equalization with an optimal bounding ellipsoid algorithm - Normandie Université Access content directly
Conference Papers Year : 2014

Recursive blind equalization with an optimal bounding ellipsoid algorithm

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.
No file

Dates and versions

hal-01826043 , version 1 (28-06-2018)

Identifiers

  • HAL Id : hal-01826043 , version 1

Cite

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⟩
60 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More