Reference : Semidefinite Programming for Detection in Linear Systems - Optimality Conditions and ...
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
Engineering, computing & technology : Electrical & electronics engineering
Semidefinite Programming for Detection in Linear Systems - Optimality Conditions and Space-Time Decoding
Jaldén, Joakim [> >]
Martin, Cristoff [> >]
Ottersten, Björn mailto [KTH Royal Institute of Technoloy]
IEEE International Conference on Acoustics Speech and Signal Processing
IEEE International Conference on Acoustics, Speech, and Signal Processing
April 2003
[en] Optimal maximum likelihood detection of finite alphabet symbols in general requires time consuming exhaustive search methods. The computational complexity of such techniques is exponential in the size of the problem and for large problems sub-optimal algorithms are required. In this paper, to find a solution in polynomial time, a semidefinite programming approach is taken to estimate binary symbols in a general linear system. A condition under which the proposed method provides optimal solutions is derived. As an application, the proposed algorithm is used as a decoder for a linear space-time block coding system and the results are illustrated with numerical examples.

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.