A robust algorithm for blind space-time equalization

Página do item simplificado
dc.contributor.authorSilva M.T.M.
dc.contributor.authorMiranda M.D.
dc.contributor.authorLicciardi Jr. A.N.
dc.date.accessioned2024-03-13T01:44:53Z
dc.date.available2024-03-13T01:44:53Z
dc.date.issued2004
dc.description.abstractThe efficient separation of signals is a frequent problem in multiuser communication systems. Among many algorithms to blind deconvolution of a multiple-input multiple-output (MIMO) systems, the one that utilizes higher-order cumulants has advantages in regards of convergence rate. Inspired on this algorithm and on a stochastic gradient approach, we propose an algorithm with 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.
dc.description.volume4
dc.identifier.issn1520-6149
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/37922
dc.relation.ispartofICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
dc.rightsAcesso Restrito
dc.titleA robust algorithm for blind space-time equalization
dc.typeArtigo de evento
local.scopus.citations9
local.scopus.eid2-s2.0-4544291759
local.scopus.subjectConstant Modulus Algorithm (CMA)
local.scopus.subjectMean-square error (MSE)
local.scopus.subjectMultiple-input multiple-output (MIMO) systems
local.scopus.subjectShalvi-Weinstein Algorithm (SWA)
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=4544291759&origin=inward
Arquivos
Coleções
Artigo de evento