Interference Cancelation in Coherent CDMA Systems Using Parallel Iterative Algorithms

Statistics – Applications

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 3 figures, 2 tables, conference

Scientific paper

Least mean square-partial parallel interference cancelation (LMS-PPIC) is a partial interference cancelation using adaptive multistage structure in which the normalized least mean square (NLMS) adaptive algorithm is engaged to obtain the cancelation weights. The performance of the NLMS algorithm is mostly dependent to its step-size. A fixed and non-optimized step-size causes the propagation of error from one stage to the next one. When all user channels are balanced, the unit magnitude is the principal property of the cancelation weight elements. Based on this fact and using a set of NLMS algorithms with different step-sizes, the parallel LMS-PPIC (PLMS-PPIC) method is proposed. In each iteration of the algorithm, the parameter estimate of the NLMS algorithm is chosen to match the elements' magnitudes of the cancelation weight estimate with unity. Simulation results are given to compare the performance of our method with the LMS-PPIC algorithm in three cases: balanced channel, unbalanced channel and time varying channel.

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

Interference Cancelation in Coherent CDMA Systems Using Parallel Iterative Algorithms 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 Interference Cancelation in Coherent CDMA Systems Using Parallel Iterative Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Cancelation in Coherent CDMA Systems Using Parallel Iterative Algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-455661

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