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

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

A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems

Vishnu Vardhan, K., Mohammed, S.K., Chockalingam, A., Sundar Rajan, B.·2008·IEEE Journal on Selected Areas in Communications

Abstract

We consider large MIMO systems, where by 'large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense interest because of the very high spectral efficiencies possible in such systems. We present a low-complexity detector which achieves uncoded near-exponential diversity performance for hundreds of antennas (i.e., achieves near SISO AWGN performance in a large MIMO fading environment) with an average per-bit complexity of just O(NtNr), where Ntand Nrdenote the number of transmit and receive antennas, respectively. With an outer turbo code, the proposed detector achieves good coded bit error performance as well. For example, in a 600 transmit and 600 receive antennas V-BLAST system with a high spectral efficiency of 450 bps/Hz (using BPSK and rate-3/4 turbo code), our simulation results show that the proposed detector performs to within about 7 dB from capacity. This practical feasibility of the proposed high-performance, low-complexity detector could potentially trigger wide interest in the theory and implementation of large MIMO systems. We also illustrate the applicability of the proposed detector in the low-complexity detection of high-rate, non-orthogonal space-time block codes and large multicarrier CDMA (MC-CDMA) systems. In large MC-CDMA systems with hundreds of users, the proposed detector is shown to achieve near single-user performance at an average per-bit complexity linear in number of users, which is quite appealing for its use in practical CDMA systems.

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/jsac.2008.080406

Cites

22 of 22 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

Cited by

See all 261

Metadata

Authors
Vishnu Vardhan, K., Mohammed, S. K., Chockalingam, A., & Sundar Rajan, B.
Venue
IEEE Journal on Selected Areas in Communications
Published
2008-04
Volume
26
Issue
3
Pages
473-485
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2101870477
Cited by
261
References
22
FWCI
11.65
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

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.