Rake Combiners Research Articles

QR Decomposition-Based Antenna Selection for Spatial Multiplexing UWB Systems with Zero-Forcing Detectors Followed by Rake Combiners

This letter presents a criterion for selecting a transmit antenna subset when ZF detectors followed by Rake combiners are employed for spatial multiplexing (SM) ultra-wideband (UWB) multiple input multiple output (MIMO) systems. The presented criterion is based on the largest minimum post-processing signal to interference plus noise ratio of the multiplexed streams, which is obtained on the basis of QR decomposition. Simulation results show that the proposed antenna selection algorithm considerably improves the BER performance of the SM UWB MIMO systems when the number of multipath diversity branches is not so large and thus offers diversity advantages on a log-normal multipath fading channel.

Multiple Rake Combiners and Performance Improvement in 3G and Beyond WCDMA Systems

We propose an efficient code-assignment scheme utilizing multiple rake combiners to avoid the code-blocking problem in third-generation (3G) and beyond wideband code-division multiple-access (WCDMA) systems based upon orthogonal variable spreading factor (OVSF) channelization codes. The multiple rake combiners are required to be equipped with each base station (BS) and user equipment (UE). The major benefit of the proposed assignment scheme is in handling nonquantized data rates, making internal code fragmentation approximately zero. The task of code assignment to handle quantized data rates is divided into three steps. In the first step, the number of terms satisfying the capacity equation is found. The code combinations for all the terms in step 1 are found in step 2, which can be further subdivided into terms producing unique combinations and multiple combinations of terms. The procedure for finding the optimal code combination according to the number of rake combiners available at the UE and BS is given in step 3. Simulation results show the performance improvement in terms of reduction in blocking probability compared with existing single-code assignment schemes.

Single Code-Based Dynamic Grouping with Cycle Interleaving Algorithm for Reducing Waste Rate in WCDMA Cellular Networks

3G must offer high data rates since it should support real-time multimedia services; one performance enhancement, the use of the OVSF code tree, has adopted in 3G WCDMA networks. Unfortunately, this technique allows the link capacity to be set at the base rate times powers of two. This results in wasting bandwidth while the required rate is not powers of two of the basic rate. Several multi-code assignment mechanisms have been proposed to reduce the waste rate, but incur some drawbacks, including high complexity of handling multiple codes and increasing cost of using more rake combiners. Our solution is a dynamic grouping code assignment that allows any rate to be achieved with a single code for any possible rate of traffic. The dynamic grouping approach first forms several calls into a group. It then allocates a subtree to the group and dynamically shares the subtree codes based on time-sharing of slots within a group cycle time. The waste rate and code blocking is thus reduced significantly. Since transmission delay and jitter may occur in such a time-sharing approach, two schemes of cycle interleaving are proposed to minimize delay and jitter. Numerical results demonstrate that the proposed approach reduces the waste rate and increases the system utilization obviously, and the proposed cycle interleaving schemes minimizes delay and jitter significantly.

Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper.

Markov Decision Process Based Multiple Codes Assignment in UMTS WCDMA Mobile Networks

For achieving high transmission rate in mobile multimedia communications, 3G WCDMA systems adopt the Orthogonal Variable Spreading Factor (OVSF) code tree to assign a single channelization code for each accepted connection. Based on the orthogonal characteristic of an OVSF code tree, an allocated code blocks the channelization codes that are on the descendant branches and the ancestral codes of the allocated code. Several researches have been proposed to overcome the code-blocking problem for maximizing system utilization. By using both the code assignment and reassignment mechanisms, the system utilization and code blocking can be improved. Nevertheless, the data rate of traffic classes in such single code assignment system should be powers of two of the basic rate, which is impractical and wastes the system capacity when the required rate is not powers of two of the basic rate. A good solution is to assign multiple codes to a new connection, but causes two drawbacks: high complexity of handling multiple codes and high cost from using more number of rake combiners. Consequently, there is a trade-off between waste rate and complexity of handling multiple codes assignments. In previous researches, high computation complexity of assigning multiple codes for a connection and large number of reassignment codes suppressed the advantage of reducing waste rate. Therefore, we propose an adaptive efficient partition algorithm with the Markov Decision Process (MDP) analysis approach to reduce the large number of reassignment codes while improving waste rate. There are two main motivations in the proposed approach. First, we propose an adaptive efficient partition algorithm to determine multiple codes based on the current state of the OVSF code tree for the new incoming connection. Second, after determining the multiple codes, we adopt the MDP analysis to assign the least-cost code for each determined code. Numerical results demonstrate that the proposed MDP approach yields the least number of reassignments and the least number of codes per connection while reducing waste rate significantly, as compared to other approaches.

An Efficient Adaptive Grouping for Single Code Assignment in WCDMA Mobile Networks

