Code placement and replacement strategies for wideband CDMA OVSF code tree management

The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two important issues in such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and, thus, code blocking probability, while the latter may affect the code reassignment cost if dynamic code assignment is to be conducted. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs. Earlier studies about these two problems either do not consider the structure of the OVSF code tree or cannot utilize the OVSF codes efficiently. To reduce the call blocking probability and the code reassignment cost, we propose two simple yet efficient strategies that can be adopted by both code placement and code replacement: leftmost and crowded-first. Numerical analyses on call blocking probability and bandwidth utilization of OVSF code trees when code reassignment is supported are provided. Our simulation results show that the crowded-first strategy can significantly reduce, for example, the code blocking probability by 77 percent and the number of reassignments by 81 percent, as opposed to the random strategy when the system is 80 percent fully loaded and the max SF = 256.     

Orthogonal variable spreading codes for wideband CDMA

Orthogonal codes of variable lengths are essential for multirate services in the Third-Generation Partnership Project (3GPP). We propose an alternative to Walsh functions for variable spreading codes. There are three important points. First, we design an orthogonal code of constant length by mapping the points of a set of finite projective planes to chips of high/low amplitudes. Second, we develop variable spreading codes using multiple layers of recursion. Last, we compare and contrast the proposed variable spreading technique with Walsh functions in terms of ease of synchronization, blind-rate detection and wideband characteristics     

Spreading codes for direct sequence CDMA and wideband CDMA cellularnetworks

This article presents an overview of the spreading techniques for use in direct sequence CDMA cellular networks. We review the theoretical background for sequences used in CDMA and wideband CDMA, and discuss the main characteristics of the maximal length, Gold (1967, 1968), and Kasami sequences, as well as variable- and fixed-length orthogonal codes. We also describe different methods of multiple spreading for channelization and scrambling in CDMA and W-CDMA realizations     

Multicode multirate compact assignment of OVSF codes for QoS differentiated terminals

Orthogonal variable spreading factor (OVSF) codes are used in both universal terrestrial radio access-frequency division duplex (UTRA-FDD) and time division duplex (UTRA-TDD) of the third-generation (3G) mobile communication systems. They can support multirate transmissions for mobile terminals with multicode transmission capabilities. In this paper, a new OVSF code assignment scheme, namely "multicode multirate compact assignment" (MMCA), is proposed and analyzed. The design of MMCA is based on the concept of "compact index" and takes into consideration mobile terminals with different multicode transmission capabilities and different quality of service (QoS) requirements. Priority differentiation between multirate realtime traffic and best-effort data traffic is also supported in MMCA. Analytical and simulation results show that MMCA is efficient and fair.     

Vacant codes grouping and fast OVSF code assignment scheme for WCDMA networks

Channelization codes used in WCDMA are Orthogonal Variable Spreading Factor (OVSF) codes. These codes suffer from code blocking limitation. Many designs are proposed to avoid this limitation but most of them do not consider number of codes searched, which affects call establishment delay prior to handling a call. We propose a fast OVSF code assignment design which aims to reduce number of codes searched with optimal/suboptimal code blocking. The code assignment scheme aims to use those vacant codes whose parents are already blocked. This leads to occurrence of more vacant codes in groups, which ultimately leads to less code blocking for higher rate calls. The number of codes searched increases linearly in our design compare to most of other novel proposed single code methods like crowded first assignment, where it increases exponentially with increase in user rates. Also the calculation of vacant codes at one layer will be sufficient to identify the vacant code adjacency for all the layers which reduces complexity. Simulation results are presented to verify the superiority of the design.     

OVSF code channel assignment with dynamic code set and buffering adjustment for UMTS

