Title :
The application of semidefinite programming for detection in CDMA
Author :
Tan, Peng Hui ; Rasmussen, Lars K.
Author_Institution :
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
fDate :
8/1/2001 12:00:00 AM
Abstract :
A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance
Keywords :
AWGN channels; cellular radio; code division multiple access; computational complexity; error statistics; maximum likelihood detection; multiuser channels; programming; spread spectrum communication; AWGN channels; BER; CDMA channel model; DS-CDMA; ML performance; approximation; cellular radio; code division multiple access; cutting planes; interior point methods; maximum-likelihood detection; multiple access interference; multiuser detection; polynomial computational complexity; semidefinite programming; semidefinite relaxation; simulated bit error rate performance; AWGN; Computational complexity; Computational modeling; Detectors; Iterative algorithms; Maximum likelihood detection; Modulation coding; Multiaccess communication; Multiple access interference; Polynomials;
Journal_Title :
Selected Areas in Communications, IEEE Journal on
