The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
An iterative multiuser decoder for near-capacity communications
Abstract
The combination of forward error correction (FEC) coding and random interleaving is shown to overcome the limitations of multiuser detectors/decoders when the user cross correlations are high. In particular, one can asymptotically achieve single-user performance in a highly correlated multiuser system. In addition, an optimal iterative multiuser detector is derived from iterative techniques for cross-entropy minimization. A practical suboptimal implementation of this algorithm is presented, and simulations demonstrate that, even with highly correlated users, it achieves optimal asymptotic efficiency. The effects of the theoretical limits on channel capacity are evident in many of the simulation results. The complexity of the suboptimal algorithm is approximately (O(2/sup K/)+O(2/sup /spl kappa//)) per bit per iteration where K is the number of users and /spl kappa/ is the code constraint length.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Multistage detection in asynchronous code-division multiple-access communications
Varanasi, M. K., & Aazhang, B. (1990) · IEEE Transactions on Communications · doi:10.1109/26.52662 · Cited by 1,259
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142
Properties of cross-entropy minimization
Shore, J., & Johnson, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056373 · Cited by 394
Contingency tables with given marginals
IRELAND, C. T., & KULLBACK, S. (1968) · Biometrika · doi:10.1093/biomet/55.1.179 · Cited by 370
Cited by
Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts
You, X., Wang, C.-X., Huang, J., Gao, X., Zhang, Z., Wang, M., Huang, Y., Zhang, C., Jiang, Y., Wang, J., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-2955-6 · Cited by 2,027
Spectral efficiency of CDMA with random spreading
Verdu, S., & Shamai, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749007 · Cited by 885
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
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
Metadata
- Authors
- Moher, M.
- Venue
- IEEE Transactions on Communications
- Published
- 1998-07
- Volume
- 46
- Issue
- 7
- Pages
- 870-880
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2102099405
- Cited by
- 360
- References
- 11
- FWCI
- 28.50
- 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: An iterative multiuser decoder for near-capacity communications. https://app.cochat.ai/papers/10.1109/26.701309
- The paper
- Moher, M. (1998). An iterative multiuser decoder for near-capacity communications. IEEE Transactions on Communications. https://doi.org/10.1109/26.701309
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.