An efficient local search heuristics for asynchronous multiuser detection

IEEE Communications Letters

Volumn 7, Issue 7, 2003, Pages 299-301

  Lim, Heng Siong ^a   Venkatesh, B ^a  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

Author keywords

Code division multiple access; Local search heuristics; Multiuser detection

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DIRECT SEQUENCE SYSTEMS; GAUSSIAN NOISE (ELECTRONIC); HEURISTIC METHODS; MATRIX ALGEBRA; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; SIGNAL DETECTION; SIGNAL TO NOISE RATIO;

ASYNCHRONOUS MULTIUSER DETECTION;

CODE DIVISION MULTIPLE ACCESS;

EID: 0042592953     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.813799     Document Type: Article

References (11)

1. S. Verdu, "Computational complexity of optimal multiuser detection," Algorithmica, vol. 4, pp. 303-312, 1989.
2. C. Ergün and K. Hacioglu, "Multiuser detection using a genetic algorithm in CDMA communications systems," IEEE Trans. Commun., vol. 48, pp. 1374-1383, Aug. 2000.
3. H. S. Lim, M. V. C. Rao, W. C. Tan, and H. T. Chuah, "Multiuser detection for DS-CDMA systems using evolutionary programming," IEEE Commun. Lett., to be published.
4. J. Hu and R. S. Blum, "A gradient guided search algorithm for multiuser detection," IEEE Commun. Lett., vol. 4, pp. 340-342, Nov. 2000.
5. J. Luo, G. Levchuk, K. Pattipati, and P. Willett, "A class of coordinate descent methods for multiuser detection," in Proc. ICASSP '00, vol. 5, 2000, pp. 2853-2856.
6. A. AlRustamani and B. R. Vojcic, "A new approach to greedy multiuser detection," IEEE Trans. Commun., vol. 50, pp. 1326-1336, Aug. 2002.
7. P. H. Tan and L. K. Rasmussen, "A reactive tabu search heuristic for multiuser detection in CDMA," in Proc. ISIT '02, 2002, pp. 472-472.
8. M. K. Varanasi and B. Aazhang, "Multi-stage detection in asynchronous code-division multiple access communications," IEEE Trans. Commun., vol. 38, pp. 509-519, Apr. 1990.
9. P. Merz and B. Freisleben, "Greedy and local search heuristics for unconstrained binary quadratic programming," J. Heuristics, vol. 8, no. 2, pp. 197-213, Mar. 2002.
10. B. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. J., vol. 49, pp. 291-307, 1972.
11. S. Lin and B. Kernighan, "An effective heuristic algorithm for the travelling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.