Use este identificador para citar ou linkar para este item: http://repositorio.ufc.br/handle/riufc/70539
Registro completo de metadados
Campo DCValorIdioma
dc.contributor.authorFernandes, Carlos Alexandre Rolim-
dc.contributor.authorFavier, Gérard-
dc.contributor.authorMota, João César Moura-
dc.date.accessioned2023-02-08T12:20:28Z-
dc.date.available2023-02-08T12:20:28Z-
dc.date.issued2007-
dc.identifier.citationFERNANDES, C. A. R; FAVIER, G.; MOTA, J. C. M. Blind source separation and identification of nonlinear multiuser channels using second order statistics and modulation codes. In: WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 8., 2007, Helsinque. Anais... Helsinque: IEEE, 2007. p. 1-5.pt_BR
dc.identifier.urihttp://www.repositorio.ufc.br/handle/riufc/70539-
dc.description.abstractIn this paper, a Blind Source Separation (BSS) and channel identification method using second order statistics is proposed for nonlinear multiuser communication channels. It is based on the joint diagonalization of a set of covariance matrices. Modulation codes (constrained codes) are used to ensure the orthogonality of nonlinear combinations of the transmitted signals, allowing the application of a joint diagonalization based estimation algorithm. This constitutes a new application of modulation codes, used to introduce temporal redundancy and to ensure some statistical constraints. Identifiability conditions for the problem under consideration are addressed and some simulation results illustrate the performance of the proposed method.pt_BR
dc.language.isoenpt_BR
dc.publisherWorkshop on Signal Processing Advances in Wireless Communicationspt_BR
dc.titleBlind source separation and identification of nonlinear multiuser channels using second order statistics and modulation codespt_BR
dc.typeArtigo de Eventopt_BR
Aparece nas coleções:DETE - Trabalhos apresentados em eventos

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
2007_eve_jcmmota.pdf228,58 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.