Semidefinite Programming for Detection in Linear Systems - Optimality Conditions and Space-Time Decoding

Reference : Semidefinite Programming for Detection in Linear Systems - Optimality Conditions and ...


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a journal
	Discipline(s) :	Engineering, computing & technology : Computer science Engineering, computing & technology : Electrical & electronics engineering
	To cite this reference:	http://hdl.handle.net/10993/43414

Title :	Semidefinite Programming for Detection in Linear Systems - Optimality Conditions and Space-Time Decoding
Language :	English
Author, co-author :	Jaldén, Joakim [> >]
	Martin, Cristoff [> >]
	Ottersten, Björn [KTH Royal Institute of Technoloy]
Publication date :	2003
Journal title :	IEEE International Conference on Acoustics Speech and Signal Processing
Peer reviewed :	Yes
ISSN :	1520-6149
Event name :	IEEE International Conference on Acoustics, Speech, and Signal Processing
Event date :	April 2003
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/43414

There is no file associated with this reference.

All documents in ORBi^lu are protected by a user license.