Detecção Multiusuário DS/CDMA Baseada na Projeção de Sinais via Expansão Polinomial (DS/CDMA Multiuser Detection Based on Polynomial Expansion Subspace Signal)

Taufik Abrão (taufik@uel.br)1, Jaime Laelson Jacob (jljacob@uol.com.br)1, Paul Jean Jeszensky (pjj@lcs.poli.usp.br)2


1Universidade Estadual de Londrina
2Escola Politécnica da Universidade de São Paulo

This paper appears in: Revista IEEE América Latina

Publication Date: Sept. 2008
Volume: 6,   Issue: 5 
ISSN: 1548-0992


Abstract:
In this work, we proposed a comparative analysis for the performance-complexity tradeoff of several Hybrid Group-blind multiuser detectors with polynomial expansion (MuD Group-Blind PE). Using flop notation, the computacional complexity for the three forms of SBld-MuD-II hybrid detector based on polinomial approximation was compared. MCS results indicated the superiority of the SBld-MuD-I detector in the presence of parameters errors estimates and for the SBld-MuD-II detector with polinomial approach based on Gershgorin circles.

Index Terms:
Blind and Group-Blind Detection, Multiuser Detection, DS/CDMA, Orthogonal Vectors, Signal Subspace, Polynomial Expansion, Gershgorin Circles   


Documents that cite this document
This function is not implemented yet.


[PDF Full-Text (765)]