Capacity and performance comparison of IDMA and CDMA systems

Multiple access interference (MAI) appears in Code Division Multiple Access (CDMA) systems when the communication channel is a multi-path channel and the spreading codes are not orthogonal. Orthogonality between spreading codes cannot be maintained at the CDMA receiver because the codes may be asynchronous due to channel delay and multi-path spread. The receiver cannot perfectly separate the different signals of the multiple access users, and the resultant MAI limits the capacity of CDMA systems. MAI is a function of the cross correlation property between used spreading codes. In this paper we focus on the cross correlation of the spreading codes, we propose a method to find spreading codes with minimum magnitude of cross correlation. Employing these codes will reduce the resultant MAI in the CDMA system; hence it will increase the system capacity. A great enhancement is shown by comparing found minimum cross correlation spreading codes (MCCSC) with Hadamard and Gold codes.

Improvement of the capacity of the CDMA (code division multiple access) system is a major objective. The capacity of the system is mainly limited by the signal to noise ratio, where the noise comes from the channel background and from MAI (multiple access interference). Usually, the way to improve the capacity is to decrease the MAI; this is why orthogonal codes are adopted by the IS-95 standard. One problem is that the number of orthogonal codes is constrained by the dimensionality of the signal space. So in IS-95, there are only 64 orthogonal codes available when the number chips for each sequence is 64. To solve this problem, a non-orthogonal code called WBE (Welch bound equality) sequences (Massey and Mittelholzer 1991) is used in this paper The criterion to construct the code is to minimize the MAI. Two methods are used to construct the WBE sequences: from a linear cyclic code or from a Hadamard matrix. In order to improve the performance of the WBE sequence set, an iteration receiver (Sari et al. 1999) is applied. The conclusion obtained is that when the number of users is slightly greater than the signal space dimensionality, after the first iteration, the performance is only marginally worse than the orthogonal CDMA system.

In synchronous code division multiple access (CDMA) systems, both multiple access interference (MAI) and intersymbol interference (ISI) arise. MAI is present due to the CDMA format while ISI is present due to channel multipath. One approach to overcome these problems is to detect the entire package of data for all users at once. This implies working with matrices with dimensions proportional to the product of the data package length and the number of active users. In this paper, we present an alternative approach. This alternative consists of a type of multistage detector that overcomes the MAI and ISI problems; in addition, it has complexity proportional to the number of CDMA users, is computationally efficient, and is suitable for pipeline implementation which allows fast data processing. Simulations are compared to a derived single user bound for the average bit error probability and the results prove the validity of the proposed detection method.

For high-speed code division multiple access (CDMA) systems, interchip interference that is caused by multipath propagation becomes severe and cannot be ignored. Together with the multiple access interference due to nonideal conditions in CDMA, they become major obstacles to overall system performance. In this paper, both batch and adaptive algorithms based on linear prediction are proposed for joint blind equalization and multiuser detection for asynchronous CDMA systems. It is shown that the new methods are insensitive to estimation error of propagation delay or chip timing. In addition, the adaptive algorithm is computationally efficient. Simulation results show that the proposed methods are also near-far resistant and compare favorably to many existing methods.

Channel estimation techniques for code-division multiple access (CDMA) systems need to combat multiple access interference (MAI) effectively. Most existing estimation techniques are designed for CDMA systems with short repetitive spreading codes. However, current and next generation wireless systems use long spreading codes whose period is much larger than the symbol duration. In this paper, we derive the maximum likelihood channel estimate for long code CDMA systems over multipath channels using training sequences and approximate it using an iterative algorithm to reduce the computational complexity in each processing window. The asymptotic convergence of the mean of the iterative estimate to the actual channel is also shown. The effectiveness of the iterative channel estimator is demonstrated in terms of squared error in estimation as well as the bit error rate performance of a multistage detector based on the channel estimates. Finally, the proposed iterative channel estimation technique is extended to track slowly varying multipath fading channels using decision feedback. Thus, an MAI resistant multiuser channel estimate with reasonable computational complexity is derived for long code CDMA systems over multipath fading channels.

