Speaker: Researcher Yafeng Liu(Chinese Academy of Sciences)
Title: Semidefinite Relaxations for MIMO Detection: Tightness, Tighterness, and Beyond
Time: Fri Nov.22, 2019,PM:3:00-4:00
Location: Room 4318, Building No.4, Wushan Campus
Abstract:
Multiple-input multi-output (MIMO) detection is a fundamental problem in modern digital communications. Semidefinite relaxation (SDR) based algorithms are a popular class of approaches to solving the problem because the algorithms have a polynomial-time worst-case complexity and generally can achieve a good detection error rate performance. In this talk, we shall first develop two new SDRs for MIMO detection and show their tightness under an easily checkable condition. This result answers an open question posed by So in 2010. Then, we shall briefly talk about the tighterness relationship between some existing SDRs for the MIMO detection problem in the literature. Finally, if time is allowed, we shall also talk about a branch-and-bound algorithm (based on the newly derived SDR) for globally solving the MIMO detection problem (and a more general class of nonconvex complex quadratic problems).