The Universal Mobile Telecommunications System (UMTS) provides users variable data rate services, which adopts wide-band code-division multiple-access (WCDMA) as the radio access technology. In WCDMA, orthogonal variable spreading factor (OVSF) codes are assigned to different users to preserve the orthogonality between users' physical channels. The data rate supported by an OVSF code depends on its spreading factor (SF). An OVSF code with smaller SF can support higher data rate services than that with larger SFs. Randomly assigning the OVSF code with a large SF to a user may preclude a larger number of OVSF codes with small SFs, which may cause lots of high data rate call requests to be blocked. Therefore the OVSF code assignment affects the performance of the UMTS network significantly. In this paper, we propose two OVSF code assignment schemes CADPB1 and CADPB2 for UMTS. Both schemes are simple and with low system overhead. The simulation experiments are conducted to evaluate the performances for our schemes. Our study indicates that our proposed schemes outperform previously proposed schemes in terms of the weighted blocking probability and fairness index. Our schemes improve the call acceptance rate by slightly introducing call waiting time.     

Distributed arbitration scheme for on-chip CDMA bus with dynamic codeword assignment

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.     

Channel acquisition for wideband CDMA signals

The scenario considered is one where a single new user is to be acquired on the reverse link by the base station, and where the channel parameters of the interfering users are known. Following a minimum mean squared error (MMSE) strategy for suppressing the multiaccess interference, the parameter estimation problem is posed in a maximum likelihood framework, To reduce complexity, the solution is implemented in two stages: first, the estimated tap delays are restricted to be at chip spacings; second, the number of taps is reduced by allowing for arbitrary spacing between them. The performance of the proposed techniques is studied through numerical simulations. It is shown that significant gains can be obtained by exploiting the structure of the interference and acquiring the channel parameters jointly     

Joint packet scheduling and dynamic base station assignment for CDMA data networks

In current code division multiple access (CDMA) based wireless systems, a base station (BS) schedules packets independently of its neighbours, which may lead to resource wastage and the degradation of the system's performance. In wireless networks, in order to achieve an efficient packet scheduling, there are two conflicting performance metrics that have to be optimized: throughput and fairness. Their maximization is a key goal, particularly in next-generation wireless networks. This paper proposes joint packet scheduling and BS assignment schemes for a cluster of interdependent neighbouring BSs in CDMA-based wireless networks, in order to enhance the system performance through dynamic load balancing. The proposed schemes are based on sector subdivision in terms of average required resource per mobile station and utility function approach. The fairness is achieved by minimizing the variance of the delay for the remaining head-of-queue packets. Inter-cell and intra-cell interferences from scheduled packets are also minimized in order to increase the system capacity and performance. The simulation results show that our proposed schemes perform better than existing schemes available in the open literature. Copyright © 2007 John Wiley & Sons, Ltd.     

Efficient OVSF code assignment and reassignment strategies in UMTS

This paper presents an integrated solution for code management, assignment, and reassignment problems in UMTS. We propose a new architecture for code management and, based upon this new architecture, a code assignment strategy, referred to as "crowded-group first strategy". Our system architecture and code assignment strategy represent significant improvements both in the time complexity and the maintenance complexity. Moreover, the code blocking probability of the crowded-group first strategy is competitive to that of the other strategies. In this paper, we also propose a new code reassignment strategy, called the "crowded-branch first strategy". The main objective of this reassignment strategy is to reduce reassigned call probability with low computation overhead and extend this strategy for the general case. In order to systematically analyze the performances of the code assignment strategy, we implement a simulator to analyze the code selection behavior and code blocking probability of each strategy. Moreover, we propose some new performance metrics, named "weighted code blocking", "reassigned call probability", and "ratio of actual code reassignments", in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our proposed strategies efficiently utilize the OVSF codes with low computation overhead.     

Downlink throughput optimization for wideband CDMA systems

This article examines the optimization of throughput in a wireless system. A mathematical model is outlined for a cellular wideband CDMA system. In practical cases, where the maximum transmission power is constrained, power control may not be possible. Self-interference limits the total deliverable rate. It is shown that by optimally allocating bit-rate using a dynamic programming algorithm, a higher bit-rate can be delivered within the same power constraint. Simulation results show on average a 20% increase in total delivered rate can be achieved.     

