Near maximum likelihood multiuser receivers for direct sequence code division multiple access

Wideband wireless access based on direct-sequence code-division multiple access (DS-CDMA) has been adopted for third-generation mobile communications systems. Hence, DS-CDMA downlink communications systems form the platform for the work in this thesis. The principles of the spread spectrum concept and DS-CDMA technology are first outlined, including a description of the system model and the conventional receiver. The two classes of codes used in this system, namely spreading codes and forward error correction codes (including Turbo codes), are discussed. Due to the fact that practical communications channels are non-ideal, the performance of an individual user is interference limited. As a result, the capacity of the system is greatly restricted. Fortunately, multiuser detection is a scheme that can effectively counteract this multiple access interference. However, the optimum multiuser detection scheme is far too computationally intensive for practical use. Hence, the fundamental interest here is to retain the advantages of multiuser detection and simplify its implementation. The objective of the thesis is to investigate the optimum multiuser receiver, regarded on a chip level sampling basis. The aim is to reduce the complexity of the optimum receiver to a practical and implementable level while retaining its good performance. The thesis first reviews various existing multiuser receivers. The chip-based maximum likelihood sequence estimation (CBMLSE) detector is formulated and implemented. However, the number of states in the state-transition trellis is still exponential in the number of users. Complexity cannot be reduced substantially without changing the structure of the trellis. A new detector is proposed which folds up the original state-transition trellis such that the number of states involved is greatly reduced. The performance is close to that of the CBMLSE. The folded trellis detector (FTD) can also be used as a preselection stage for the CBMLSE. The FTD selects with high accuracy the few symbol vectors that are more likely to be transmitted. The CBMLSE is then used to determine the most likely symbol vector out of the small subset of vectors. The performance of this scheme is as good as the CBMLSE. The FTD is also applied in an iterative multiuser receiver that exploits the powerful iterative algorithm of Turbo codes

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

Wavelet-based multi-carrier code division multiple access systems

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

On Efficient Signal Processing Algorithms for Signal Detection and PAPR Reduction in OFDM Systems

The driving force of the study is susceptibility of LS algorithm to noise. As LS algorithm is simple to implement, hence it’s performance improvement can contribute a lot to the wireless technology that are especially deals with high computation. Cascading of AdaBoost algorithm with LS greatly influences the OFDM system performance. Performance of Adaptive Boosting based symbol recovery was investigated on the performance of LS, MMSE, BLUE were also compared with the performance of AdaBoost algorithm and MMSE has been found the higher computational complexity. Furthermore, MMSE also requires apriori channel statistics and computational complexity O(5N3) of the MMSE increases exponentially as the number of carrier increases. For the Adaboost case the computational complexity calculation is little different.Therefore, in the training stage of the AdaBoost algorithm, the computational complexity is only O(nT M) Furthermore, as it is a classification algorithm so in the receiver side we will require a separate de-mapper (or decoder) to get the desired data bits, i.e., a. SAS aided DCT based PAPR reduction 1326 and b. SAS aided DCT based PAPR reduction. A successive addition subtraction preprocessed DCT based PAPR reduction technique was proposed. Here, the performance of proposed method was compared with other preexisting techniques like SLM and PTS and the performance of the proposed method was seen to outperform specially in low PAPR region. In the proposed PAPR reduction method, the receiver is aware of the transmitted signal processing, this enables a reverse operation at the receiver to extract the transmit data. Hence the requirement of sending extra information through extra subcarrier is eliminated. The proposed method is also seen to be spectrally efficient. In the case of PTS and SLM it is inevitable to send the side information to retrieve the transmit signal. Hence, these two methods are spectrally inefficient. Successive addition subtraction based PAPR reduction method was also applied to MIMO systems. The performance of the SAS based PAPR reduction method also showed better performance as compared to other technique. An extensive simulation of MIMO OFDM PAPR reduction was carried out by varying the number of subcarriers and number of transmitter antennas. A detailed computational complexity analysis was also carried out. BATE aided SDMA multi user detection. A detailed study of SDMA system was carried out with it’s mathematical analysis.Many linear and non linear detectors like ML, MMSE, PIC, SIC have been proposed in literature for multiuser detection of SDMA system. However, except MMSE every receivers other are computational extensive. So as to enhance the performance of the MMSE MUD a meta heuristic Bat algorithm was incorporated in cascade with MMSE

