Blind equalization in presence of bounded errors

This article presents a new approach to blind equalization of an FIR channel. It is based on a bounded-error assumption and takes into account the fact that the input signal is in a finite alphabet. We show that even in the noisy case, identifiability can be guaranteed in finite time, provided that...

Full description

Saved in:
Bibliographic Details
Main Authors: Icart, S., LeRoux, J., Pronzato, L., Thierry, E., Zhigljavsky, A.A.
Format: Conference Proceeding
Language:English
Subjects:
Blind equalizers
Channel capacity
Convergence
Data communication
Digital communication
Equations
Finite impulse response filter
Statistics
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article presents a new approach to blind equalization of an FIR channel. It is based on a bounded-error assumption and takes into account the fact that the input signal is in a finite alphabet. We show that even in the noisy case, identifiability can be guaranteed in finite time, provided that the support of the noise density is suitably bounded.
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.1997.604782