The application of semidefinite programming for detection in CDMA

Authors:
Peng Hui Tan;L. K. Rasmussen
Affiliations:
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 13

Review: Using the eigenvalue relaxation for binary least-squares estimation problems

Signal Processing
A family of likelihood ascent search multiuser detectors: an upper bound of bit error rate and a lower bound of asymptotic multiuser efficiency

IEEE Transactions on Communications
Efficient implementation of quasi-maximum-likelihood detection based on semidefinite relaxation

IEEE Transactions on Signal Processing
A new quasi-optimal detection algorithm for a non orthogonal spectrally efficient FDM

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
PIC-based iterative SDR detector for OFDM systems in doubly-selective fading channels

IEEE Transactions on Wireless Communications
S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

Wireless Personal Communications: An International Journal
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form

IEEE Transactions on Information Theory
Probabilistic analysis of the semidefinite relaxation detector in digital communications

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Matrix-lifting semi-definite programming for detection in multiple antenna systems

IEEE Transactions on Signal Processing
A Second-Order Cone Programming Method for Multiuser Detection Problem

Wireless Personal Communications: An International Journal
A continuous method for solving multiuser detection in CDMA

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Information propagation game: a tool to acquire humanplaying data for multiplayer influence maximization on social networks

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A Continuous Relaxation Method for Multiuser Detection Problem

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.14

Visualization

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