If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (Pn) can be obtained at the expense of increase in dropping handoff calls (Ph). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low Ph, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that Ph should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of Ph, which can be prespecified by a system engineer.

A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.

Recent work has shown that the usage of multiple antennas at the transmitter and receiver in a flat fading environment results in a linear increase in channel capacity. But increasing the number of antennas induces the higher hardware costs and computational burden. To overcome those problems, it is effective to select antennas appropriately among all available ones. In this paper, a new antenna selection method is proposed. The transmit antennas are selected so as to maximize the channel capacity using the genetic algorithm (GA) which is the one of the general random search algorithm. The results show that the proposed GA achieves almost the same performance as the optimal selection method with less computational amount.

This paper proposes an adaptive transmission scheme for MIMO systems to provide different bit error rates and transmission rates for multimedia traffic. The adaptive transmission scheme allocates antennas, rate and power jointly according to the feedback information to satisfy the diverse QoS requirements of the multimedia traffic. Furthermore, an efficient search algorithm with low complexity is proposed for practical implementation. Simulation results show that the proposed scheme improves the spectral efficiency while guaranteeing the QoS requirements of multimedia traffic. Moreover, the proposed search algorithm achieves close optimal performance with great complexity reduction.

This letter describes experiments conducted to measure the interference effects of two kinds of UWB sources, which are OFDM UWB source and pulse radio UWB source, to broadcasting relay system and SDMB system. The received power degradation of a broadcasting system is presented. experimental results show that UWB system can coexist 35 m distance as close as to in-band broadcasting network and can also coexist 1.8 m as close as with the SDMB terminal without causing any dangerous interference.

High-resolution FMCW reflectometry is often realized by sampling the beat signal with a clock signal generated from an auxiliary interferometer. The drawback of this system is that the measurement range is limited to less than half of the optical path difference of the auxiliary interferometer to satisfy the Sampling theorem. We propose and demonstrate a method to extend the measurement range of the system. The clock signal gerenerated from the auxiliary interferometer is electronically frequency-multipled by using a PLL circuit. The measurement range is experimentally extended by a factor of 20 while keeping high spatial resolution, and is theoretically extended by a factor of 128. The advantage of the proposed system is that the optical path difference of the auxiliary interferometer can be kept short, which is very effective for obtaining the stable and low time-jitter clock signal.

In this paper, we study the problem of perfect tracking control of nonminimum phase systems in magnetic levitation system. Generally, perfect tracking control schemes cannot be applied to nonminimum phase plants because of unstable pole-zero cancellations. Although the method of state matching using multirate feedforward control to realize perfect tracking control have been proposed, the oscillation restraint and the feasibility in nonminimum phase system cannot be satisfied at same time. We propose a method using the difference of state variables to generate a smooth desired state variable trajectory in the discrete-time systems. The techniques we proposed are applicable to nonminimum phase discrete-time systems and the oscillations between the sampling points are well restrained. We will show that the structure of the proposed perfect tracking controller is very simple and clear. Finally, computer simulations and experiment results based on magnetic levitation apparatus are presented.

Interfaces between a coaxial structure and a post-wall waveguide are proposed as the essential components for cost-effective millimeter-wave modules. PTFE substrate is selected in terms of loss and manufacturability. The reflection and the transmission characteristics are investigated. The short-stepped and the short-taper-stepped feeding structures provide 14.7% and 13.2% bandwidths for the reflection smaller than -15 dB, respectively. The 4640 mm2 size antenna fed by the short-stepped structure in PTFE substrate gives 27.3 dBi with 58.2% efficiency at 60.0 GHz. Feeding structures in PTFE substrate fulfill electrical and manufacturing demands in millimeter-wave bands.

The present letter deals with the blind equalization problem of a single-input single-output infinite impulse response (SISO-IIR) channel with additive Gaussian noise. To solve the problem, we propose a new criterion for maximizing constrainedly a fourth-order cumulant. The algorithms derived from the criterion have such a novel property that even if Gaussian noise is added to the output of the channel, an effective zero-forcing (ZF) equalizer can be obtained with as little influence of Gaussian noise as possible. To show the validity of the proposed criterion, some simulation results are presented.

A new control scheme is proposed to improve the system performance for discrete-time fuzzy systems by tuning control grade functions using neural networks. According to a systematic method of constructing the exact Takagi-Sugeno (T-S) fuzzy model, the system uncertainty is considered to affect the membership functions. Then, the grade functions, resulting from the membership functions of the control rules, are tuned by a back-propagation network. On the other hand, the feedback gains of the control rules are determined by solving a set of LMIs which satisfy sufficient conditions of the closed-loop stability. As a result, both stability guarantee and better performance are concluded. The scheme applied to a truck-trailer system is verified by satisfactory simulation results.

Based on recent results for 2-D continuous-discrete systems, this paper develops 2-D Laplace-z transform, which can be used to analyze 2-D continuous-discrete signals and system in Laplace-z hybrid domain. Current 1-D Laplace transformation and z transform can be combined into the new 2-D s-z transform. However, 2-D s-z transformation is not a simple extension of 1-D transform, in 2-D case, we need consider the 2-D boundary conditions which don't occur in 1-D case. The hybrid 2-D definitions and theorems are given in the paper. To verify the results of this paper, we also derived a numerical inverse 2-D Laplace-z transform, applying it to show the 2-D pulse response of a stable 2-D continuous-discrete system.

