Rake-based multiuser detection for quasi-synchronous SDMA systems

In this letter, a Rake-based multiuser detection technique, consisting of multiuser single-path signal separation, time-delay estimation, and multipath combining, is proposed for quasi-synchronous spatial-division multiple-access (SDMA) systems. Time diversity is achieved for performance improvement. In addition, only the upper bounds of the channel length and the time delays are required. Simulation results verify the effectiveness of the proposed technique, as well as its robustness against overestimation of the maximum channel length and the maximum time delay. © 2007 IEEE.published_or_final_versio

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

Intelligent genetic algorithms for next-generation broadband multi-carrier CDMA wireless networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This dissertation proposes a novel intelligent system architecture for next-generation broadband multi-carrier CDMA wireless networks. In our system, two novel and similar intelligent genetic algorithms, namely Minimum Distance guided GAs (MDGAs) are invented for both peak-to-average power ratio (PAPR) reduction at the transmitter side and multi-user detection (MUD) at the receiver side. Meanwhile, we derive a theoretical BER performance analysis for the proposed MC-CDMA system in A WGN channel. Our analytical results show that the theoretical BER performance of synchronized MC-CDMA system is the same as that of the synchronized DS-CDMA system which is also used as a theoretical guidance of our novel MUD receiver design. In contrast to traditional GAs, our MDGAs start with a balanced ratio of exploration and exploitation which is maintained throughout the process. In our algorithms, a new replacement strategy is designed which increases significantly the convergence rate and reduces dramatically computational complexity as compared to the conventional GAs. The simulation results demonstrate that, if compared to those schemes using exhaustive search and traditional GAs, (1) our MDGA-based P APR reduction scheme achieves 99.52% and 50+% reductions in computational complexity, respectively; (2) our MDGA-based MUD scheme achieves 99.54% and 50+% reductions in computational complexity, respectively. The use of one core MDGA solution for both issues can ease the hardware design and dramatically reduce the implementation cost in practice

High Capacity CDMA and Collaborative Techniques

The thesis investigates new approaches to increase the user capacity and improve the error performance of Code Division Multiple Access (CDMA) by employing adaptive interference cancellation and collaborative spreading and space diversity techniques. Collaborative Coding Multiple Access (CCMA) is also investigated as a separate technique and combined with CDMA. The advantages and shortcomings of CDMA and CCMA are analysed and new techniques for both the uplink and downlink are proposed and evaluated. Multiple access interference (MAI) problem in the uplink of CDMA is investigated first. The practical issues of multiuser detection (MUD) techniques are reviewed and a novel blind adaptive approach to interference cancellation (IC) is proposed. It exploits the constant modulus (CM) property of digital signals to blindly suppress interference during the despreading process and obtain amplitude estimation with minimum mean squared error for use in cancellation stages. Two new blind adaptive receiver designs employing successive and parallel interference cancellation architectures using the CM algorithm (CMA) referred to as ‘CMA-SIC’ and ‘BA-PIC’, respectively, are presented. These techniques have shown to offer near single user performance for large number of users. It is shown to increase the user capacity by approximately two fold compared with conventional IC receivers. The spectral efficiency analysis of the techniques based on output signal-to interference-and-noise ratio (SINR) also shows significant gain in data rate. Furthermore, an effective and low complexity blind adaptive subcarrier combining (BASC) technique using a simple gradient descent based algorithm is proposed for Multicarrier-CDMA. It suppresses MAI without any knowledge of channel amplitudes and allows large number of users compared with equal gain and maximum ratio combining techniques normally used in practice. New user collaborative schemes are proposed and analysed theoretically and by simulations in different channel conditions to achieve spatial diversity for uplink of CCMA and CDMA. First, a simple transmitter diversity and its equivalent user collaborative diversity techniques for CCMA are designed and analysed. Next, a new user collaborative scheme with successive interference cancellation for uplink of CDMA referred to as collaborative SIC (C-SIC) is investigated to reduce MAI and achieve improved diversity. To further improve the performance of C-SIC under high system loading conditions, Collaborative Blind Adaptive SIC (C-BASIC) scheme is proposed. It is shown to minimize the residual MAI, leading to improved user capacity and a more robust system. It is known that collaborative diversity schemes incur loss in throughput due to the need of orthogonal time/frequency slots for relaying source’s data. To address this problem, finally a novel near-unity-rate scheme also referred to as bandwidth efficient collaborative diversity (BECD) is proposed and evaluated for CDMA. Under this scheme, pairs of users share a single spreading sequence to exchange and forward their data employing a simple superposition or space-time encoding methods. At the receiver collaborative joint detection is performed to separate each paired users’ data. It is shown that the scheme can achieve full diversity gain at no extra bandwidth as inter-user channel SNR becomes high. A novel approach of ‘User Collaboration’ is introduced to increase the user capacity of CDMA for both the downlink and uplink. First, collaborative group spreading technique for the downlink of overloaded CDMA system is introduced. It allows the sharing of the same single spreading sequence for more than one user belonging to the same group. This technique is referred to as Collaborative Spreading CDMA downlink (CS-CDMA-DL). In this technique T-user collaborative coding is used for each group to form a composite codeword signal of the users and then a single orthogonal sequence is used for the group. At each user’s receiver, decoding of composite codeword is carried out to extract the user’s own information while maintaining a high SINR performance. To improve the bit error performance of CS-CDMA-DL in Rayleigh fading conditions, Collaborative Space-time Spreading (C-STS) technique is proposed by combining the collaborative coding multiple access and space-time coding principles. A new scheme for uplink of CDMA using the ‘User Collaboration’ approach, referred to as CS-CDMA-UL is presented next. When users’ channels are independent (uncorrelated), significantly higher user capacity can be achieved by grouping multiple users to share the same spreading sequence and performing MUD on per group basis followed by a low complexity ML decoding at the receiver. This approach has shown to support much higher number of users than the available sequences while also maintaining the low receiver complexity. For improved performance under highly correlated channel conditions, T-user collaborative coding is also investigated within the CS-CDMA-UL system

