In this thesis, the problem of multiple access interference (MAI) suppression for the multi-carrier (MC) code division multiple access (CDMA) system, based on the wavelet-based (WB) multi-carrier modulation, associated with the combining process is investigated for Rayleigh fading channel. The main concern of this thesis is to derive a new scheme, based on the linearly constrained constant modulus (LCCM) criterion with the robust inverse QR decomposition (IQRD) recursive least squares (RLS) algorithm to improve the performance of the conventional MC-CDMA system with combining process. To verify the merits of the new algorithm, the effect due to imperfect channel parameters estimation and frequency offset are investigated.
We show that the proposed robust LCCM IQRD-RLS algorithm outperforms the conventional LCCM-gradient algorithm [6], in terms of output SINR, improvement percentage index (IPI), and bit error rate (BER) for MAI suppression under channel mismatch environment. Also, the performance of the WB MC-CDMA system is superior to the one with conventional MC-CDMA system. It is more robust to the channel mismatch and frequency offset. Moreover, the WB MC-CDMA system with robust LCCM IQRD-RLS algorithm does have better performance over other conventional approaches, such as the LCCM-gradient algorithm, maximum ratio combining (MRC), blind adaptation algorithm and partitioned linear interference canceller (PLIC) approach with LMS algorithm, in terms of the capability of MAI suppression and bit error rate (BER).
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0707102-195820 |
| Date | 07 July 2002 |
| Creators | Liu, Hsiao-Chen |
| Contributors | Yang, Hsin-Hsyong Richard, Rung-Hung Gau, Gin-Kou Ma, HAO MIIN-JONG, Shiunn-Jang Chern |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707102-195820 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0018 seconds