Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 159 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Large Multiuser MIMO Detection: Algorithms and Architectures (1805.11514v2)

Published 29 May 2018 in cs.IT and math.IT

Abstract: In this thesis, we investigate the problem of efficient data detection in large MIMO and high order MU-MIMO systems. First, near-optimal low-complexity detection algorithms are proposed for regular MIMO systems. Then, a family of low-complexity hard-output and soft-output detection schemes based on channel matrix puncturing targeted for large MIMO systems is proposed. The performance of these schemes is characterized and analyzed mathematically, and bounds on capacity, diversity gain, and probability of bit error are derived. After that, efficient high order MU-MIMO detectors are proposed, based on joint modulation classification and subspace detection, where the modulation type of the interferer is estimated, while multiple decoupled streams are individually detected. Hardware architectures are designed for the proposed algorithms, and the promised gains are verified via simulations. Finally, we map the studied search-based detection schemes to low-resolution precoding at the transmitter side in massive MIMO and report the performance-complexity tradeoffs.

Summary

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)