Intelligent genetic algorithms for next-generation broadband multi-carrier CDMA wireless networks

This dissertation proposes a novel intelligent system architecture for next-generation broadband multi-carrier CDMA wireless networks. In our system, two novel and similar intelligent genetic algorithms, namely Minimum Distance guided GAs (MDGAs) are invented for both peak-to-average power ratio (PAPR) reduction at the transmitter side and multi-user detection (MUD) at the receiver side. Meanwhile, we derive a theoretical BER performance analysis for the proposed MC-CDMA system in A WGN channel. Our analytical results show that the theoretical BER performance of synchronized MC-CDMA system is the same as that of the synchronized DS-CDMA system which is also used as a theoretical guidance of our novel MUD receiver design. In contrast to traditional GAs, our MDGAs start with a balanced ratio of exploration and exploitation which is maintained throughout the process. In our algorithms, a new replacement strategy is designed which increases significantly the convergence rate and reduces dramatically computational complexity as compared to the conventional GAs. The simulation results demonstrate that, if compared to those schemes using exhaustive search and traditional GAs, (1) our MDGA-based P APR reduction scheme achieves 99.52% and 50+% reductions in computational complexity, respectively; (2) our MDGA-based MUD scheme achieves 99.54% and 50+% reductions in computational complexity, respectively. The use of one core MDGA solution for both issues can ease the hardware design and dramatically reduce the implementation cost in practice.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Blind source separation for interference cancellation in CDMA systems

Communication is the science of "reliable" transfer of information between two parties, in the sense that the information reaches the intended party with as few errors as possible. Modern wireless systems have many interfering sources that hinder reliable communication. The performance of receivers severely deteriorates in the presence of unknown or unaccounted interference. The goal of a receiver is then to combat these sources of interference in a robust manner while trying to optimize the trade-off between gain and computational complexity. Conventional methods mitigate these sources of interference by taking into account all available information and at times seeking additional information e.g., channel characteristics, direction of arrival, etc. This usually costs bandwidth. This thesis examines the issue of developing mitigating algorithms that utilize as little as possible or no prior information about the nature of the interference. These methods are either semi-blind, in the former case, or blind in the latter case. Blind source separation (BSS) involves solving a source separation problem with very little prior information. A popular framework for solving the BSS problem is independent component analysis (ICA). This thesis combines techniques of ICA with conventional signal detection to cancel out unaccounted sources of interference. Combining an ICA element to standard techniques enables a robust and computationally efficient structure. This thesis proposes switching techniques based on BSS/ICA effectively to combat interference. Additionally, a structure based on a generalized framework termed as denoising source separation (DSS) is presented. In cases where more information is known about the nature of interference, it is natural to incorporate this knowledge in the separation process, so finally this thesis looks at the issue of using some prior knowledge in these techniques. In the simple case, the advantage of using priors should at least lead to faster algorithms.reviewe

Space time transceiver design over multipath fading channels

Imperial Users onl

Coded transmit diversity in CDMA over Nakagami-m fading channels

With applications such as video conferencing, extensive web browsing and live video streaming, future wireless systems become extremely demanding in terms of high data rates and improved signal quality. In this thesis the performance of a space-time spreading transmit diversity scheme is examined over a frequency-flat Nakagami- m fading channel. The Nakagami- m channel model is considered as it is well known for modeling signal fading conditions ranging from severe to moderate, to light fading or no fading, through its parameter m. We also propose in this thesis a coded transmit diversity scheme which is based on a combination of a convolutional code with a space-time transmit diversity scheme that uses direct-sequence code division multiple access (DS-CDMA) for multiuser access. Our focus will be on the uplink of the communication system. The space-time scheme employs N = 2 and N r antennas at the mobile station (MS) side and at the base station (BS) side respectively. DS-CDMA is used to support many users and a linear decorrelator detector is used to combat the effect of multiuser interference. We study the performance of both the uncoded and coded transmit diversity schemes over slow fading and fast fading channels. In all cases, the investigations start by determining the probability density function (PDF) of the signal to interference and noise ratio at the output of the space-time combiner at the BS receiver side. Using this PDF we derive a closed-form (or an approximation) expression for the bit error rate (BER) of the system under consideration. The accuracy of the PDF and BER expressions are verified when compared to simulation results for different values of the fading figure m and for different combinations of transmit and receive antennas. In the case of the coded space-time transmit diversity scheme, the pairwise error probability and the corresponding BER upper bounds are obtained for fast and slow fading channels. The derived error bounds, when compared to system simulations, are shown to be tight at high signal-to-noise ratios. Furthermore, our analytical results explicitly show the achieved system diversity in terms of the number of transmit and receive antennas and the fading figure m. When the coded space-time scheme is considered, its diversity is shown to be a function of the minimum free distance d free of the convolutional code used. Furthermore we show that the diversity of the different schemes considered is always independent of the system loa