MCI cancellation for multicode wideband CDMA systems

Multicode code division multiple access (CDMA) is a new transmission scheme for flexible and high-speed data communications. The basic idea of multicode CDMA, is to assign multiple channelization codes to any given user. If these channel codes are orthogonal, the self-interference among them can be eliminated in an additive white Gaussian noise (AWGN) channel. However, in a multipath environment, these intrauser signals from different delay paths no longer maintain orthogonality and, thus, cause interference, i.e., multicode interference (MCI), to each other. In high-speed data networks, where the number of users is much less than in the voice networks, the MCI may represent a large portion of the total interference and has a great impact on the system performance. A complex spreading multicode wideband CDMA receiver with RAKE structure and multistage MCI cancellation is studied. By pilot aided channel estimation, the MCI associated with the reference user is regenerated and subtracted from the received signal by a cancellation factor of λ. A complete and consolidated theoretical analysis is presented to show that the system performance is significantly improved by the MCI cancellation. The optimal cancellation factor in the kth stage is approximated by λ_opt^(k)⩽1-2P_e^(k-1) , where P_e^(k-1) the error probability of the (k-1)th stage. The optimal value of each stage can be chosen from 0.5 to 0.85 for a wide range of signal to noise ratios     

High efficiency, wide dynamic range variable gain and poweramplifier MMICs for wideband CDMA handsets

A linearized variable gain amplifier (VGA) and a two-stage power amplifier (PA) MMIC were developed for 1.95-GHz wideband CDMA (W-CDMA) handsets application. A complete PA block with power control ability was obtained by cascading the VGA with the PA. The linearized VGA consists of a predistorter (PD) integrated with a conventional VGA, performing dual function for achieving high linearity power control, as well as reducing output distortion level of the following PA. With the use of predistortion, the P_out and power added efficiency (PAE) of the PA block improved from 27.5 dBm and 39.8% to 28.5 dBm and 44.8%, respectively, measured at -35 dBc adjacent channel leakage power ratio (ACPR). Under power control operation, the control range of the PA block increased from 23.6 dB to 31.2 db, and ACPR reduction of over 10 dB was achieved with the use of linearized VGA     

A transmitter diversity scheme for wideband CDMA systems based onspace-time spreading

We present a transmit diversity technique for the downlink of (wideband) direct-sequence (DS) code division multiple access (CDMA) systems. The technique, called space-time spreading (STS), improves the downlink performance by using a small number of antenna elements at the base and one or more antennas at the handset, in conjunction with a novel spreading scheme that is inspired by space-time codes. It spreads each signal in a balanced way over the transmitter antenna elements to provide maximal path diversity at the receiver. In doing so, no extra spreading codes, transmit power or channel information are required at the transmitter and only minimal extra hardware complexity at both sides of the link. Both our analysis and simulation results show significant performance gains over conventional single-antenna systems and other open-loop transmit diversity techniques. Our approach is a practical way to increase the bit rate and/or improve the quality and range in the downlink of either mobile or fixed CDMA systems. A STS-based proposal for the case of two transmitter and single-receiver antennas has been accepted and will be included as an optional diversity mode in release A of the IS-2000 wideband CDMA standard     

Combined code reuse scheme with two‐dimensional OVSF codes assignment algorithm for uplink multi‐user/multi‐rate block spread multi‐cellular CDMA

