Low Complexity Joint Iterative Equalization and Multiuser Detection in Dispersive DS-CDMA Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in IEEE Transactions on Wireless Communications

Scientific paper

Communications in dispersive direct-sequence code-division multiple-access (DS-CDMA) channels suffer from intersymbol and multiple-access interference, which can significantly impair performance. Joint maximum \textit{a posteriori} probability (MAP) equalization and multiuser detection with error control decoding can be used to mitigate this interference and to achieve the optimal bit error rate. Unfortunately, such optimal detection typically requires prohibitive computational complexity. This problem is addressed in this paper through the development of a reduced state trellis search detection algorithm, based on decision feedback from channel decoders. The performance of this algorithm is analyzed in the large-system limit. This analysis and simulations show that this low-complexity algorithm can obtain near-optimal performance under moderate signal-to-noise ratio and attains larger system load capacity than parallel interference cancellation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Low Complexity Joint Iterative Equalization and Multiuser Detection in Dispersive DS-CDMA Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low Complexity Joint Iterative Equalization and Multiuser Detection in Dispersive DS-CDMA Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low Complexity Joint Iterative Equalization and Multiuser Detection in Dispersive DS-CDMA Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-593481

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.