Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Robust multiuser detection using Kalman filter and windowed projection approximation subspace tracking algorithm

Robust multiuser detection using Kalman filter and windowed projection approximation subspace tracking algorithm

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors propose some robust adaptive multiuser detection schemes for direct-sequence code-division multiple-access multipath frequency-selective fading channels. Multiple access interference (MAI) and intersymbol interference (ISI) are presented in an identical format using expanded signal subspace, which facilitates multiuser detection in a symbol-by-symbol fashion. This study contributes to the theoretical aspect of adaptive multiuser detection by proving that the optimum linear multiuser detectors that achieve maximum signal-to-interference-plus-noise ratio (SINR) must exist in the signal subspace, and the theoretic SINR upper bound is also derived. Another contribution of this study is to propose the design of multiuser detectors in an expanded signal subspace, and introduce subspace estimation and Kalman filtering algorithms for their adaptive implementation. To robustify the adaptive detectors against subspace estimation and channel estimation errors, a modified projection approximation subspace tracking (PAST) algorithm is proposed for subspace tracking. It is demonstrated by simulations that these adaptive detectors effectively suppress both MAI and ISI and converge to the optimum SINR. They are robust against subspace estimation errors and channel estimation errors compared to the conventional Wiener minimum mean square error (MMSE) detector.

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • J.G. Proakis . (1995) Digital communications.
    6. 6)
      • Maurer, J., Jalden, J., Matz, G.: `Multi-threshold TOP-full-diversity vector perturbation precoding with finite-rate feedforward', Proc. Asilomar Conf. Signals, Systems Computers, 2008, p. 428–432.
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • S. Verdu . (1988) Multiuser detection.
    13. 13)
      • Chen, W., Mitra, U.: `Frequency domain versus time domain-based training sequence optimization', Proc. IEEE ICC, 2000, 2, p. 646–650.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • S. Haykin . (1996) Adaptive filter theory.
    18. 18)
    19. 19)
      • Ozen, S., Zoltowski, M., Fimoff, M.: `A novel channel estimation method: blending correlation and least-squares based approaches', Proc. ICASSP, 2002, 3, p. 2281–84.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0566
Loading

Related content

content/journals/10.1049/iet-com.2009.0566
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address