On the use of kernel structure for blind equalization

The mathematical theory of kernel (null space) structure of Hankel and Hank el-like matrices is applied to the problem of blind equalization of cochann el signals. This approach provides a new perspective on the blind equalizat ion problem and gives insights into the identifiability conditions already presented in the literature. An algorithm is presented that tracks the er;a ct null space of the symbol matrix even in the presence of noise. This work exploits shift structure in the oversampled channel output and the finite alphabet property of the signals. Previously, these two properties were use d independently in a two-step (equalize then separate) process. A contribut ion of the new approach is that it allows simultaneous exploitation of both shift structure and the finite alphabet property of the signals.