Por favor, use este identificador para citar o enlazar este ítem: http://repositorio.ufc.br/handle/riufc/72150
Tipo: Artigo de Periódico
Título : Blind channel identification algorithms based on the Parafac decomposition of cumulant tensors: the single and multiuser cases
Autor : Fernandes, Carlos Estevão Rolim
Favier, Gérard
Mota, João César Moura
Palabras clave : Channel identification;Parameter estimation;Tensor decomposition;Underdetermined linear mixtures
Fecha de publicación : 2008
Editorial : Signal Processing
Citación : FERNANDES, Carlos Estevão Rolim; FAVIER, Gérard; MOTA, João Cesar Moura. Blind channel identification algorithms based on the Parafac decomposition of cumulant tensors: the single and multiuser cases. Signal Processing, [S. l.], v. 88, n. 6, p. 1382-1401, 2008.
Abstract: In this paper, we exploit the symmetry properties of 4th-order cumulants to develop new blind channel identification algorithms that utilize the parallel factor (Parafac) decomposition of cumulant tensors by solving a single-step (SS) least squares (LS) problem. We first consider the case of single-input single-output (SISO) finite impulse response (FIR) channels and then we extend the results to multiple-input multiple-output (MIMO) instantaneous mixtures. Our approach is based on 4th-order output cumulants only and it is shown to hold for certain underdetermined mixtures, i.e. systems with more sources than sensors. A simplified approach using a reduced-order tensor is also discussed. Computer simulations are provided to assess the performance of the proposed algorithms in both SISO and MIMO cases, comparing them to other existing solutions. Initialization and convergence issues are also addressed.
URI : http://www.repositorio.ufc.br/handle/riufc/72150
ISSN : 1872-7557
Derechos de acceso: Acesso Aberto
Aparece en las colecciones: DEHA - Artigos publicados em revista científica

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
2008_art_cerfernandes1.pdf420,62 kBAdobe PDFVisualizar/Abrir


Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.