Capacity of CDMA system is limited to interference due to other users. System performance is degraded by near-far problem when undesired users are closer to base station. Beside, the channel parameters could not be estimated perfectly at receiver, refer to as mismatch problem, which would also degrade the system performance.
We would like to consider the MAI and near-far interference cancellation by adaptive linear constraint algorithms to implement linear constraint minimum variance (LCMV) approach. To exploit the linearly constrained filtering, the structure of the generalized side-lobe canceller (GSC) has been employed, where the constrained problem is converted into an unconstrained form with fewer parameters. GSC structure is an indirect but simpler implementation of LCMV algorithm. Moreover, it is also known that the constant modulus (CM) criteria has advantage to combat the channel mismatch, and the performance of the adaptive constraint algorithm based on CM criteria will be investigate.
In this thesis, we will derive a new GSC-IQRD-RLS algorithm to combat MAI and near-far problems by combining LC-IQRD-RLS algorithm [1][5] and GSC structure [17]; and prove that the GSC and LC structures based IQRD-RLS algorithms are equivalent, which means that the good performance of LC-IQRD-RLS algorithm can be achieved by a simpler GSC structure algorithm. We will also derive a new GSC-CM-IQRD-RLS algorithm to improve the system performance under mismatch problem by combining CM criteria [20] and GSC-IQRD-RLS algorithm.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0704103-002227 |
| Date | 04 July 2003 |
| Creators | Tu, Jhen-Ji |
| Contributors | Min-Jong Hao, Ju-Ya Chen, Gin-Kou Ma, 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-0704103-002227 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0024 seconds