A lattice shalvi-weinstein algorithm for blind equalization

Página do item simplificado
dc.contributor.authorBernardes D.B.
dc.contributor.authorMiranda M.D.
dc.contributor.authorSilva M.T.M.
dc.date.accessioned2024-03-13T01:39:43Z
dc.date.available2024-03-13T01:39:43Z
dc.date.issued2007
dc.description.abstractIn blind equalization, the Constant Modulus Algorithm (CMA) and Shalvi-Weinstein Algorithm (SWA) present an unfavorable tradeoff between convergence rate and computational cost. Inspired in supervised order-recursive algorithms, we propose a Lattice SWA, which has the number of operations per iteration of the equalizer order and maintains the SWA convergence rate. It presents a more robust behavior than that of SWA, avoiding numerical divergence when implemented in finite precision. © 2007 IEEE.
dc.description.volume3
dc.identifier.doi10.1109/ICASSP.2007.367100
dc.identifier.issn1520-6149
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/37640
dc.relation.ispartofICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
dc.rightsAcesso Restrito
dc.subject.otherlanguageAdaptive filters
dc.subject.otherlanguageBlind equalization
dc.subject.otherlanguageLattice structure
dc.subject.otherlanguageOrder-recursive algorithms
dc.subject.otherlanguageShalvi-weinstein algorithm
dc.titleA lattice shalvi-weinstein algorithm for blind equalization
dc.typeArtigo de evento
local.scopus.citations2
local.scopus.eid2-s2.0-34547508211
local.scopus.subjectConstant Modulus Algorithm (CMA)
local.scopus.subjectShalvi-Weinstein Algorithm (SWA)
local.scopus.subjectSupervised order-recursive algorithms
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34547508211&origin=inward
Arquivos
Coleções
Artigo de evento