There are many novel techniques have been invented to provide high-data rate with high quality communication services for future wireless communications systems. Recently, a novel digital modulation technology for multiple accesses, referred to as the Multi-Carrier Code Division Multiple Access (MC-CDMA), has been proposed to support high data rate transmission; it is based on the combination of CDMA and orthogonal frequency division multiplexing (OFDM). The MC-CDMA has been shown to be an effective technique for combating multipath fading. With MC-CDMA system, a user¡¦s spreading code can be modulated on separate subcarriers, undergo frequency-flat fading channel and offers frequency diversity advantage. But in a multi-user environment, othogonality among spreading codes is severely distorted due to multipath delay spread, such that the system capacity will be limited by the multiple access interferences (MAI). Similar situations exist due to possible narrowband interference (NBI) from other systems. Effective interference reduction will render system capacity to increase, which means interference suppression techniques are vital in improving overall system performance. In this thesis, we propose a new linearly constrained recursive least square algorithm, with diagonal loading approach, referred to as the DL-LC RLS algorithms, to further improve the system performance. The proposed diagonal loading RLS algorithm is different from conventional diagonal loading RLS algorithm, in which the diagonal loading was used to improve the robustness to pointing errors in beamforming problem. However, in this thesis, the diagonal loading approach could be used to alleviate the effect due to multiple access interference (MAI), such that under certain circumstances, better performance could be achieved. Basically, in the proposed algorithm, the power of interference plus noise of received signal will be estimated and subtracted from the diagonal terms of the autocorrelation matrix of received signal. After that instead of using the original autocorrelation matrix, the new correlation matrix, with subtracting power related to the interference plus noise, will be involved during the adaptation processes for updating the weights of the multi-user detector. Finally, computer simulation results, in terms of bit error rate, are used to demonstrate the merits of the proposed scheme compared with the conventional RLS algorithm approach without using the diagonal approaches.

In this thesis, we propose and evaluate quasi-optimal algorithms for solving the code-constellation optimization problem in M-ary CDMA system. The M-ary CDMA system is a new CDMA architecture. The more spreading codes used in each user, and the higher bandwidth efficiency can achieve with more bits packed in each symbol. We use a code, which we refer to as ¡§mapping code¡¨, to help form a multidimensional spherical code-constellation. The M codewords of the mapping code correspond one-to-one to the M points on the code-constellation. Thus, the code-constellation optimization problem is a combinatorial optimization problem. We present that an exhaustive search (ES) algorithm would have compute and check all possible subset, and then this problem becomes a NP-hard. Based on the exhaustive search algorithm, we propose symmetric points search (SPS) algorithm to reduce computation complexity, but it is not optimal algorithm. In addition, we propose a quasi-optimal algorithm, namely Manhattan distance search (MDS) algorithm. Numerical results and comparisons are provided to illustrate that the computation complexity of the Manhattan distance search algorithm increases linearly with dimension of code-constellation and its performance is better than others.

