The Diversity Order of the Semidefinite Relaxation Detector

DOI10.1109/TIT.2008.917634MaRDI QIDQ3604470zbMATH OpenFDO

Authors Joakim Jaldén, Björn E. Ottersten

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Semidefinite programming (90C22) Detection theory in information and communication theory (94A13)

Recommendations

• Probabilistic analysis of the semidefinite relaxation detector in digital communications
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems
• A low complexity semidefinite relaxation for large-scale MIMO detection
• Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization

Cited in

(6)

• Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
• Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems
• Probabilistic analysis of the semidefinite relaxation detector in digital communications
• Relaxed maximum a posteriori fault identification
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting

This page was built for publication: The Diversity Order of the Semidefinite Relaxation Detector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604470)