Name
Abstract | ||
|---|---|---|
In this paper the computational complexity associated with optimum maximum likelihood detector in wideband code division multiple access systems is addressed. In the proposed scheme, large number of users is divided in groups, each group having a unique orthogonal code and small number of users. Multiuser detection in a particular group is accomplished through particle swarm optimization algorithm, which lowers the search space and ends up with a much faster convergence compared to optimum maximum likelihood detector. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/WCSP.2010.5633544 | WCSP |
Keywords | Field | DocType |
code division multiple access,multiuser detection,orthogonal codes,particle swarm optimisation,pso algorithm,wcdma,computational complexity,maximum likelihood detector,particle swarm optimization,unique orthogonal code,wideband code division multiple access system,wireless communication,search space,bit error rate,wideband code division multiple access,detectors | Convergence (routing),Particle swarm optimization,Wireless,Computer science,Multiuser detection,Algorithm,Real-time computing,Theoretical computer science,Code division multiple access,Detector,Computational complexity theory,Bit error rate | Conference |
ISBN | Citations | PageRank |
978-1-4244-7554-4 | 1 | 0.38 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Choudhry, M.A.S. | 1 | 1 | 0.38 |
| Zubair, M. | 2 | 2 | 1.57 |
| Qureshi, I.M. | 3 | 1 | 0.38 |