Use este identificador para citar ou linkar para este item:
http://repositorio.ufc.br/handle/riufc/4247
Registro completo de metadados
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Cavalcante, Charles Casimiro | - |
dc.contributor.author | Cavalcanti, Francisco Rodrigo Porto | - |
dc.contributor.author | Mota, João César Moura | - |
dc.contributor.author | Romano, João Marcos Travassos | - |
dc.date.accessioned | 2012-12-20T14:32:30Z | - |
dc.date.available | 2012-12-20T14:32:30Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | CAVALCANTE, C. C. et al. A constrained version of fitting pdf algorithm for blind source separation. In: WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 4., 2003, Rome. Anais... Rome: IEEE, 2003. p. 452-456. | pt_BR |
dc.identifier.uri | http://www.repositorio.ufc.br/handle/riufc/4247 | - |
dc.description.abstract | An adaptive multiuser constrained version of a fitting probability density function (p)dAf)' a%@lgorithm for source separation is proposed. The novel algorithm is derived from the multiuser kurtosis (MUK) procedure proposed in the literature. In fact, the proposed approach cay be viewed as a generalization of MUK one. The resulting algorithm is evaluated through computational simulations in the context of a space division multiple access (SDMA) system. The obtained results show that a better performance is attained w.r.t. the unconstrained version. | pt_BR |
dc.language.iso | en | pt_BR |
dc.publisher | Workshop on Signal Processing Advances in Wireless Communications | pt_BR |
dc.subject | Teleinformática | pt_BR |
dc.subject | Algoritmos | pt_BR |
dc.title | A constrained version of fitting pdf algorithm for blind source separation | pt_BR |
dc.type | Artigo de Evento | pt_BR |
Aparece nas coleções: | DETE - Trabalhos apresentados em eventos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
2003_eve_cccavalcante a constrained.pdf | 305,9 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.