Code Division Multiple Access Uplink Research Articles

1D-Bernoulli Chaos Sequences Based Collaborative-CDMA: A Novel Secure High Capacity CDMA Scheme

Collaborative multi-user transmission and detection is a contemporary technique used for the up-link of code-division multiple access (CDMA). CDMA has contributed much to the field of wireless communication and still addresses many of the capacity and security requirements. The collaborative multi-user technique achieves an increase in capacity by sharing the spreading sequences among the users. In such grouped CDMA schemes, the sum of large numbers of statistically uncorrelated pseudo-random (PN) sequences results in multiple access interference. This restricts the number of PN sequences available for spreading, thereby limiting the total number of full rate users. Furthermore, PN sequences can be detected by their bit timings and consequently the security of the users' data is a matter of concern. To solve this problem, a novel high-capacity and secure system, called the 1D-Bernoulli-chaotic-collaborative-CDMA (BCC-CDMA), is proposed. In the BCC-CDMA, a set of specific `initial-conditions' are used, and identified for the 1D-Bernoulli Map, that generates row elements of an N × N matrix of mutually orthogonal chaotic sequences,. The ith row of this matrix acts as the spreading sequence for the ith group of collaborating users in BCC-CDMA. The proposed scheme eliminates the constraints in security and user capacity outperforming the existing multi-user detection schemes. Simulations show the bit-error-rate performance of BCC-CDMA supporting 120 full-rate users compared to the almost 90 and 30 users offered by conventional schemes.

Blind carrier frequency offset mitigation in space–time block‐coded multicarrier code division multiple access uplink transmission

SummaryIn this paper, a novel blind carrier frequency offset (CFO) estimation is proposed on the basis of the linearly constrained optimization for the uplink transmission of space–time block‐coded multicarrier code division multiple access systems. First, the full‐dimensional spatial‐and‐temporal data are formed to avoid violation of the second‐order statistics in the conventional receiver design. A set of weight vectors is then provided for acquiring each multipath signal from the desired user while the others get rejected. Finally, the estimated CFO is obtained in accordance with maximizing the well‐defined measurement function, which is formulated by collecting all the output powers of the receiver. A space–time averaging technique is also proposed to enhance the robustness to the finite sample effect. Simulation study confirms that with the proposed CFO estimator used in the preceding, the receiver can successfully achieve the same performance of the optimal receiver working in the absence of CFO. Copyright © 2014 John Wiley & Sons, Ltd.

Successive AF/DF Relaying in the Cooperative DS-CDMA Uplink: Capacity Analysis and Its System Architecture

A successive-relaying-aided network (SRAN) is designed for a multiuser spread-spectrum scenario conceived for noncoherent (NC) detection to convert the typical 50% half-duplex relaying induced throughput loss to a potential user-load reduction of the code-division multiple-access (CDMA) system, where the NC allows us to avoid the extra power consumption imposed by channel estimation. We commence by evaluating the NC discrete-input-continuous-output memoryless channel (DCMC) capacity of both the amplify-and-forward-based (AF) and decode-and-forward-based (DF) SRANs in the direct-sequence CDMA (DS-CDMA) uplink (UL). While NC detection has the added benefit of eliminating both the pilot overhead and the power-hungry channel estimation, it tends to form an error floor at high Doppler frequencies. We mitigate this problem using multiple-symbol detection, which increases the detection complexity upon extending the detection window. Finally, a relay-aided soft-input-soft-output multiple-symbol differential sphere detection (SISO-MSDSD) CDMA regime is proposed, which significantly reduces the system's complexity without sacrificing its performance.

Cooperative Relaying Scheme for Orthogonal Frequency and Code Division Multiple Access Uplink System

Orthogonal frequency and code division multiplexing (OFCDM) which can be extended orthogonal frequency and code division multiple access (OFCDMA) has a good performance, because it can mitigate multi path interference while maintaining high data rate. Furthermore, cooperative OFCDM relaying system provides these advantages, and this system can effectively use the limited resource with respect to data rate and each terminal’s energy efficiency. Therefore we proposed cooperative OFCDMA relaying uplink system because of the user’s requirement of the high data rate at uplink. However, a throughput performance decreases when this system employs many relays in case of each relay allocated code channel to separate each relay’s signal. Therefore, in this paper, we present that the proposed system combines cyclic delay diversity due to complement throughput performance problem. DF (Decode-and-Forward) is assumed in this paper. It is considered that the users which want to send data to BS only decode the data from other users. In addition to that, we propose the adaptive cooperative communication for the OFCDMA uplink system. The proposed adaptive system can easily select the cooperative relay.

