A lattice shalvi-weinstein algorithm for blind equalization
Tipo
Artigo de evento
Data de publicação
2007
Periódico
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Citações (Scopus)
2
Autores
Bernardes D.B.
Miranda M.D.
Silva M.T.M.
Miranda M.D.
Silva M.T.M.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
In 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.
Descrição
Palavras-chave
Assuntos Scopus
Constant Modulus Algorithm (CMA) , Shalvi-Weinstein Algorithm (SWA) , Supervised order-recursive algorithms