For achieving high utilization and efficient code management of the OVSF code tree in 3G WCDMA networks, several researches have extensively studied. Based on combining both the code assignment and the reassignment mechanisms, it increases obviously high utilization and reduces completely the code blocking. Nevertheless, the required rate of traffic should be powers of two of the basic rate, i.e. 1R, 2R, 4R, ?, etc., which is impractical and results in wasting the system bandwidth while the required rate is not powers of two of the basic rate. Several multi-code assignment mechanisms have proposed to reduce the waste rate. Nevertheless, these methods bring two inevitable drawbacks including, high complexity of handling multiple codes, and increasing the cost of using more rake combiners at both the base stations and mobile nodes. Therefore, we propose an adaptive grouping code assignment herein to provide a single channelization code for any possible rate of traffic, even though the required rate is not powers of two of the basic rate. Based on the dynamic programming algorithm, the adaptive grouping approach forms several calls into a group. Then it allocates a subtree to the group and adaptively shares the subtree codes for these calls in the concept of time-sharing of slots during a group cycle time. Therefore, the waste rate and code blocking are thus reduced obviously while using a single rake combiner. Since the delay problem may be occurred in such a time-sharing approach, we propose two schemes of cycle interleaving methods to reduce delay. Numerical results indicate that the proposed adaptive grouping approach reduces significantly the waste rate and thus increases the system utilization. Moreover, the proposed cycle interleaving scheme reduces data delay significantly.

Multicode-based WCDMA for reducing waste rate and reassignments in mobile cellular communications

The third generation (3G) mobile communications are proposed to accomplish high data rate for personal multimedia communications. To achieve that, the UMTS standards adopt the orthogonal variable spreading factor (OVSF) code tree to assign a single channelization code for each accepted connection at the Wideband CDMA air interface. Nevertheless, there are two drawbacks within it, including code blocking and waste of the system bandwidth. One good solution for reducing waste rate is to adopt the mechanism of multiple codes assignment, in which each accepted connection can be assigned several codes for achieving that the summation rate of these codes is satisfied the required rate. Therefore, the waste rate can be reduced significantly; nevertheless, it brings some overhead, including large number of reassignments, long connection setup delay and computation complexity, and cost of using multiple rake combiners. Therefore, we propose herein an efficient multicode assignment algorithm to reduce the waste rate while reducing large number of reassignments. The motivation of this approach is to reserve high-rate codes for next arrival calls with concerning the current state of the OVSF code tree. Consequently, it makes the tree compact and thus obviously reduces the number of code reassignments. Since there is a trade-off between the waste rate and the number of rake combiners, the optimal number of rake combiners for multicode assignment is analyzed and thus minimizes the cost of rake combiner. Numerical results demonstrate that the proposed approach yield the least number of reassignments while reducing the waste rate significantly as compared to other approaches.

BER sensitivity to mistiming in ultra-wideband impulse radios - part II: fading channels

We investigate timing tolerances of ultra-wideband (UWB) impulse radios. We quantify the bit-error rate (BER) sensitivity to epoch timing offset under different operating conditions, including frequency-flat fading channels, dense multipath fading channels, multiple access with time hopping, and various receiver types including sliding correlators and RAKE combiners. For a general correlation-based detector, we derived in Part I unifying expressions for the decision statistics as well as BER formulas under mistiming, given fixed channel realizations. In Part II, we provide a systematic approach to BER analysis under mistiming for fading channels. The BER is expressed in terms of the receiver's energy capture capability, which we quantify under various radio operating conditions. We also develop the optimal demodulator in the presence of timing offset and show a proper design of the correlation-template that is robust to mistiming. Through analyses and simulations, we illustrate that the reception quality of a UWB impulse radio is highly sensitive to both timing acquisition and tracking errors.

BER sensitivity to mistiming in ultra-wideband impulse Radios-part I: nonrandom channels

We investigate timing tolerances of ultra wideband (UWB) impulse radios. We quantify the bit-error-rate (BER) sensitivity to epoch timing offset under different operating conditions, including frequency flat fading channels, dense multipath fading channels, multiple access with time hopping, and various receiver types including sliding correlators and RAKE combiners. Our systematic approach to BER derivations under mistiming can be extended to a wide range of channel fading types. Through analyses and simulations, we illustrate that the reception quality of a UWB impulse radio is highly sensitive to both timing acquisition and tracking errors. In particular, time-hopping-based multiple-access systems exhibit little tolerance to acquisition errors, and the energy capture capability of a RAKE combiner can be severely compromised by mistiming.

An OVSF code assignment scheme utilizing multiple RAKE combiners for W-CDMA

Orthogonal variable spreading factor (OVSF) codes have been proposed as the channelization codes used in the wideband CDMA access technology of IMT-2000. OVSF codes have the advantages of supporting variable bit rate services, which is important to emerging multimedia applications. The objective of OVSF code assignment algorithm is to minimize the probability of code request denial due to inappropriate resource allocation. In this paper, we propose an efficient OVSF code assignment scheme that utilizes multiple RAKE combiners in user equipments. Our approach finds in constant time all feasible codewords for any particular request, trying to minimize both rate wastage and code fragments. When working together with an independent code replacement scheme, our approach has the same code request denial rate as previous work but has lower code management overhead. If code replacement is not used, our approach still has a bit of improvement on request denial rate.