High user capacity collaborative code-division multiple access

In this study, the authors propose a novel collaborative multi-user transmission and detection scheme for the uplink of code-division multiple access (CDMA) that exploits the differences between users' fading channel signatures to increase the user capacity well beyond the spreading length in multiple access interference (MAI) limited environment. The authors show that it is possible to achieve this increase at a low complexity and high bit error rate (BER) performance in flat fading channels, which is a major research challenge for overloaded CDMA systems. In this approach, instead of using one sequence per user as in conventional CDMA, the authors group a small number of users to share the same spreading sequence and enable group spreading and despreading operations. The proposed collaborative multi-user receiver consists of two stages: group multi-user detection (MUD) stage to suppress the MAI between the groups and a low complexity maximum-likelihood detection stage to recover jointly the co-spread users' data using minimum Euclidean distance measure and users' channel gain coefficients. The scheme is investigated analytically and by extensive simulations and comparisons with conventional CDMA, overloaded CDMA using group pseudo-decorrelation (G-PD) and layered space–time (LAST) MUD. It is shown that the total number of full-rate users supported by the scheme is substantially higher than the available sequences. Moreover, it achieves much lower complexity and significantly improved BER for the same user capacity compared with G-PD. It is also shown that, with antenna diversity reception, collaborative CDMA considerably outperforms LAST scheme, particularly when more transmit antennas per group than available receive antennas are employed.

Characterisation of wideband code division multiple access uplink transmit power for typical mobile usage patterns

With the ever-increasing demand for higher data rates and longer talk times, designing low-power RF front ends in wideband code division multiple access (WCDMA) mobile handsets is an important task. However, the power efficiency of current WCDMA RF front ends, particularly power amplifiers, is very low over the range of typical output power levels. Thus, to improve the RF characteristics, it is important to understand typical output power requirements for WCDMA handsets in practical mobile usage conditions. In this study, the authors present a characterisation and analysis of WCDMA uplink power or handset transmit power for typical mobile usage patterns by location. Unlike previous studies, in this experimental study the authors take measurements using a real WCDMA phone over a commercial universal mobile telecommunications systems network while simulating practical mobile user behaviour. Specifically, the distribution and statistics of WCDMA uplink transmit power at various locations are investigated. Similar locations are then grouped to form four practical mobile usage scenarios, and their frequency histograms are analysed. Further, in each scenario the authors examine the dependency of uplink transmit power on several key factors (i.e. radio coverage, handset position and network loading) and the statistical properties of the transmit power variation.

Radio-Resource Management and Access-Control Mechanism Based on a Novel Economic Model in Heterogeneous Wireless Networks

In this paper, we first investigate the radio-resource management and network-selection schemes in heterogeneous wireless networks. Then, we propose a novel economic model to allocate radio resources for both code-division multiple-access (CDMA) networks and wireless local area networks (WLANs). Particularly, the resource-usage constraint is deduced in the CDMA uplink, where the radio resource is allocated with the aim of maximizing the total welfare of the CDMA network while satisfying the signal quality requirement of all mobile users. Moreover, we formulate and solve the optimization problem in the WLAN to maximize the network welfare when the maximum throughput in the WLAN is achieved by controlling the optimum collision probability. An approximated closed-form expression for the network welfare is also given when the assigned bandwidth for each user is close to the bandwidth request. Finally, we design the joint access-control mechanism under different load conditions in coupled heterogeneous networks. Numerical results show that the proposed scheme can achieve approximately 20% more users and 10% more network social welfare, which outperforms the utility-function-based access selection and single network access-control mechanisms in the literature for heterogeneous wireless networks.

A Channel-Estimation and Data-Detection Scheme for Multiuser MIMO-CDMA Systems in Fading Channels

