The DOI matches its Crossref record.
Optimality of large MIMO detection via approximate message passing
Abstract
Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails prohibitive computational complexity. In order to reduce the computational complexity, a variety of sub-optimal detection algorithms have been proposed in the literature. In this paper, we analyze the optimality of a novel data-detection method for large MIMO systems that relies on approximate message passing (AMP). We show that our algorithm, referred to as individually-optimal (IO) large-MIMO AMP (short IO-LAMA), is able to perform IO data detection given certain conditions on the MIMO system and the constellation set (e.g., QAM or PSK) are met.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Samuel, N., Diskin, T., & Wiesel, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2899805 · Cited by 515
Model-Driven Deep Learning for MIMO Detection
He, H., Wen, C.-K., Jin, S., & Li, G. Y. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2976585 · Cited by 454
Samuel, N., Diskin, T., & Wiesel, A. (2017) · 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2017.8227772 · Cited by 429
Metadata
- Authors
- Jeon, C., Ghods, R., Maleki, A., & Studer, C.
- Venue
- 2015 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 1227-1231
- OpenAlex
- W2166500259
- Cited by
- 172
- References
- 0
- FWCI
- 15.73
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimality of large MIMO detection via approximate message passing. https://app.cochat.ai/papers/10.1109/isit.2015.7282651
- The paper
- Jeon, C., Ghods, R., Maleki, A., & Studer, C. (2015). Optimality of large MIMO detection via approximate message passing. 2015 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2015.7282651
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.