The direct sequence (DS) code division multiple access (CDMA) is one of the most promising multiplexing technologies for wireless communications. It is also a core technology used in the wideband CDMA (WCDMA) system for the third generation (3G) wireless communication systems. In practice, in the CDMA systems the incomplete orthogonal of the spreading codes between users may introduce the so-called multiple access interference (MAI). Usually, the near-far problem exists when the interfering users are assigned powers much higher than the desired user. Such that the system performance might degrade, dramatically, and thus limits the system capacity. To circumvent the above-mentioned problems many effective adaptive multiuser detectors, based on the minimum mean square error (MMSE) and the minimum output energy (MOE) criteria subject to certain constraints have been proposed. In addition, to mitigate multipath fading effect, RAKE receiver was adopted due to the advantages of path diversity, thus, enhances the system performance. To implement the blind adaptive multiuser detector the linearly constrained minimum variance (LCMV), which is the constrained version of MOE, has been suggested. Further, the LCMV-based receivers exhibit high sensitivity to the channel mismatch caused by the unreliable estimation. To deal with this problem the constant modulus (CM) criterion was considered. In this dissertation, to deal with diverse phenomena encountered in practical channels, we first propose new blind adaptive multi-user detectors, based on the Min/Max criterion associated with the LCCM approach. For implementation the LC exponential window (EW) recursive least-square (RLS) algorithm is derived, and is referred to as the EW LCCM-RLS receiver. It can be used to effectively suppress the MAI and ISI, simultaneously, over multipath fading channels and are robust to mismatch problem caused by inaccuracies in the acquisition of timing and spreading code of the desired user. To reduce the complexity of the above-mentioned blind adaptive multi-user receiver with the LCCM-RLS algorithm, the so-called generalized sidelobe-canceller (GSC) structure is adopted, results in obtaining new CM-GSC-RLS algorithm. Moreover, to further improve the system performance for multipath fading and time-varying channel, the sliding window (SW) LCCM-RLS and SW CM-GSC-RLS algorithms are developed. It can be employed for multipath fading channel with the rapidly changing strong narrowband interference (NBI), which is joined suddenly to the CDMA systems. To look more inside the effect of selecting the initial value of the input signals autocorrelation matrix, some theoretical analyses for the SW LC-RLS as well as EW LC-RLS are provided. Since, unfortunately, the LCCM criterion is known to highly depend on the exact knowledge of the desired user amplitude that is not known exactly at receiver. In the final of this dissertation, a novel linearly constrained adaptive constant modulus RLS (LC-ACM-RLS) algorithm for blind DS-CDMA receiver is proposed. With this new proposed LC-ACM-RLS algorithm, the amplitude variation of the desired user, due to changing characteristics of the channel, can be tracked adaptively. Thus, better performance achievement, in terms of output signal-to-interference-plus-noise ratio (SINR) and bit error rate (BER), over the conventional LCCM-LMS and LCCM-RLS algorithms can be expected.

No description available.

No description available.

No description available.

Capacity of CDMA system is limited to interference due to other users. System performance is degraded by near-far problem when undesired users are closer to base station. Beside, the channel parameters could not be estimated perfectly at receiver, refer to as mismatch problem, which would also degrade the system performance. We would like to consider the MAI and near-far interference cancellation by adaptive linear constraint algorithms to implement linear constraint minimum variance (LCMV) approach. To exploit the linearly constrained filtering, the structure of the generalized side-lobe canceller (GSC) has been employed, where the constrained problem is converted into an unconstrained form with fewer parameters. GSC structure is an indirect but simpler implementation of LCMV algorithm. Moreover, it is also known that the constant modulus (CM) criteria has advantage to combat the channel mismatch, and the performance of the adaptive constraint algorithm based on CM criteria will be investigate. In this thesis, we will derive a new GSC-IQRD-RLS algorithm to combat MAI and near-far problems by combining LC-IQRD-RLS algorithm [1][5] and GSC structure [17]; and prove that the GSC and LC structures based IQRD-RLS algorithms are equivalent, which means that the good performance of LC-IQRD-RLS algorithm can be achieved by a simpler GSC structure algorithm. We will also derive a new GSC-CM-IQRD-RLS algorithm to improve the system performance under mismatch problem by combining CM criteria [20] and GSC-IQRD-RLS algorithm.

The technique of direct sequence code division multiple access (DS-CDMA) cellular system has been the focus of increased attention. In this thesis, we will consider the environment of DS-CDMA systems, where the asynchronous narrow band interference due to other systems is joined suddenly to the CDMA system. The suddenly joined narrow band interference will make the system crush down. The main concern of this thesis is to deal with suddenly joined narrow band interference cancellation. An adaptive filtering algorithm based on sliding window criterion and variable forgetting factor is known to be very attractive for violent changing environment. In this thesis, a new sliding window linearly constrained recursive least squares (SW LC-RLS) algorithm and variable forgetting factor linearly constrained recursive least squares (VFF LC-RLS) algorithm on the modified minimum mean squared error (MMSE) structure [9] is devised for RAKE receiver in direct sequence code-division multiple access (DS-CDMA) system over multipath fading channels. Where the channel estimation scheme is accomplished at the output of adaptive filter. The proposed SW LC-RLS algorithm and VFF LC-RLS has the advantage of having faster convergence property and tracking ability, and can be applied to the environment, where the narrow band interference is suddenly joined to the system, to achieve desired performance. Via computer simulation, we show that the performance, in terms of mean square errors (MSE) and signal to interference plus noise ratio (SINR), is superior to the conventional LC-RLS and orthogonal decomposition-based LMS algorithms based on the MMSE structure [9].

