The University of Southampton
University of Southampton Institutional Repository

Multiple access interference cancellation for CDMA

Multiple access interference cancellation for CDMA
Multiple access interference cancellation for CDMA

The application of multiple access interference cancellation techniques to improve the performance of code division multiple access (CDMA) mobile radio systems is addressed. The discourse commences by describing the present mobile radio scene with emphasis on the evolutionary paths towards third generation cellular systems. This is followed by a brief review of the mobile radio channels. Next we examine the multi-stage parallel cancellation (MSPC) scheme, the zero forcing (ZF) scheme and the zero forcing with decision feedback (ZF-DF) scheme for overcoming the basic limitations of the conventional CDMA scheme that employs single user matched filter detection. From analysis and simulation, these enhanced CDMA detection schemes are found to have inherent limitations, particularly, when the number of active users approaches the processing gain N.

We then determine analytically and by simulations the performance of a successive serial parallel cancellation (SSPC) CDMA scheme in the presence of flat Rayleigh fading up-link asynchronous channels. The scheme is shown to have the potential to reach the single user bound without the use of FEC coding and close-loop power control, with the proviso that sufficiently accurate channel estimates are available for both signal ranking and regeneration. Using the performance criterion of average bit error rate, the SSPC scheme is compared with the MSPC, ZF and ZF-DF detection schemes, and found to be superior for different numbers of active users. Similarly, the computational complexity requirement of the SSPC scheme is found to be lower than the ZF and ZF-DF schemes. An adaptive technique to reduce the processing delay in the serial stage is also proposed. We also investigate the performance of the SSPC scheme using RAKE receivers and having perfect channel estimation when operating in two-path frequency selective Rayleigh channels. The analytical and simulation results show that the SSPC scheme performs equally well when compared to operation in flat Rayleigh fading channels. At this junction our results mostly rely on the assumption of perfect channel estimation. To overcome this limitation we examined a robust channel estimation technique, namely the maximum likelihood channel estimation (MLCE) scheme, for coherent, up-link transmissions.

University of Southampton
Oon, Tik Bin
Oon, Tik Bin

Oon, Tik Bin (1998) Multiple access interference cancellation for CDMA. University of Southampton, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

The application of multiple access interference cancellation techniques to improve the performance of code division multiple access (CDMA) mobile radio systems is addressed. The discourse commences by describing the present mobile radio scene with emphasis on the evolutionary paths towards third generation cellular systems. This is followed by a brief review of the mobile radio channels. Next we examine the multi-stage parallel cancellation (MSPC) scheme, the zero forcing (ZF) scheme and the zero forcing with decision feedback (ZF-DF) scheme for overcoming the basic limitations of the conventional CDMA scheme that employs single user matched filter detection. From analysis and simulation, these enhanced CDMA detection schemes are found to have inherent limitations, particularly, when the number of active users approaches the processing gain N.

We then determine analytically and by simulations the performance of a successive serial parallel cancellation (SSPC) CDMA scheme in the presence of flat Rayleigh fading up-link asynchronous channels. The scheme is shown to have the potential to reach the single user bound without the use of FEC coding and close-loop power control, with the proviso that sufficiently accurate channel estimates are available for both signal ranking and regeneration. Using the performance criterion of average bit error rate, the SSPC scheme is compared with the MSPC, ZF and ZF-DF detection schemes, and found to be superior for different numbers of active users. Similarly, the computational complexity requirement of the SSPC scheme is found to be lower than the ZF and ZF-DF schemes. An adaptive technique to reduce the processing delay in the serial stage is also proposed. We also investigate the performance of the SSPC scheme using RAKE receivers and having perfect channel estimation when operating in two-path frequency selective Rayleigh channels. The analytical and simulation results show that the SSPC scheme performs equally well when compared to operation in flat Rayleigh fading channels. At this junction our results mostly rely on the assumption of perfect channel estimation. To overcome this limitation we examined a robust channel estimation technique, namely the maximum likelihood channel estimation (MLCE) scheme, for coherent, up-link transmissions.

This record has no associated files available for download.

More information

Published date: 1998

Identifiers

Local EPrints ID: 463088
URI: http://eprints.soton.ac.uk/id/eprint/463088
PURE UUID: 3d3ae32a-0c71-4230-b27a-b8659e84cbc5

Catalogue record

Date deposited: 04 Jul 2022 20:44
Last modified: 04 Jul 2022 20:44

Export record

Contributors

Author: Tik Bin Oon

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×