43 research outputs found
Adaptive parallel interference cancellation receivers with diversity combining for multicarrier DS CDMA systems
Master'sMASTER OF ENGINEERIN
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
Cyclic Prefix-Free MC-CDMA Arrayed MIMO Communication Systems
The objective of this thesis is to investigate MC-CDMA MIMO systems where
the antenna array geometry is taken into consideration. In most MC-CDMA
systems, cyclic pre xes, which reduce the spectral e¢ ciency, are used. In order
to improve the spectral efficiency, this research study is focused on cyclic pre x-
free MC-CDMA MIMO architectures.
Initially, space-time wireless channel models are developed by considering the
spatio-temporal mechanisms of the radio channel, such as multipath propaga-
tion. The spatio-temporal channel models are based on the concept of the array
manifold vector, which enables the parametric modelling of the channel.
The array manifold vector is extended to the multi-carrier space-time array
(MC-STAR) manifold matrix which enables the use of spatio-temporal signal
processing techniques. Based on the modelling, a new cyclic pre x-free MC-
CDMA arrayed MIMO communication system is proposed and its performance
is compared with a representative existing system. Furthermore, a MUSIC-type
algorithm is then developed for the estimation of the channel parameters of the
received signal.
This proposed cyclic pre x-free MC-CDMA arrayed MIMO system is then
extended to consider the effects of spatial diffusion in the wireless channel. Spatial
diffusion is an important channel impairment which is often ignored and the
failure to consider such effects leads to less than satisfactory performance. A
subspace-based approach is proposed for the estimation of the channel parameters
and spatial spread and reception of the desired signal.
Finally, the problem of joint optimization of the transmit and receive beam-
forming weights in the downlink of a cyclic pre x-free MC-CDMA arrayed MIMO
communication system is investigated. A subcarrier-cooperative approach is used
for the transmit beamforming so that there is greater flexibility in the allocation
of channel symbols. The resulting optimization problem, with a per-antenna
transmit power constraint, is solved by the Lagrange multiplier method and an
iterative algorithm is proposed
Improved decoder metrics for DS-CDMA in practical 3G systems
While 4G mobile networks have been deployed since 2008. In several of the more developed markets, 3G mobile networks are still growing with 3G having the largest market -in terms of number of users- by 2019. 3G networks are based on Direct- Sequence Code-Division Multiple-Access (DS-CDMA). DS-CDMA suffers mainly from the Multiple Access Interference (MAI) and fading. Multi-User Detectors (MUDs) and Error Correcting Codes (ECCs) are the primary means to combat MAI and fading. MUDs, however, suffer from high complexity, including most of sub-optimal algorithms. Hence, most commercial implementations still use conventional single-user matched filter detectors. This thesis proposes improved channel decoder metrics for enhancing uplink performance in 3G systems. The basic idea is to model the MAI as conditionally Gaussian, instead of Gaussian, conditioned on the users’ cross-correlations and/or the channel fading coefficients. The conditioning implies a time-dependent variance that provides enhanced reliability estimates at the decoder inputs. We derive improved log-likelihood ratios (ILLRs) for bit- and chip- asynchronous multipath fading channels. We show that while utilizing knowledge of all users’ code sequences for the ILLR metric is very complicated in chip-asynchronous reception, a simplified expression relying on truncated group delay results in negligible performance loss. We also derive an expression for the error probability using the standard Gaussian approximation for asynchronous channels for the widely used raised cosine pule shaping. Our study framework considers practical 3G systems, with finite interleaving, correlated multipath fading channel models, practical pulse shaping, and system parameters obtained from CDMA2000 standard. Our results show that for the fully practical cellular uplink channel, the performance advantage due to ILLRs is significant and approaches 3 dB
On the performance and capacity of space-time block coded multicarrier CDMA communication systems
Ph.DDOCTOR OF PHILOSOPH
Recommended from our members
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
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