On Development of Some Soft Computing Based Multiuser Detection Techniques for SDMA–OFDM Wireless Communication System

Space Division Multiple Access(SDMA) based technique as a subclass of Multiple Input Multiple Output (MIMO) systems achieves high spectral efficiency through bandwidth reuse by multiple users. On the other hand, Orthogonal Frequency Division Multiplexing (OFDM) mitigates the impairments of the propagation channel. The combination of SDMA and OFDM has emerged as a most competitive technology for future wireless communication system. In the SDMA uplink, multiple users communicate simultaneously with a multiple antenna Base Station (BS) sharing the same frequency band by exploring their unique user specific-special spatial signature. Different Multiuser Detection (MUD) schemes have been proposed at the BS receiver to identify users correctly by mitigating the multiuser interference. However, most of the classical MUDs fail to separate the users signals in the over load scenario, where the number of users exceed the number of receiving antennas. On the other hand, due to exhaustive search mechanism, the optimal Maximum Likelihood (ML) detector is limited by high computational complexity, which increases exponentially with increasing number of simultaneous users. Hence, cost function minimization based Minimum Error Rate (MER) detectors are preferred, which basically minimize the probability of error by iteratively updating receiver’s weights using adaptive algorithms such as Steepest Descent (SD), Conjugate Gradient (CG) etc. The first part of research proposes Optimization Techniques (OTs) aided MER detectors to overcome the shortfalls of the CG based MER detectors. Popular metaheuristic search algorithms like Adaptive Genetic Algorithm (AGA), Adaptive Differential Evolution Algorithm (ADEA) and Invasive Weed Optimization (IWO), which rely on an intelligent search of a large but finite solution space using statistical methods, have been applied for finding the optimal weight vectors for MER MUD. Further, it is observed in an overload SDMA–OFDM system that the channel output phasor constellation often becomes linearly non-separable. With increasing the number of users, the receiver weight optimization task turns out to be more difficult due to the exponentially increased number of dimensions of the weight matrix. As a result, MUD becomes a challenging multidimensional optimization problem. Therefore, signal classification requires a nonlinear solution. Considering this, the second part of research work suggests Artificial Neural Network (ANN) based MUDs on thestandard Multilayer Perceptron (MLP) and Radial Basis Function (RBF) frameworks fo

MIMO Systems

In recent years, it was realized that the MIMO communication systems seems to be inevitable in accelerated evolution of high data rates applications due to their potential to dramatically increase the spectral efficiency and simultaneously sending individual information to the corresponding users in wireless systems. This book, intends to provide highlights of the current research topics in the field of MIMO system, to offer a snapshot of the recent advances and major issues faced today by the researchers in the MIMO related areas. The book is written by specialists working in universities and research centers all over the world to cover the fundamental principles and main advanced topics on high data rates wireless communications systems over MIMO channels. Moreover, the book has the advantage of providing a collection of applications that are completely independent and self-contained; thus, the interested reader can choose any chapter and skip to another without losing continuity

Waveform Design for 5G and beyond Systems

5G traffic has very diverse requirements with respect to data rate, delay, and reliability. The concept of using multiple OFDM numerologies adopted in the 5G NR standard will likely meet these multiple requirements to some extent. However, the traffic is radically accruing different characteristics and requirements when compared with the initial stage of 5G, which focused mainly on high-speed multimedia data applications. For instance, applications such as vehicular communications and robotics control require a highly reliable and ultra-low delay. In addition, various emerging M2M applications have sparse traffic with a small amount of data to be delivered. The state-of-the-art OFDM technique has some limitations when addressing the aforementioned requirements at the same time. Meanwhile, numerous waveform alternatives, such as FBMC, GFDM, and UFMC, have been explored. They also have their own pros and cons due to their intrinsic waveform properties. Hence, it is the opportune moment to come up with modification/variations/combinations to the aforementioned techniques or a new waveform design for 5G systems and beyond. The aim of this Special Issue is to provide the latest research and advances in the field of waveform design for 5G systems and beyond