Low complexity iterative receiver for downlink MC-CDMA system in Doppler channels

被引:1
|
作者
Thiagarajan, L. B. [1 ]
Liang, Y. -C. [1 ]
Attallah, S. [2 ]
机构
[1] Inst Infocomm Res, 21 Heng Mui Keng Terrace, Singapore 119613, Singapore
[2] SIM Univ, Sch Sci & Technol, Singapore 599491, Singapore
关键词
channel estimation; iterative processing; interference mitigation; equalization; MC-CDMA; downlink; multi-user detection;
D O I
10.1109/VETECS.2008.159
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Block Iterative - Generalized Decision Feedback Equalizer (BI-GDFE) is an iterative receiver using previously made hard decisions to cancel out the multiple access interference (MAI) and inter-symbol interference (ISI). In this paper, we formulate the BI-GDFE for downlink multi-carrier code division multiple access (MC-CDMA) system under time varying channel conditions. The time varying coefficients of each channel tap over a data block is a finite length sequence whose maximum bandwidth depends on the Doppler bandwidth. This sequence can be represented using basis expansion models proposed for time varying channels. In this paper, Slepian basis expansion is used because the number of basis vectors required to represent the time varying channel is less compared with other basis expansion models and hence the number of parameters to be estimated is less. Thus less number of pilot symbols are required for channel estimation. BI-GDFE for fully loaded downlink MC-CDMA system can be formulated as a one-tap equalizer which is simple for implementation. Furthermore, the computation of the signal to interference noise ratio (SINR) value for each iteration of BI-GDFE can be simplified using matrix manipulations for the downlink MC-CDMA system. Computer simulations show that the BER performance of BI-GDFE with channel estimation is close to the single user matched filter bound (MFB).
引用
收藏
页码:724 / +
页数:2
相关论文
共 50 条
  • [1] A low-complexity iterative multiuser receiver for turbo-coded MC-CDMA system
    Kafle, PL
    Sesay, AB
    [J]. IEEE 55TH VEHICULAR TECHNOLOGY CONFERENCE, VTC SPRING 2002, VOLS 1-4, PROCEEDINGS, 2002, : 1714 - 1718
  • [2] LOW COMPLEXITY MMSE CHANNEL ESTIMATOR FOR DOWNLINK MC-CDMA SYSTEM
    Suyan, Nitin Kumar
    Saini, Garima
    [J]. PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INVENTIVE SYSTEMS AND CONTROL (ICISC 2018), 2018, : 706 - 709
  • [3] Receiver design for spatially layered downlink MC-CDMA system
    Vehkaperä, M
    Tujkovic, D
    Li, ZX
    Juntti, M
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2005, 54 (03) : 1042 - 1055
  • [4] Asymptotic analysis of the multiuser MMSE receiver for the downlink of a MC-CDMA system
    Jallon, P
    des Noes, M
    Ktenas, D
    Brossier, JM
    [J]. 57TH IEEE VEHICULAR TECHNOLOGY CONFERENCE, VTC 2003-SPRING, VOLS 1-4, PROCEEDINGS, 2003, : 363 - 367
  • [5] Linear Equalization for Multicode MC-CDMA Downlink Channels
    Rugini, Luca
    [J]. IEEE COMMUNICATIONS LETTERS, 2012, 16 (09) : 1353 - 1356
  • [6] Spatial multiplexed coded MC-CDMA with iterative receiver
    Bouvet, PJ
    Le Nir, V
    Hélard, M
    Le Gouable, R
    [J]. 2004 IEEE 15TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 801 - 804
  • [7] A novel OSSMIC receiver for downlink MIMO MC-CDMA systems
    Phasouliotis, Antonis
    So, Daniel K. C.
    [J]. 2008 IEEE 67TH VEHICULAR TECHNOLOGY CONFERENCE-SPRING, VOLS 1-7, 2008, : 1271 - 1275
  • [8] SAGE Based Suboptimal Receiver for Downlink MC-CDMA Systems
    Kabaoglu, Nihat
    [J]. IEEE COMMUNICATIONS LETTERS, 2011, 15 (12) : 1381 - 1383
  • [9] A Low Complexity Receiver Phase Rotated Conjugate Cancellation for ICI Reduction using Iterative ML Algorithm in MC-CDMA system
    Chitra, S.
    Kumaratharan, N.
    [J]. PROCEEDINGS OF THE 2013 8TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION (ICCSE 2013), 2013, : 864 - 869
  • [10] A low power architecture for a MC-CDMA receiver
    Hasan, M
    Arslan, T
    Thompson, JS
    [J]. IETE JOURNAL OF RESEARCH, 2005, 51 (06) : 459 - 467