The capacity of CDMA (code-division multiple access) systems is limited by its other-user interference because all users in a cell share the same frequency band. To achieve maximum capacity, the 'near-far' problem needs to be dealt with. In practice, this is done through appropriate power control. Due to the interaction between the power control process, CDMA systems may become unstable if the desired SNR is not set appropriately. When CDMA systems are stable, the received power at the base station converges to the optimal power with a desired SNR (signal-to-noise ratio) setting. We analyze the associated power and the interference estimation in the discrete time domain and find the stability SNR upper bounds that can guarantee the system stability.

Problem statement: This study presents the performance analysis of turbo assisted Interleave Division Multiple-Access (IDMA) system with Multi Input Multi Output (MIMO) support for multi user scenario over correlated frequency selective and uncorrelated frequency selective channel. Approach: The key principle of IDMA is that interleaver unique which distinguishes the users in contrast to spreading sequence in Code Division Multiple Access System (CDMA). Results: In this work, we assume that Interleavers are generated independently and randomly. At the receiver, we employed Ordered SIC (OSIC) technique using ZF and MMSE criterion to combat Inter Antenna Interference (IAI) and Multi User Interference (MUI) problem along with iterative decoding to improve the performance in terms of BER. The performance of system has been discussed for different channel conditions with realistic channel model using extensive simulation runs based on Monte Carlo simulation trials. We have exhibited the flexibility and robustness provided by MIMO-IDMA. Conclusion/Recommendations: It has been proved from the results that IDMA principle can be applied to realize many potential performance gains highlighted by information theory, including coding gain multiplexing gain and multiuser gain. Simulation results presented to demonstrate the benefits of IDMA with MUD and iterative decoding. It is discerned that IDMA performs better than CDMA in frequency selective channel for high load conditions which is assessed through computer simulation results.

This paper studies detecting matrices in random dense and sparse Code Division Multiple Access (CDMA) systems. Detecting matrices were originally introduced in the coin weighing problem. Such matrices can be used in CDMA systems in over-loaded scheme where the number of users is greater than the number of chips. We drive some conditions in the large system limit for binary and bipolar random CDMA systems to ensure that any random matrix is a detecting matrix. Furthermore, we extend our results to sparse random ternary matrices that have been using in the sparse CDMA literature. Finally, a construction method for the sparse detecting matrices is introduced.

One of the major advantages of a code division multiple access (CDMA) system is the flexibility in frequency assignment, which allows all the users to share the same frequency band and, possibly, to partially overlay the spectrum allocation of different services. However, before synchronism to the desired sequence is achieved, the presence of multiple access interference (MAI) is a major impairment which determines the performance of the code acquisition sub-system. It has been argued that the acquisition performance in the presence of MAI may pose limits to the capacity of a CDMA system which are more stringent than those coming from bit error probability specifications. We introduce a general definition for acquisition-based capacity of a CDMA system. This quantity is evaluated for an acquisition sub-system with non-coherent correlator/detector and straight serial search in the time uncertainty region. The effect of imperfect power control is also analysed, showing that the capacity may be substantially decreased when the residual standard deviation of the received power level is above 1 dB. >

The use of multiple antennas at the transmitter or receiver provides a powerful means, of increasing the capacity of wireless systems. The goal of this paper is to illustrate ways in which analogies with multiuser code division multiple access (CDMA) systems may be used to provide design insights for space-time communication systems, for both single and multiple users. Three examples are considered: (a) noncoherent space-time codes for transmit antenna diversity against Rayleigh fading, constructed using an analogy with a CDMA downlink; (b) optimal multiuser transmit beamforming on a cellular downlink, where the algorithm for computing beamforming weights is obtained by transforming the problem into a CDMA uplink with MMSE interference suppression and power control; (c) design of high bandwidth efficiency systems exploiting both transmit and receive antenna arrays, using analogies with CDMA systems with random and slowly time-varying spreading waveforms.