In this paper, we examine the effect of channel estimation errors on the performance of multiple-input-multiple-output (MIMO) systems that employ code-division multiple-access (CDMA) transmission. Channel estimation based on training techniques has widely been considered throughout the literature. However, employing these training techniques in MIMO-CDMA systems degrades system performance due to multiuser interference. This degradation is clear as the diversity advantage of the MIMO system diminishes with the increased level of interference. As a remedy to this problem, we propose a channel-estimation and data-detection scheme based on the superimposed training technique for space-time spreading systems. The proposed scheme enhances the performance of the space-time system by eliminating the interference effect from both the channel and data estimates using two decorrelators: channel and data decorrelators. We investigate the performance of the proposed estimation technique considering an asynchronous CDMA uplink transmission over frequency-selective slow-fading channels. In particular, we analyze the bit-error-rate (BER) performance of the multiuser system with two-transmit-antenna and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</i> -receive-antenna configuration over Rayleigh fading channels. Compared with other conventional estimation techniques, our results show that the proposed estimation technique is more robust to channel-estimation errors. Furthermore, both simulations and analytical results indicate that full system diversity is achieved.

Analysis and performance of a hybrid multiple access scheme: IDMA/CDMA

Purpose – The purpose of this paper is to introduce the analysis and performance of a hybrid multiple access scheme which combines interleave division multiple access (IDMA) and code division multiple access (CDMA), referred to as IDMA/CDMA. With experimentations, the scheme can achieve good performance with simple user ends for the system.Design/methodology/approach – IDMA technique is employed as the uplink transmission and CDMA technique as the downlink transmission. The performance comparison of IDMA and IDMA/CDMA downlink is studied with Monte Carlo simulations to investigate the bit error rates. For IDMA/CDMA downlink, the signals are interleaved by random interleavers, spreaded by M‐sequence and orthogonal Gold sequence, respectively, and then transmitted over an AWGN with BPSK modulation. Moreover, a channel estimation approach for IDMA based on expectation maximization (EM) algorithm is also presented.Findings – The multi‐user detection (MUD) algorithm in uplink IDMA systems is much simpler than ...

Variance-reduced partial parallel interference cancellation for MC-CDMA uplink systems

In this paper, we present an improved version of partial parallel interference cancellation (PPIC), called variancereduced PPIC (VRPPIC), for multicarrier code division multiple access uplink systems. The VRPPIC detector is a combination of the PPIC receiver and a new bit estimator, where a simplified realization is derived for the main PPIC operations and soft decisions from PPIC are linearly combined by the bit estimator using appropriate weighting factors (derived from the PPIC weighting factors) to reduce the conditional variance of the final signal estimate. Also, we derive an optimal weighting factor (OWF) selection algorithm for VRPPIC based on minimizing a monotonically increasing conditional variance function. The derived OWFs for all the interference cancellation stages are equal and can easily be obtained from a linear function of the number of active users. Simulation results show that VRPPIC with the proposed OWFs significantly outperforms VRPPIC (or PPIC) with randomly selected weighting factors in multipath Rayleigh fading channels.

Asymptotic Analysis of Outage Region in CDMA MIMO Systems

Uplink code-division multiple access (CDMA) multiple-input and multiple-output (MIMO) systems are considered in the large system limit within the assumptions of synchrony and frequency flat fading. The outage region maximizing the sum capacity of non-outage users is obtained, which extends the criterion of outage in single-input and single-output (SISO) CDMA systems.

Optimum pilot-to-data power ratio for partial RAKE receiver in Nakagami-m fading channels

In this paper, we study the problem of optimizing the pilot-to-data power ratio (PDR) for uplink code-division multiple access (CDMA) systems with partial RAKE (PRAKE) receivers. Both code-division multiplex (CDM) and time-division multiplex (TDM) reference-assisted schemes are considered. We assume Nakagami-m fading channel with two types of power delay profile (PDP): uniform and exponential PDPs. The optimum PDR is derived via minimizing the upper bound of the probability of bit error. A closed-form expression for the optimum PDR is obtained for both CDM and TDM schemes with uniform PDP. For exponential PDP, we derive the condition satisfied by the optimum PDR and obtain it numerically. It is observed that the optimum PDR is noticeably affected by the decay factor, but not by the m-parameter. For exponential PDP, unlike for uniform PDP, the optimum PDR depends on the number of combined paths. We also show that the optimum PDR derived from the block-fading channel model performs favorably in the Jakes' model.

Ant-Colony-Optimization-Based Scheduling Algorithm for Uplink CDMA Nonreal-Time Data

