The direct-sequence code division multiple access (DS-CDMA) is one of the significant techniques for wireless communication systems with multiple simultaneous transmissions. The main concern of this thesis is to propose a new linearly constrained constant modulus modified conjugate gradient (LCCM-MCG) adaptive filtering algorithm to deal with problem of channel mismatch associated with the multiple access interference (MAI) in DS-CDMA system over multipath fading channel. In fact, the adaptive filtering algorithm based on the CM criterion is known to be very attractive for the case when the channel parameters are not estimated perfectly. The proposed LCCM-MCG algorithm is derived based on the so-called generalized sidelobe canceller (GSC). It has the advantage of having better stability and less computational complexity compared with conventional recursive least-squares (RLS) algorithm, and can be used to achieve desired performance for multiuser RAKE receiver. Moreover, with the MCG algorithm it requires only one recursive iteration per incoming sample data for updating the weight vector, but still maintains performance comparable to the RLS algorithm. From computer simulation results, we show that the proposed LCCM-MCG algorithm has fast convergence rate and could be used to circumvent the effect due to channel mismatch. Also, the performance, in terms of bit error rate (BER), is quite close to the LCCM-RLS algorithm suggested in [18], and is superior to the stochastic gradient descent (SGD) algorithm proposed in [7].
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0704103-002922 |
| Date | 04 July 2003 |
| Creators | Wang, Sheng-Meng |
| Contributors | Ju-Ya Chen, Gin-Kou Ma, Shiunn-Jang Chern, Min-Jong Hao |
| 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-0704103-002922 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0016 seconds