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
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.
Integrity signals
Registry
Cites
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.
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
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Verdú, S. (1998) · Cited by 4,682
Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela, R. A. (2002) · 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167) · doi:10.1109/issse.1998.738086 · Cited by 3,527
Introduction to Space-Time Wireless Communications
Paulraj, A. J., Nabar, R. U., & Gore, D. (2003) · Cited by 3,469
Christopoulos, C., & Wright, A. (1999) · Electrical Power System Protection · doi:10.1007/978-1-4757-5065-2_13 · Cited by 2,748
Golden, G. D., Foschini, C. J., Valenzuela, R. A., et al. (1999) · Electronics Letters · doi:10.1049/el:19990058 · Cited by 1,636
A universal lattice code decoder for fading channels
Viterbo, E., & Bouros, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771234 · Cited by 1,513
On the sphere-decoding algorithm I. Expected complexity
Hassibi, B., & Vikalo, H. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850352 · Cited by 1,179
Space-time coding theory and practice
Jafarkhani, H. (2005) · Cited by 644
Image restoration using a neural network
Zhou, Y.-T., Chellappa, R., Vaid, A., & Jenkins, B. K. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.1641 · Cited by 412
Hanzo, L., Yang, L., Kuan, E., & Yen, K. (2003) · Wiley eBooks · doi:10.1002/0470863110 · Cited by 352
Ma, W.-K., Davidson, T. N., Wong, K. M., Luo, Z.-Q., & Ching, P.-C. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.992139 · Cited by 346
The application of semidefinite programming for detection in CDMA
Tan, P. H., & Rasmussen, L. K. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.942507 · Cited by 183
Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems
Farhang-Boroujeny, B., Zhu, H., & Shi, Z. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872539 · Cited by 172
Sun, Y. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847794 · Cited by 54
Improvement on performance of modified Hopfield neural network for image restoration
Sun, Y., Li, J.-G., & Yu, S. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.382504 · Cited by 38
Sun, Y. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847795 · Cited by 34
Sun, Y. (2002) · International Conference on Communications · doi:10.1109/icc.1998.683089 · Cited by 20
Cited by
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Botsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
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.