Signal processing techniques such as multi user detection (MUD) have the capability of greatly enhancing the performance and capacity of future generation wireless communications systems. Blind adaptive MUD's have many favourable qualities and their application to OS-COMA systems has attracted a lot of attention. The constant modulus algorithm is widely deployed in blind channel equalizations applications. The central premise of this thesis is that the constant modulus cost function is very suitable for the purposes of blind adaptive MUD for future generation wireless communications systems. To prove this point, the adaptive performance of blind (and non-blind) adaptive MUD's is derived analytically for all the schemes that can be made to fit the same generic structure as the constant modulus scheme. For the first time, both the relative and absolute performance levels of the different adaptive algorithms are computed, which gives insights into the performance levels of the different blind adaptive MUD schemes, and demonstrates the merit of the constant modulus based schemes. The adaptive performance of the blind adaptive MUD's is quantified using the excess mean square error (EMSE) as a metric, and is derived for the steady-state, tracking, and transient stages of the adaptive algorithms. If constant modulus based MUD's are suitable for future generation wireless communications systems, then they should also be capable of suppressing multi-rate DS-COMA interference and also demonstrate the ability to suppress narrow band interference (NBI) that arises in overlay systems. Multi-rate DS-COMA provides the capability of transmitting at various bit rates and quality of service levels over the same air interface. Limited spectrum availability may lead to the implementation of overlay systems whereby wide-band COMA signal are collocated with existing narrow band services. Both overlay systems and multi-rate DS-COMA are important features of future generation wireless communications systems. The interference patterns generated by both multi-rate OS-COMA and digital NBI are cyclostationary (or periodically time varying) and traditional MUD techniques do not take this into account and are thus suboptimal. Cyclic MUD's, although suboptimal, do however take the cyclostationarity of the interference into account, but to date there have been no cyclic MUD's based on the constant modulus cost function proposed. This thesis thus derives novel, blind adaptive, cyclic MUD's based on the constant modulus cost function, for direct implementation on the FREquency SHift (FRESH) filter architecture. The FRESH architecture provides a modular and thus flexible implementation (in terms of computational complexity) of a periodically time varying filter. The operation of the blind adaptive MUD on these reduced complexity architectures is also explored.ยท The robustness of the new cyclic MUD is proven via a rigorous mathematical proof. An alternate architecture to the FRESH filter is the filter bank. Using the previously derived analytical framework for the adaptive performance of MUD's, the relative performance of the adaptive algorithms on the FRESH and filter bank architectures is examined. Prior to this thesis, no conclusions could be drawn as to which architecture would yield superior performance. The performance analysis of the adaptive algorithms is also extended in this thesis in order to consider the effects of timing jitrer at the receiver, signature waveform mismatch, and other pertinent issues that arise in realistic implementation scenarios. Thus, through a careful analytical approach, which is verified by computer simulation results, the suitability of constant modulus based MUD's is established in this thesis. / Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2004.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:ukzn/oai:http://researchspace.ukzn.ac.za:10413/4330 |
| Date | January 2004 |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0078 seconds