Design and analysis of random-like codes for various multiple-input and multiple-output communication systems are addressed in this work. Random-like codes have drawn significant interest because they offer capacity-achieving performance. We first consider the analysis and design of low-density parity-check (LDPC) codes for turbo multiuser detection in multipath CDMA channels. We develop techniques for computing the probability density function (pdf) of the extrinsic messages at the output of the soft-input soft-output (SISO) multiuser detectors as a function of the pdf of input extrinsic messages, user spreading codes, channel impulse responses, and signal-to-noise ratios. Using these techniques, we are able to accurately compute the thresholds for LDPC codes and design good irregular LDPC codes. We then apply the tools of density evolution with mixture Gaussian approximations to optimize irregular LDPC codes and to compute minimum operational signal-to-noise ratios for ergodic MIMO OFDM channels. In particular, the optimization is done for various MIMO OFDM system configurations which include different number of antennas, different channel models and different demodulation schemes. We also study the coding-spreading tradeoff in LDPC coded CDMA systems employing multiuser joint decoding. We solve the coding-spreading optimization based on the extrinsic information SNR evolution curves for the SISO multiuser detectors and the SISO LDPC decoders. Both single-cell and multi-cell scenarios will be considered. For each of these cases, we will characterize the extrinsic information for both finite-size systems and the so-called large systems where asymptotic performance results must be evoked. Finally, we consider the design optimization of irregular repeat accumulate (IRA) codes for MIMO communication systems employing iterative receivers. We present the density evolution-based procedure with Gaussian approximation for optimizing the IRA code ensemble. We adopt an approximation method based on linear programming to design an IRA code with the extrinsic information transfer (EXIT) chart matched to that of the soft MIMO demodulator.

In recent years, demands on all kinds of wireless communications become heavier due to the developments of new services and devices. At the same time, future wireless networks are expected to provide services with high quality and data rate. A possible solution which can attain these objectives is wireless communication systems that use multiple-input multiple-output (MIMO) antennas along with Alamouti¡¦s space-time block code and direct-sequence code division multiple access (DS-CDMA) modulation technique. In such systems, spatial diversity rendered by multiple antennas as well as coding in spatial and time domains are the keys to improve quality of transmission. Many multiuser detection techniques for the space-time block coded CDMA systems have been investigated. In [8], the blind Capon receiver was proposed, which consists of a two-branch filterbank followed by the blind Capon channel estimator. The design of blind Capon receiver is based on linearly constrained minimum variance (LCMV) criterion, which is known to be sensitive to inaccuracies in the acquisition or tracking of the desired user's timing, referred to as mismatch effect. In other words, the LCMV-based receiver may perform undesirably under mismatch effect. In this thesis, we propose a new blind adaptive MIMO-CDMA receiver based on the linearly constrained constant modulus (LCCM) criterion. This work is motivated by the robustness of LCCM approach to the mismatch effect. To reduce the complexity of receiver design, framework of the generalized sidelobe canceller (GSC) associated with the recursive least squares (RLS) algorithm is adopted for implementing the adaptive LCCM MIMO-CDMA filterbank. Based on the GSC-RLS structure, we derive the proposed MIMO CM-GSC-RLS algorithm. For the purpose of comparison, an adaptive implementation of the blind Capon receiver proposed in [8] is also derived, which is referred to as the MIMO MV-GSC-RLS algorithm. We note that the signal model in [8] was constructed under assumption of frequency-flat channels. To obtain a more practical and realistic signal model, in this thesis we extend the system and channel model by including multipath effects in the beginning of our work. In completing this extension, inter-symbol interference (ISI) caused by the special coding scheme of ST-BC will be specifically analyzed. Finally, a full discussion of the multipath signal model will be provided, including necessity of truncating the received signals as well as modifications in the signal model when considering time-varying channels. Via computer simulations, advantages of the proposed scheme will be verified. Compared to the conventional blind Capon receiver, we will show that the performance of the proposed CM-GSC-RLS algorithm is better. This is especially true when mismatch problem is considered in the MIMO-CDMA systems of interest. The proposed scheme show more robustness against the mismatch effects than the conventional blind Capon receiver. Moreover, the benefit resulted by truncating the received signals is also demonstrated, especially for binary phase-shift-keying (BPSK) modulated source symbol. Finally, simulations considering time-varying channels are provided to reveal that our proposed scheme can adapt itself to the time-varying environments appropriately.