Scheduling plays an important role in determining the overall performance of code-division multiple-access (CDMA) systems. This paper is focused on the uplink scheduling of CDMA nonreal-time data. In practical CDMA systems, data can only be transmitted with a few fixed transmission rates. Moreover, to guarantee receiving accuracy, the actual received signal-power-to-interference-plus-noise-power ratio (SINR) is expected to be no less than the target SINR value. Using Heaviside unit step functions, the relationship between the actual SINR value and the actual available maximum transmission rate is described in the proposed system model. Based on the proposed system model, an integer optimization problem is formulated to simultaneously maximize the throughput and the scheduling efficiency. Particularly, an ant-colony-optimization (ACO)-based scheduling algorithm is proposed to solve the proposed optimization problem. The computational complexity analysis indicates that the proposed ACO-based scheduling algorithm is computationally efficient in terms of both running time and storage space. In addition, the numerical results show that the proposed optimization problem is more efficient at guiding the development of scheduling algorithms for uplink CDMA nonreal-time data. Moreover, the proposed ACO-based scheduling algorithm performs quite well in terms of quality, running time, and stability.

The performance of multi-user cooperative diversity in an asynchronous CDMA uplink

This paper investigates the impact of inter-user non-orthogonality and asynchronous communication on the information-outage probability performance of multi-user decode-and-forward (DF) cooperative diversity in a code-division multiple-access (CDMA) uplink. Each user in the proposed system transmits its own data towards the base station and also serves as a relay for other users. We assume full-duplex communication so that each user can transmit and receive simultaneously at the same frequency. Each user attempts to decode the messages of a plurality of other users and forwards the superposition of multiple re-encoded and re-spread messages. Our cooperative scheme employs a sub-optimum decorrelating receiver to suppress the multi-user interference at both the base station and the relay-side. We evaluate the information-outage probability performance of the proposed scheme in an underloaded, fully-loaded and overloaded CDMA uplink. We consider combining schemes at the base station where the source information is code combined with the relayed information, while the information from multiple relays is either code combined or diversity combined. Under the system parameters contemplated in this paper, diversity combining of the relayed information is nearly as good as code combining because of the associated probabilities of decoding at the relays. We then examine the effect of using practical modulation formats on the information-outage probability performance of the proposed DF multi-user sharing scheme under diversity combining. We see that the performance loss due to modulation constraints and the use of diversity combining instead of code combining is relatively small.

Distributed algorithm for optimal sequence and power allocation in uplink code division multiple access systems

An alternative approach is presented for centralised algorithms that design optimal sequences and powers under quality of service constraints in the uplink of a code division multiple access systems. The authors propose a distributed algorithm, where each user designs its optimal codeword in such a way to transmit minimum power, based on certain feedback information sent from the base station. The authors define the user cost function, which is the user power written as a convex function of user codewords for a defined signal-to-interference plus noise ratio target. For the constrained optimisation problem, optimal codewords are designed based on feasible direction method and the optimal user powers are the minimum values of the user cost functions. For the optimal configuration, the matched filter employed at receiver will have the same performance as the minimum mean squared error filter. Even if the optimal user powers are unique, the optimal codewords do not correspond to a unique allocation, but rather to an entire class of codewords that can be related by unitary transformations. The algorithm works properly in the presence of multiple access interference with white or coloured additive noise and requires no ordering. The proposed algorithm is analysed and illustrated with numerical examples obtained from simulations.

Reduced-Rank Adaptive Filtering Using Localized Processing for CDMA Systems

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> An integrated beamforming (spatial processing) and multiuser-detection (temporal processing) scheme is an effective approach to increase system capacity but is also impractical due to the high associated computational costs. To overcome this problem, researchers have developed reduced-rank approaches. Adding to this class of algorithms, this paper introduces a joint-domain adaptive algorithm, which processes spatial and temporal data within a localized region after transformation to a “beamspace.” This new joint-domain-localized (JDL) adaptive algorithm is developed for single-cell uplink code-division multiple-access (CDMA) systems with a receive-antenna array. Given a rank constraint on the JDL transformation, this paper develops the optimal choice of transformation matrix and justifies a simpler suboptimal choice. The JDL algorithm is shown to have relatively low computation load. We also introduce the JDL-Z algorithm that combines JDL processing with zero forcing for multicell uplink CDMA systems. At the cost of higher computational complexity, this new scheme provides better performance and a faster convergence rate than the JDL algorithm. However, the key contribution is a framework wherein adaptive processing can be followed by yet another stage of adaptive processing. Simulations are used to illustrate the efficacy of the two algorithms. </para>