The average performance of a single-user MIMO system under spatially correlated fading and with different types of CSI at the transmitter and with perfect CSI at the receiver was studied in recent work. In contrast to analyzing a single performance metric, e.g. the average mutual information or the average bit error rate, we study an arbitrary representative of the class of matrix-monotone functions. Since the average mutual information as well as the average normalized MSE belong to that class, this universal class of performance functions brings together the information theoretic and signal processing performance metric. We use Lowner's representation of operator monotone functions in order to derive the optimum transmission strategies as well as to characterize the impact of correlation on the average performance. Many recent results derived for average mutual information generalize to arbitrary matrix-monotone performance functions, e.g. the optimal transmit strategy without CSI at the transmitter is equal power allocation. The average performance without CSI is a Schur-concave function with respect to transmit and receive correlation. In addition to this, we derive the optimal transmission strategy with long-term statistics knowledge at the transmitter and propose an efficient iterative algorithm. The beamforming-range is the SNR range in which only one data stream spatially multiplexed achieves the maximum average performance. This range is important since it has a simple receiver structure and well known channel coding. We entirely characterize the beamforming-range. Finally, we derive the generalized water-filling transmit strategy for perfect CSI and characterize its properties under channel correlation.

We propose a new analysis technique against a class of countermeasure using randomized binary signed digit (BSD) representations. We also introduce some invariant properties between BSD representations. The proposed analysis technique can directly recover the secret key from power measurements without information for algorithm because of the invariant properties of BSD representation. Thus the proposed attack is applicable to all countermeasures using BSD representations. Finally, we give the simulation results against some countermeasures using BSD representation such as Ha-Moon method, Ebeid-Hasan method, and the method of Agagliate et al. The results show that the proposed attack is practical analysis method.

Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently. For this reason, they are suitable candidates for implementations on low-end processors. However, such devices are often vulnerable to side channel attacks. In this paper, we propose a new countermeasure against side channel attacks on Koblitz curves, which utilizes a fixed-pattern recoding to defeat simple power analysis. We show that in practical cases, the recoding can be performed from left to right, and can be easily stored or even randomly generated.

The performance of the vehicular communication links used for Intelligent Transport Systems is investigated. Intervehicle communication (IVC) and combined vehicular communication implemented by IVC and additional communication media are studied and their performance is explicitly described. Through numerical studies, it is shown that performance varies according to parameter values such as the mean space headway, the speed of the vehicles, and the penetration ratio of the IVC device. To achieve a given level of performance, I propose (i) a design of the information delivery delay of additional communication media and (ii) a method determining the appropriate delay.

A realistic computer graphics (CG) model of root growth that accounts for the effects of soil obstruction and moisture variations is proposed. While the exposed parts of plants have been modeled extensively in CG, realistic root models have received little attention, and the potential effects of root characteristics on the growth of foliage has yet to be considered in detail. The proposed model represents roots as series of bend points and link points and defines the root systems as a layered structure formed by roots connected via link points. This approach allows for two general types of root systems based on branching probabilities of lateral and adventitious roots: main root systems consisting of a thick main root and thinner lateral roots, and fibrous root systems consisting of adventitious roots of relatively uniform diameter. The model also expresses the behavior of root growth in terms of hydrotropism, gravitropism, flexion and growth inhibition by assigning gravity, moisture and consistency parameters to underground voxels. The model is shown through simulations of various growth conditions to generate individualized root systems that reflect the growth environment and characteristics of the plant.

This paper proposes a low complexity composite CDMA system based on MIMO (Multiple-Input-Multiple-Output) processing and LDPC (low-density parity-check) codec based a CDMA system, which works well even if the complicated case of multipath, multiusers and short length LDPC codes. To explore the practical application, the mobile user in the composite CDMA systems is with only two antennas and adopts short length irregular LDPC codec, each user's data has been divided two LDPC encoded substreams being sent to two transmitter antennas at base station. Since the LDPC encoded substreams of reaching the mobile user are orthogonal to each other in space and time, the CDMA system performances (BER and SINR) can be improved much, but the multipath may ruin the orthogonalilty. To solve the problems, the paper provides the algorithms of main function modules of transmitter and receivers, gives a simple method to test the girth of LDPC codes, and analyzes the performance of MIMO-LDPC CDMA systems theoretically and experimentally. The simulation results show that the hybrid CDMA systems can have better performance than the conventional CDMA systems based on single transmitted antenna at a base station.

This paper proposes a Weil descent attack against elliptic curve cryptosystems over quartic extension fields. The scenario of the attack is as follows: First, one reduces a DLP on a Weierstrass form over the quartic extention of a finite field k to a DLP on a special form, called Scholten form, over the same field. Second, one reduces the DLP on the Scholten form to a DLP on a genus two hyperelliptic curve over the quadratic extension of k. Then, one reduces the DLP on the hyperelliptic curve to one on a Cab model over k. Finally, one obtains the discrete-log of original DLP by applying the Gaudry method to the DLP on the Cab model. In order to carry out the scenario, this paper shows that many of elliptic curve discrete-log problems over quartic extension fields of odd characteristics are reduced to genus two hyperelliptic curve discrete-log problems over quadratic extension fields, and that almost all of the genus two hyperelliptic curve discrete-log problems over quadratic extension fields of odd characteristics come under Weil descent attack. This means that many of elliptic curve cryptosystems over quartic extension fields of odd characteristics can be attacked uniformly.

In this letter, multi user detection process in Code Division Multiple Access (CDMA) is performed by fuzzy inference system (FIS) and the bit error rate (BER) performance was compared with the single user bound, the matched filter receiver and neural network receiver. The BER performance of the matched filter receiver degrades as the number of the active users and the power level differences among the users increase. The neural network receiver needs the training process. Optimal receiver that has the best BER performance is too complex for practical application. The BER performance near the optimal case was obtained with the proposed receiver. The proposed receiver uses the FIS without training process and it has lower time complexity than the optimal receiver.

The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems. The b-matching problem and its generalization provide canonical examples of M-convex functions on jump systems. In this paper, we propose a steepest descent algorithm for minimizing an M-convex function on a constant-parity jump system.