Name
Abstract | ||
|---|---|---|
This letter considers the application of k-opt local search to the detection of data transmitted through the additive white Gaussian noise channel by K asynchronous users using direct-sequence code-division multiple access. The algorithm is based on a general approach to heuristics that is highly efficient in solving large combinatorial optimization problems. It is shown that the algorithm manages to produce optimum solutions with high frequency, in running time that grows about O(n/sup 2/). |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/LCOMM.2003.813799 | IEEE Communications Letters |
Keywords | Field | DocType |
Multiuser detection,Detectors,Additive white noise,Search methods,Direct-sequence code-division multiple access,Frequency,Computational complexity,Evolutionary computation,Phase shift keying | Asynchronous communication,Computer science,Algorithm,Multiuser detection,Combinatorial optimization,Heuristics,Local search (optimization),Code division multiple access,Computational complexity theory,Spread spectrum | Journal |
Volume | Issue | ISSN |
7 | 7 | 1089-7798 |
Citations | PageRank | References |
14 | 0.92 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng-Siong Lim | 1 | 45 | 9.65 |
| B. Venkatesh | 2 | 14 | 0.92 |