The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
Abstract
The maximum-likelihood (ML) multiuser detector is well known to exhibit better bit-error-rate (BER) performance than many other multiuser detectors. Unfortunately,ML detection (MLD) is a nondeterministic polynomial-time hard (NP-hard) problem, for which there is no known algorithm that can find the optimal solution with polynomial-time complexity (in the number of users). In this paper, a polynomial-time approximation method called semi-definite (SD) relaxation is applied to the MLD problem with antipodal data transmission. SD relaxation is an accurate approximation method for certain NP-hard problems. The SD relaxation ML (SDR-ML) detector is efficient in that its complexity is of the order of K3.5, where K is the number of users. We illustrate the potential of the SDR-ML detector by showing that some existing detectors, such as the decorrelator and the linear-minimum-mean-square-error detector, can be interpreted as degenerate forms of the SDR-ML detector. Simulation results indicate that the BER performance of the SDR-ML detector is better than that of these existing detectors and is close to that of the true ML detector, even when the cross-correlations between users are strong or the near-far effect is significant.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Fundamentals of statistical signal processing: Estimation theory
Prasad, K. V. (1994) · Control Engineering Practice · doi:10.1016/0967-0661(94)90195-3 · Cited by 7,902
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Verdú, S. (1998) · Cited by 4,682
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Matrices with Applications in Statistics.
Thomas, G. E., & Graybill, F. A. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981752 · Cited by 738
An Interior-Point Method for Semidefinite Programming
Helmberg, C., Rendl, F., Vanderbei, R. J., & Wolkowicz, H. (1996) · SIAM Journal on Optimization · doi:10.1137/0806020 · Cited by 706
Near-optimum detection in synchronous code-division multiple-access systems
Varanasi, M. K., & Aazhang, B. (1991) · IEEE Transactions on Communications · doi:10.1109/26.87163 · Cited by 438
Computational complexity of optimum multiuser detection
Verdú, S. (1989) · Algorithmica · doi:10.1007/bf01553893 · Cited by 325
Detection of stochastic processes
Kailath, T., & Poor, H. V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720538 · Cited by 215
Iterative multiuser receivers for CDMA channels: an EM-based approach
Nelson, L. B., & Poor, H. V. (1996) · IEEE Transactions on Communications · doi:10.1109/26.545900 · Cited by 198
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Self-citationTransmit beamforming for physical-layer multicasting
Sidiropoulos, N. D., Davidson, T. N., & Luo, Z.-Q. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872578 · Cited by 1,335
Self-citationFifty 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
Liao, W.-C., Chang, T.-H., Ma, W.-K., & Chi, C.-Y. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2094610 · Cited by 390
Self-citationMIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Metadata
- Authors
- Ma, W.-K., Davidson, T. N., Wong, K. M., Luo, Z.-Q., & Ching, P.-C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2002-04
- Volume
- 50
- Issue
- 4
- Pages
- 912-922
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2134376819
- Cited by
- 346
- References
- 16
- FWCI
- 21.96
- 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.