Signal Design to Optimize Trade-Off between Bandwidth Efficiency and Power Efficiency in Uplink CDMA Systems

In this paper, we compare two signal designs for uplink quasi-synchronous code division multiple access (CDMA) channels in order to optimize the trade-off between bandwidth efficiency and power efficiency. The design we call band-limited DS/CDMA design, is based on the time-domain assignment of Gold sequences, just as in the ordinary DS/CDMA, but with band-constrained cyclic chip interpolation functions, which is unlike the ordinary DS/CDMA. The other design, MC/CDMA design, is based on frequency-domain assignment of the sequences, as in the ordinary MC/CDMA. In both designs, we assume insertion of guard intervals at the transmitter and frequency-domain processing in reception. Assuming quasi-synchronous arrival of CDMA signals at the CDMA base station and FFT in the effective symbol interval, the intersymbol interference is evaded in both designs. First we identified the signal parameters that optimize bandwidth efficiency in each of the band-limited DS design and MC design. Second, we clarified the signal parameters that optimize the power efficiency as functions of frequency efficiency in each of the two designs. Finally, we derived and compared the trade-off between the bandwidth efficiency and power efficiency of band-limited DS and MC designs. We found a superiority of band-limited DS design over MC design with respect to the optimized trade-off.

Linear receivers for the multiple-input multiple-output multiple-access channel

We consider a multiuser multiple-input multiple-output (MIMO) communication system using code-division multiple access (CDMA) and multiuser detection to discriminate the different users. Our focus is on the CDMA uplink of a frequency-nonselective Rayleigh fading channel. We study two types of receivers: joint receivers, which address simultaneously both spatial and multiple-access interference; and separate receivers, addressing the two types of interference individually. This approach allows assessing the benefits of adding MIMO processing capabilities to existing multiuser single-input single-output systems. For both receiver types, we analyze solutions based on linear (matched filter, decorrelator, minimum mean-square error) and maximum-likelihood receivers. For all the receivers considered, we provide closed-form expressions (as expectations of given functions) of the resulting pairwise error probabilities. Performance results are obtained in terms of frame-error rate versus E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , following two different approaches. An analytic approach using large-system asymptotic methods, whereby the system parameters (number of users and antennas, spreading gain) are assumed to grow to infinity with finite limiting ratios. A computer-simulation approach is used to illustrate the differences between asymptotic and simulation results

A Systematic Approach to Multistage Detectors in Multipath Fading Channels

We consider linear multistage detectors with universal (large system) weighting for synchronous code-division multiple access (CDMA) in multipath fading channels with many users. A convenient choice of the basis of the projection subspace allows a joint projection of all users. Taking advantage of this property, the complexity per bit of multistage detectors with universal weights scales linearly with the number of users on the uplink CDMA channel, while other known multistage detectors with universal weights and different bases of the projection subspace keep the same quadratic complexity order per bit as the linear minimum mean-square error (LMMSE) detector. We focus on the design of two kinds of detectors with linear complexity. The detector of Type I is obtained as an asymptotic approximation of the polynomial expansion detector proposed by Moshavi et al. The detector of Type II has the same performance as the multistage Wiener filter (MSWF) in large systems. Additionally, general performance expressions for large systems, applicable to any multistage detector with the same basis of the projection subspace (e.g., linear parallel interference canceling detectors), are derived. As a by-product, the performance analysis disproves the widespread belief that the MSWF and the polynomial expansion detector are equivalent. We show that, in general, the MSWF outperforms the latter one and they are equivalent only asymptotically in the case of equal received powers.

Codeword optimization for uplink CDMA dispersive channels

We present the application of greedy interference avoidance methods to codeword optimization in the uplink of a code division multiple access (CDMA) system in which the channel between a given user and the base station receiver is assumed known and stable for the duration of the transmission. Repeated application of greedy interference avoidance monotonically increases sum capacity and yields an optimal codeword ensemble that satisfies a simultaneous water-filling distribution. However, algorithms for codeword optimization based on the greedy interference avoidance procedure are in general different from water-filling schemes. We illustrate the algorithms with examples and look at properties of optimal codeword ensembles.