A robust algorithm for blind space-time equalization

The efficient separation of signals is a frequent problem in multiuser communication systems. Among many algorithms for blind deconvolution of a multiple-input multiple-output (MIMO) system, the one that utilizes higher-order cumulants has advantages in regards to convergence rate. Inspired by this...

Full description

Saved in:
Bibliographic Details
Main Authors: Silva, M.T.M., Miranda, M.D., Licciardi, A.N.Jr
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Applied sciences
Blind equalizers
Convergence
Deconvolution
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Finite impulse response filter
Information, signal and communications theory
MIMO
Miscellaneous
Mobile communication
Robustness
Signal and communications theory
Signal processing
Signal, noise
Steady-state
Stochastic processes
Telecommunications and information theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The efficient separation of signals is a frequent problem in multiuser communication systems. Among many algorithms for blind deconvolution of a multiple-input multiple-output (MIMO) system, the one that utilizes higher-order cumulants has advantages in regards to convergence rate. Inspired by this algorithm, and on a stochastic gradient approach, we propose an algorithm with the capacity of recovering simultaneously all sources, denoted as MU-SWA (multiuser Shalvi-Weinstein algorithm). Based on the steady-state analysis, recently presented by Luo and Chambers for the multiuser constant modulus algorithm, we derive the expression for the mean-square error of MU-SWA. Simulation results show that MU-SWA presents a more robust behavior with respect to convergence rate and tracking capability when compared to others known algorithms for blind multiuser equalization.
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.2004.1326962