The two‐dimensional (2D) block spread code division multiple access (CDMA) can avoid the uplink multiple‐access interference with low‐complexity single‐user detection in a slow fading channel and, therefore, is very attractive. In the 2D spreading, orthogonal variable spreading factor (OVSF) is used for spreading; an important problem is how to efficiently assign the limited resource of OVSF codes to users with different data rates, while meeting the requirement of quality of service in a multi‐cell environment. In this paper, it is shown that the code reuse can improve the code reuse efficiency and the proposed code reuse scheme combined with code assignment algorithm can allow flexible multi‐rate uplink transmission. The computer simulation confirms that the proposed code assignment algorithm improves the code reuse efficiency while achieving lower blocking probability than traditional CDMA. Copyright © 2012 John Wiley & Sons, Ltd.     

Tentative chip decision-feedback equalizer for multicode wideband CDMA

We investigate a chip-level minimum mean-square-error (MMSE) decision-feedback equalizer (DFE) for the downlink receiver of multicode wideband code-division multiple-access systems over frequency-selective channels. First, the MMSE per symbol achievable by an optimal DFE is derived, assuming that all interchip interference (ICI) of the desired user can be eliminated. The MMSE of DFE is always less than or at most equal to that of linear equalizers (LE). When all the active codes belong to the desired user, the ideal DFE is able to eliminate multicode interference (MCI) and approach the performance of the single-code case at high signal-to-noise ratio (SNR) range. Second, we apply the hypothesis-feedback equalizer or tentative-chip (TC)-DFE in the multicode scenario. TC-DFE outperforms the chip-level LE, and the DFE that only feeds back the symbols already decided. The performance gain increases with SNR, but decreases with the number of active codes owned by the other users. When all the active codes are assigned to the desired user, TC-DFE asymptotically eliminates MCI and achieves single-user (or code) performance at high SNR, similarly, to the ideal DFE. The asymptotic performance of the DFE is confirmed through bit error rate simulation over various channels.     

Multicarrier CDMA techniques for future wideband wireless networks

In this paper, multicarrier techniques are considered in the context of the future wideband wireless networks. An overview of the different access schemes based on a combination of code division and multicarrier techniques, such as Multi-Carrier Code Division Multiple Access (MC-CDMA), Multi-Carrier Direct Sequence CDMA (MC-DS-CDMA) and Multi-Tone CDMA (MT-CDMA) is presented first. Afterwards, MC-CDMA systems are considered for the downlink of high rate cellular networks. The performance of different mono-user detection techniques are first analytically estimated and then compared with the help of Monte Carlo simulations for a Rayleigh channel. Simulation results on the performance of mono-user and multi-user detection techniques are also provided for Bad Urban (BU) Hilly Terrain (HT) and Vehicular UMTS channels. With regard to the channel coding, convolutional codes and turbo-codes are considered. Among others, a new linear detection technique named Global Minimum Mean Square Error Algorithm (GMMSE) is compared to multi-user Parallel Interference Cancellation detection technique. It is shown that GMMSE offers good performance especially for non-full load systems. Thus, the efficiency of MC-CDMA as a very promising multiple access and robust modulation scheme is successfully demonstrated for the downlink of the future wideband mobile networks.     

A dynamic CDMA network for multicore systems

Code-division multiple-access (CDMA) is a data transmission method based on the spreading code technology, wherein multiple data streams share the same physical medium with no interference. A novel architecture for on-chip communication networks based on this approach is devised. The proposed design allows sharing coding resources among network?s users through the use of dynamic assignment of spreading codes. Data transmission latency is reduced by adopting a parallel structure for the coding/decoding circuitry. A 14-node CDMA network based on the proposed architecture is synthesised using 65 nm ST technology library. Performance analysis reveals that the proposed approach achieves significantly lower data packet latency compared to both conventional CDMA and packet switched network-on-chip implementations. Large area and power savings compared to existing approaches are also obtained.     

Address codes for use in all-optical CDMA systems

The authors present new address codes for all-optical code division multiple access (CDMA) systems. The use of the proposed code can strictly guarantee the peaks of all the cross-correlation functions and all the sidelobes of any auto-correlation function to be `l' in such applications as purely asynchronous data transmission and ultrafast switching. The theory of the new codes is also reported