| Paper: | SPCOM-L4.3 | ||
| Session: | (Semi)blind Techniques I | ||
| Time: | Thursday, May 20, 13:40 - 14:00 | ||
| Presentation: | Lecture | ||
| Topic: | Signal Processing for Communications: Detection, Estimation, and Demodulation | ||
| Title: | BLIND EQUALIZERS BASED ON POLYNOMIAL CRITERIA | ||
| Authors: | Ludwig Rota; Laboratoire I3S - UNSA - CNRS | ||
| Pierre Comon; Laboratoire I3S - UNSA - CNRS | |||
| Abstract: | We describe a family of criteria dedicated to blind SISO equalizers. These criteria are based on Alphabet Polynomial Fitting (APF), and remind the well-known Constant Modulus algorithm (CMA) criterion, and encompass the Constant Power Algorithm (CPA) criterion. Algorithms based on several polynomial criteria have been implemented in block form (including CPA and APF), as well as the CMA and the Kurtosis Maximization (KMA). Block implementations are indeed more efficient for short data records, and allow the direct computation of the optimal step size in a gradient descent, as shown in the paper. Computational complexities of APF, KMA and CMA are eventually compared, as well as their performances for various digitally modulated inputs. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops