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

Efficient multi-user detection scheme for overloaded group-orthogonal MC-CDMA systems

Efficient multi-user detection scheme for overloaded group-orthogonal MC-CDMA systems

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.

An efficient multi-user detection scheme for overloaded MC-CDMA systems is presented. The proposed detection scheme for overloaded systems achieves the optimal performance for constant-modulus modulation schemes, for example MPSK, and provides near-optimal performance for non-constant-modulus modulation, for example M-QAM. Moreover, it has overall lower complexity than the other optimal detection algorithms, especially suitable for group-orthogonal MC-CDMA systems, where group-based technique keeps multi-user receiver size relatively small.

References

    1. 1)
      • B. Hassibi , H. Vikalo . On the sphere decoding algorithm. Part I: the expected complexity. IEEE Trans. Signal Process. , 8 , 2806 - 2818
    2. 2)
      • Boutros, J., Gresset, N., Brunel, L.: `Soft-input soft-output lattice sphere decoder for linear channels', IEEE Globecom, 2003, p. 1583–1587.
    3. 3)
      • M. Damen , K.A. Meraim , J.C. Belfiore . Generalised sphere decoder for asymmetrical space–time communication architecture. Electron. Lett. , 2 , 166 - 167
    4. 4)
      • Xu, Y.L., Weng, J.F., Le-Ngoc, T.: `Adaptive tone diversity for OFDMA in broadband wireless communications', VTC2004-Spring, 17–19 May 2004, Milan, Italy.
    5. 5)
      • Xu, Y.L., Weng, J.F., Le-Ngoc, T.: `Group-orthogonal OFDMA in fast time-varying frequency-selective fading environments', VTC2004-Fall, 26–29 September 2004, LA.
    6. 6)
      • Wang, P., Le-Ngoc, T.: `A low complexity generalized sphere decoding approach for underdetermined MIMO systems', IEEE ICC2006, 11–15 June 2006, Istanbul, Turkey.
    7. 7)
      • Erceg, V., Hari, K.V.S., Smith, M.S.: `Channel models for fixed wireless applications', IEEE 802.16.3c-01/29r4, July 2001.
    8. 8)
      • L. Brunel . Multiuser detection techniques using maximum likelihood sphere decoding in multicarrier CDMA systems. IEEE Trans. Wirel. Commun. , 3 , 949 - 957
    9. 9)
      • Wang, P., Le-Ngoc, T.: `On the expected complexity analysis of a generalized sphere decoding algorithm for underdetermined linear communication systems', IEEE ICC2007, 24–28 June 2007, Glasgow, UK.
    10. 10)
      • X. Cai , S. Zhou , G.B. Giannakis . Group-orthogonal multicarrier CDMA. IEEE Trans. Commun. , 1 , 90 - 99
    11. 11)
      • M.O. Damen , H.E. Gamal , G. Caire . On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans. Inf. Theory , 10 , 2389 - 2402
    12. 12)
      • Z. Yang , C. Liu , J. He . A new approach for fast generalized sphere decoding in MIMO systems. IEEE Signal Process. Lett. , 1 , 41 - 44
    13. 13)
      • B. Natarajan , Z. Wu , C.R. Nassar . Large set of CI spreading codes for high-capacity MC-CDMA. IEEE Trans. Commun. , 11 , 1862 - 1866
    14. 14)
      • Dayal, P., Varanasi, M.K.: `A fast generalized sphere decoder for optimum decoding of under-determined MIMO systems', Annual Allerton Conf. Communication, Control and Computing, October 2003.
    15. 15)
      • Y.L. Xu , J.F. Weng , T. Le-Ngoc . Tone diversity for OFDMA in broadband wireless communications. Wirel. Commun. Mob. Comput. , 717 - 728
    16. 16)
      • Djonion, D.V., Bhargava, V.K.: `New results on low complexity detectors for over-saturated CDMA systems', IEEE Globecom 01, 2001.
    17. 17)
      • A. Kapur , M.K. Varanasi . Multiuser detection for overloaded CDMA systems. IEEE Trans. Inf. Theory , 7 , 1728 - 1742
    18. 18)
      • E. Arell , T. Eriksson , A. Vardy , K. Zeger . Closet point search in lattices. IEEE Trans. Inf. Theory , 8 , 2201 - 2214
    19. 19)
      • Wiesel, A., Mestre, X., Pages, A.: `Efficient implementation of sphere demodulation', 2003 4th Workshop on Signal Processing, 2003, p. 36–40.
    20. 20)
      • H. Artes , D. Seethaler , F. Hlawatsch . Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection. IEEE Trans. Signal Process. , 11 , 2808 - 2820
    21. 21)
      • J. Jaldén , B. Ottersten . On the complexity of sphere decoding in digital communications. IEEE Trans. Signal Process. , 4 , 1474 - 1484
    22. 22)
      • Cui, T., Tellambura, C.: `An efficient generalized sphere decoder for rank-deficient MIMO systems', IEEE VTC 04-Fall, 2004.
    23. 23)
      • J. Weng , T. Le-Ngoc , Y.L. Xu . ZCZ–CDMA and OFDMA using M-QAM for broadband wireless communications. Wirel. Commun. Mob. Comput. J. , 427 - 438
    24. 24)
      • H. Vikalo , B. Hassibi . On the sphere decoding algorithm. Part II: generalizations, second-order statistics, and applications to communications. IEEE Trans. Signal Process. , 8 , 2819 - 2834
    25. 25)
      • Chan, A.M., Lee, I.: `A new reduced-complexity sphere decoder for multiple antenna systems', IEEE ICC 2002, 2002, 1, p. 460–464.
    26. 26)
      • J. Luo , K.R. Pattipati , P. Willett , G.M. Levchuk . Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound. IEEE Trans. Commun. , 4 , 632 - 642
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20070304
Loading

Related content

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