In this treatise, the performance of Code division multiple access (CDMA) system is investigated using multi-user transmitter pre-processing (MUTP). The MUTP is promising signal processing technique which is carried out at the transmitter side to reduce the burden of detector and hence low complexity receiver is made feasible at mobile station (MS) in the context of downlink (DL) communication. Further, the unique signature sequence is considered to support more user population. In particular, the performance of MMSE-MUTP assisted CDMA system is investigated for realistic channel specifications based on Stanford University Interim (SUI) channel model. It has been demonstrated that the MMSE-MUTP assisted CDMA system provides achievable bit error rate with low complexity of receiver for DL transmission.

A dispersive finite impulse response (FIR) channel model is often considered for indoor wireless channels. For the FIR channel model in this paper, we consider the joint estimation of channel parameters and data symbols in indoor code division multiple access (CDMA) systems. The least squares formulation is constructed for the joint estimation incorporating the decision feedback technique. This formulation is suitable for indoor CDMA systems that usually have a small processing gain. The formulation is further modified to provide a recursive approach to estimate the channel vector.

The W-CDMA system plays an important role in the 3G cellular systems because of its compatible networking architecture to the present popular Global System for Mobile Communications (GSM) systems as well as the salient features of a Code Division Multiple Access (CDMA) system, including multi-path fading tolerance, high system capacity, low power consumption, good performance and coverage. In CDMA system, a procedure used by a Mobile Station (MS) to search for the best cell site and achieve code, time, and frequency synchronization with it is referred as cell search. Fast cell search is essential to reduce switch on delay (initial cell search), increase stand by time (idle mode search) and maintain good link quality (active-mode search). This is particularly true for the Wideband Code Division Multiple Access-Frequency Division Duplex (W-CDMA-FDD) system since it employs nonsynchronous base stations instead of synchronous ones of other CDMA systems to extend coverage from outdoor to indoor. Cell search is critical for achieving code and time synchronization. The main process of achieving cell search is divided into three stages followed by code verification, tracking and carrier frequency adjustment: 1) slot synchronization, 2) frame synchronization and code group identification, 3) primary scrambling code identification. This paper addresses slot synchronization in downlink as cell search algorithm in W-CDMA. In the three step search, the receiver searches for the slot timing by correlating the received signal with the Primary Synchronization (PSCH) code using Matched Filter (MF). This paper propose a design for a hierarchical matched filter for Primary Synchronization Code (PSC). The aim is to reduce the hardware complexity using Field Programmable Gate Array (FPGA) logic resources required to realize the filter.

In the underwater passive positioning systems (UPPS), it involves a key technology of multi-user communication that the beacons synchronously send positioning messages to the targets. Interferences from other users, referred to multi-access interferences (MAIs), can induce significant bit errors for the desired user. In this paper, we designed an underwater acoustic Code Division Multiple Access (CDMA) system using the coded cyclic shift key (CCSK) modulation, and proposed a hybrid MAI cancellation scheme based on cyclic shift inverse matrix transform (CSIMT) and recursive least square (RLS) in the CDMA system. The hybrid scheme can suppress MAI better than RLS or CSIMT, and meets the requirements of strong stability to support reliable transmission for UPPS. The CSIMT interference cancellation performs well under the far-near effects, which doesn’t depend on the accuracy of the estimation of transmitted data, and the strong MAI can be reduced by transformation of the zero-forcing correlation values using m sequence cyclic shift inverse matrix. The RLS interference cancellation is used to mitigate MAI form the detected users with comparable power, by using the estimated the channel impulse response between the receiver and the detected users, and the regenerated signal of detected users form decoder output, which allows of strong error-correcting codes, and it’s robust in an asynchronous environment. The theoretical analysis and experimental result show that the hybrid MAI cancellation scheme can effectively suppress MAI better. The shallow water sea trial was carried out near Dalian Tiger Beach Ocean Park in China, at a distance of about 5 km, the data rates of 100bps, where three users could communicate asynchronously with low failure ratio and can match the UPPS application.

This paper deals with fading and/or near-far effects with or without power control on the evaluation of the sum capacity of finite dimensional Code Division Multiple Access (CDMA) systems. CDMA systems under consideration have binary or finite non-binary inputs and signature matrices. Important results of this paper are that the knowledge of the received power variations due to input power differences, fading and/or near-far effects can significantly improve the sum capacity.