Non-Linear Fuzzy Receivers for DS-CDMA Communication System

Direct sequence-code division multiple access (DS-CDMA) technique is used in cellular systems where users in the cell are separated from each other with their unique spreading codes. In recent times DS-CDMA has been used extensively. These systems suffers from multiple access interference (MAI) due to other users transmitting in the cell, channel inter symbol interference (ISI) due to multipath nature of channels in presence of additive white Gaussian noise (AWGN). This thesis presents an investigation on design of fuzzy based receivers for DS-CDMA system. Fuzzy based receiver has been proposed to work as chip level based (CLB) receivers and also multi user detection (MUD) receivers. It is seen that fuzzy receiver is capable of providing performance close to optimal radial basis function (RBF) receivers and provide considerable computational complexity reduction. Extensive simulation studies demonstrate the performance of the fuzzy receivers and the performance have been compared with RAKE receiver, matched filter (MF) receiver, minimum mean square error (MMSE) receiver and RBF receiver

Nonlinear receivers for DS-CDMA

The growing demand for capacity in wireless communications is the driving force behind improving established networks and the deployment of a new worldwide mobile standard. Capacity calculations show that the direct sequence code division multiple access (DS-CDMA) technique has more capacity than the time division multiple access technique. Therefore, most 3rd generation mobile systems will incorporate some sort of DS-CDMA. In this thesis DS-CDMA receiver structures are investigated from the view point of pattern recognition which leads to new DS-CDMA receiver structures. It is known that the optimum DS-CDMA receiver has a nonlinear structure with prohibitive complexity for practical implementation. It is also known that the currently implemented receiver in 2nd generation DSCDMA mobile handsets has poor performance, because it suffers from multiuser interference. Consequently, this work focuses on sub-optimum nonlinear receivers for DS-CDMA in the downlink scenario. First, the thesis reviews DS-CDMA, established equalisers, DS-CDMA receivers and pattern recognition techniques. Then the new receivers are proposed. It is shown that DS-CDMA can be considered as a pattern recognition problem and hence, pattern recognition techniques can be exploited in order to develop DS-CDMA receivers. Another approach is to apply known equaliser structures for DS-CDMA. One proposed receiver is based on the Volterra series expansion and processes the received signal at the chip rate. Another receiver is a symbol rate radial basis function network (RBFN) receiver with reduced complexity. Subsequently, a receiver is proposed based on linear programming (LP) which is especially tailored for nonlinearly separable scenarios. The LP based receiver performance is equivalent to the known decorrelating detector in linearly separable scenarios. Finally, a hybrid receiver is proposed which combines LP and RBFN and which exploits knowledge gained from pattern recognition. This structure has lower complexity than the full RBF and good performance, and has a large potential for further improvements. Monte-Carlo simulations compare the proposed DS-CDMA receivers against established linear and nonlinear receivers. It is shown that all proposed receivers outperform the known linear receivers. The Volterra receiver’s complexity is relatively high for the performance gain achieved and might not suit practical implementation. The other receiver’s complexity was greatly reduced but it performs nearly as well as an optimum symbol by symbol detector. This thesis shows that DS-CDMA is a pattern recognition problem and that pattern recognition techniques can simplify DS-CDMA receiver structures. Knowledge is gained from the DSCDMA signal patterns which help to understand the problem of a DS-CDMA receiver. It should be noted that from the large number of known techniques, only a few pattern recognition techniques are considered in this work, and any further work should look at other techniques. Pattern recognition techniques can reduce the complexity of existing DS-CDMA receivers while maintaining performance, leading to novel receiver structures

Space Frequency Codes from Spherical Codes

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric connection between spherical codes and space time codes. The former are well studied e.g. in the context of optimal sequence design in CDMA systems, while the latter serve as basic building blocks for space frequency codes. In addition a decoding algorithm with moderate complexity is presented. This is achieved by a lattice based construction of spherical codes, which permits lattice decoding algorithms and thus offers a substantial reduction of complexity.Comment: 5 pages. Final version for the 2005 IEEE International Symposium on Information Theor

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

Minimum Bit-Error Rate Design for Space-Time Equalisation-Based Multiuser Detection

A novel minimum bit-error rate (MBER) space–time equalization (STE)-based multiuser detector (MUD) is proposed for multiple-receive-antenna-assisted space-division multiple-access systems. It is shown that the MBER-STE-aided MUD significantly outperforms the standard minimum mean-square error design in terms of the achievable bit-error rate (BER). Adaptive implementations of the MBER STE are considered, and both the block-data-based and sample-by-sample adaptive MBER algorithms are proposed. The latter, referred to as the least BER (LBER) algorithm, is compared with the most popular adaptive algorithm, known as the least mean square (LMS) algorithm. It is shown that in case of binary phase-shift keying, the computational complexity of the LBER-STE is about half of that required by the classic LMS-STE. Simulation results demonstrate that the LBER algorithm performs consistently better than the classic LMS algorithm, both in terms of its convergence speed and steady-state BER performance. Index Terms—Adaptive algorithm, minimum bit-error rate (MBER), multiuser detection (MUD), space–time processing

A Robust Nonlinear Beamforming Assisted Receiver for BPSK Signalling

Nonlinear beamforming designed for wireless communications is investigated. We derive the optimal nonlinear beamforming assisted receiver designed for binary phase shift keying (BPSK) signalling. It is shown that this optimal Bayesian beamformer significantly outperforms the classic linear minimum mean square error (LMMSE) beamformer at the expense of an increased complexity. Hence the achievable user capacity of the wireless system invoking the proposed beamformer is substantially enhanced. In particular, when the angular separation between the desired and interfering signals is below a certain threshold, a linear beamformer will fail while a nonlinear beamformer can still perform adequately. Blockadaptive implementation of the optimal Bayesian beamformer can be realized using a Radial Basis Function network based on the Relevance Vector Machine (RVM) for classification, and a recursive sample-by-sample adaptation is proposed based on an enhanced ?-means clustering aided recursive least squares algorithm

Symmetric Radial Basis Function Assisted Space-Time Equalisation for Multiple Receive-Antenna Aided Systems

This constribution considers nonlinear space-time equalisation (STE) designed for single-input multiple-output (SIMO) systems. By exploiting the inherent symmetry of the underlying optimal Bayesian STE solution, a novel symmetric radial basis function (RBF) based STE scheme is proposed, which is capable of achieving the optimal Bayesian equalisation performance. The adaptive adjustment of the STE taps of this symmetric RBF (SRBF) based STE can be achieved by estimating the SIMO channel encountered using the classic least mean square channel estimator and computing the optimal RBF centres from the resultant SIMO channel matrix estimate. Our simulation results demonstrate that the performance of this SRBF based STE is robust with respect to the choice of the algorithmic parameters