Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 244

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message Passing

Wu, Sheng, Kuang, Linling, Ni, Zuyao, Lu, Jianhua, Huang, Defeng, Guo, Qinghua · 2014 · IEEE Journal of Selected Topics in Signal Processing

Abstract

One of the challenges in the design of large-scale multiuser MIMO-OFDM systems is developing low-complexity detection algorithms. To achieve this goal, we leverage message passing algorithms over the factor graph that represents the multiuser MIMO-OFDM systems and approximate the original discrete messages with continuous Gaussian messages through the use of the minimum Kullback-Leibler (KL) divergence criterion. Several signal processing techniques are then proposed to achieve near-optimal performance at low complexity. First, the principle of expectation propagation is employed to compute the approximate Gaussian messages, where the symbol belief is approximated by a Gaussian distribution and then the approximate message is calculated from the Gaussian approximate belief. In addition, the approximate symbol belief can be computed by the a posteriori probabilities fed back from channel decoders, which reduces the complexity dramatically. Second, the first-order approximation of the message is utilized to further simplify the message updating, leading to an algorithm that is equivalent to the AMP algorithm proposed by DonohoFinally, the message updating is further simplified using the central-limit theorem. Compared with the single tree search sphere decoder (STS-SD) and the iterative (turbo) minimum mean-square error based soft interference cancellation (MMSE-SIC) in the literature through extensive simulations, the proposed message passing algorithms can achieve a near-optimal performance while the complexity is decreased by tens of times for a 64$\times$64 MIMO system. In addition, it is shown that the proposed message passing algorithms exhibit desirable tradeoffs between performance and complexity for a low-dimensional MIMO system.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jstsp.2014.2313766

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cites

  • Factor graphs and the sum-product algorithm

    Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 3×

    “For the presentation of the factor graph and message passing algorithm, we use the same convention as in [51] and [52], to which we refer the reader for an in-depth review.”
    BackgroundMethod

Show all 1 references

Cited by

See all 244

Metadata

Authors
Wu, S., Kuang, L., Ni, Z., Lu, J., Huang, D., & Guo, Q.
Venue
IEEE Journal of Selected Topics in Signal Processing
Published
2014-10
Volume
8
Issue
5
Pages
902-915
ISSN
  • 1932-4553 (ISSN-L)
  • 1941-0484
OpenAlex
W2075505133
Cited by
244
References
1
FWCI
9.02
Type
journal article
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: Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message Passing. https://app.cochat.ai/papers/10.1109/jstsp.2014.2313766
The paper
Wu, S., Kuang, L., Ni, Z., Lu, J., Huang, D., & Guo, Q. (2014). Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message Passing. IEEE Journal of Selected Topics in Signal Processing. https://doi.org/10.1109/jstsp.2014.2313766

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.