| Paper: | SPCOM-P7.9 | ||
| Session: | MIMO Receiver Algorithms | ||
| Time: | Thursday, May 20, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communications: Detection, Estimation, and Demodulation | ||
| Title: | APPROXIMATE ML DETECTION FOR MIMO SYSTEMS WITH VERY LOW COMPLEXITY | ||
| Authors: | Markus Rupp; Vienna University of Technology | ||
| Gerhard Gritsch; Vienna University of Technology | |||
| Hans Weinrichter; Vienna University of Technology | |||
| Abstract: | Quite recently many Space-Time Coding (STC) schemes for multiple antenna systems (MIMO) have been proposed in order to achieve high data rate when transmitting over wireless channels. However, most of such schemes rely on Maximum Likelihood (ML) detection which can become quite complex when many antennas are involved and higher modulation schemes are utilized. On the other hand, the high diversity gains of MIMO channels are easily lost when low-complexity receivers like ZF or MMSE are applied. It is thus of utmost importance to look for low-complexity receivers which achieve almost ML performance. In this paper, a new scheme for approximate ML detection is proposed achieving ML performance in the area of BER between 0.0001 and 0.1 as it is of interest in wireless communications. The proposed scheme allows to transmit 64QAM schemes on 4x4 antenna schemes with a detection complexity of only 1% of a brute force ML receiver. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops