Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels with M-QAM Modulation (1405.3057v3)

Published 13 May 2014 in cs.IT and math.IT

Abstract: In this paper, we propose a low complexity graph-based linear minimum mean square error (LMMSE) equalizer in order to remove inter-symbol and inter-stream interference in multiple input multiple output (MIMO) communication. The proposed state space representation inflicted on the graph provides linearly increasing computational complexity with block length. Also, owing to the Gaussian assumption used in the presented cycle-free factor graph, the complexity of the suggested equalizer structure is not affected by the size of the signalling space. In addition, we introduce an efficient way of computing extrinsic bit log-likelihood ratio (LLR) values for LMMSE estimation compatible with higher order alphabets which is shown to perform better than the other methods in the literature. Overall, we provide an efficient receiver structure reaching high data rates in frequency selective MIMO systems whose performance is shown to be very close to a genie-aided matched filter bound through extensive simulations.

Citations (11)

Summary

We haven't generated a summary for this paper yet.