An accelerated constant modulus algorithm for space-time blind equalization

Página do item simplificado
dc.contributor.authorSilva M.T.M.
dc.contributor.authorGerken M.
dc.contributor.authorMiranda M.D.
dc.date.accessioned2024-03-13T00:57:23Z
dc.date.available2024-03-13T00:57:23Z
dc.date.issued2015
dc.description.abstract© 2004 EUSIPCO.We address the problem of signal separation using space-time blind equalization techniques. A novel blind algorithm, denoted ACMA (Accelerated Constant Modulus Algorithm), is proposed. It minimizes the constant modulus cost function and is based on a tuner used in adaptive control that sets the second derivative ('acceleration ') of the coefficient estimates. Both the convergence speed and computational complexity of Multiuser ACMA lie between those of the Multiuser Constant Modulus and the Multiuser Shalvi-Weinstein algorithms. Some preliminary results show that the proposed algorithm presents a robust behavior with respect to global minima and tracking capability.
dc.description.firstpage1853
dc.description.lastpage1856
dc.description.volume06-10-September-2004
dc.identifier.issn2219-5491
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36208
dc.relation.ispartofEuropean Signal Processing Conference
dc.rightsAcesso Restrito
dc.titleAn accelerated constant modulus algorithm for space-time blind equalization
dc.typeArtigo de evento
local.scopus.citations4
local.scopus.eid2-s2.0-84979939203
local.scopus.subjectConstant modulus algorithms
local.scopus.subjectConstant modulus cost function
local.scopus.subjectConvergence speed
local.scopus.subjectEqualization techniques
local.scopus.subjectSecond derivatives
local.scopus.subjectShalvi-weinstein algorithms
local.scopus.subjectSignal separation
local.scopus.subjectTracking capability
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84979939203&origin=inward
Arquivos
Coleções
Artigo de evento