Reduced Complexity Turbo Detection for Coded DS-CDMA Systems Employing BPSK Modulations (original) (raw)
2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
Related papers
2004
We propose an iterative multiuser detector for turbo-coded synchronous and asynchronous direct-sequence CDMA (DS-CDMA) systems. The receiver is derived from the maximum a posteriori (MAP) estimation of the single user’s transmitted data, conditioned on information about the estimate of the multiple-access interference (MAI) and the received signal from the channel. This multiple-access interference is reconstructed by making hard decisions on the users ’ detected bits at the preceding iteration. The complexity of the proposed receiver increases linearly with the number of users. The proposed detection scheme is compared with a previously developed one. The multiuser detector proposed in this paper has a better performance when the transmitted powers of all active users are equal in the additive white Gaussian noise (AWGN) channel. Also, the detector is found to be resilient against the near-far effect.
On the complexity reduction of turbo decoding for wideband CDMA
2005
Abstract Two simple but effective methods for reducing the average complexity (and power consumption) of the conventional turbo-cyclic-redundancy-check decoding scheme with negligible performance degradation in a wideband direct-sequence code-division multiple-access (W-CDMA) environment are introduced. When applied to a W-CDMA turbo code with frame length 640 b at a bit-error rate (BER) of 10-6, the resultant modified schemes can save up to 73% of the average decoding complexity, relative to the conventional scheme.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.