Semidefinite Programming for Detection in Linear Systems – Optimality Conditions and Space-Time Decoding
2003 (English)In: IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE , 2003, Vol. 2, 9-12 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 2003. Vol. 2, 9-12 p.
Block codes, Computational complexity, Linear programming, Linear systems, Maximum likelihood decoding, Maximum likelihood detection, Maximum likelihood estimation, Polynomials, Sensor systems, Signal to noise ratio
Signal Processing Telecommunications
IdentifiersURN: urn:nbn:se:kth:diva-89868DOI: 10.1109/ICASSP.2003.1202528OAI: oai:DiVA.org:kth-89868DiVA: diva2:503776
2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)
NR 201408052012-02-162012-02-162012-02-16Bibliographically approved