This is the authors' abstract. We don't add key points for this paper.
A code‐division multiple‐access system with channel coding may be viewed as a serially‐concatenated coded system. In this paper we propose a low complexity method for decoding the resulting inner code (due to the spreading sequence), which allows iterative (turbo) decoding of the serially‐concatenated code pair. The per‐bit complexity of the proposed decoder increases only linearly with the number of users. Performance within a fraction of a dB of the single user bound for heavily loaded asynchronous CDMA is shown both by simulation and analytically.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Alexander et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: