Soft handoff provided in CDMA cellular system has much advantage such as better service quality, interference control and low call dropping probability. In this paepr, we propose an optimum resource reservationscheme for handoff calls in the CDMA cellular system to increase the soft handoff probability in handoff. In the proposed scheme, resources of each frquency channel are reserved for handoff according to the number of its neighbot cells serving the same frequency channel. A performance analysis shows that the soft handoff probability of the proposed scheme is higher than that of conventional scheme disregarding the condition of frquency assignment of neighbot cells, and that ever frequency channel served by neighbor cells should reserve more than one traffic channel for handoff to get good performance.

In this paper, perfodrmance of matched-filter (MF) acquisition scheme is analyzed for a direct-sequence/code-division-multiple-access (DS/CDMA) system in a microcellular environment. Mean acquistion time is used as a performance measure. It is demonstrated that acquisition performance is enhanced using interference suppression filter in a Rician fading channel. To apply for multiuser environments, multiple access interference is considered in the performance analysis. From the numerical results, it is shown that mean acquistion time decreases with the increasing SNR/chip, and acquisition performance is improved as the number of taps of interference suppression filter. It is also shown that mean acquisition time increases with the number of users in the system, and acquistion performance is degraded as the icrease of narrowband interference bandwidth. The analysis in this paper can be applied to a DS/CDMA overlay environment.

In this paper, we propose a tunable drop/pass filter in the form of composed of Mach-Zehnder interferometer, to which a fiber grating and two PZTs are attached. The proposed drop/pass filter drops a part of signal power at a specific wavelength and pass the remnant of the signal to the next node in WDM network. Our simulation results show that the optical feedback is less than 2% and the drop to pass ratio can be made bigger than 10% if the phase difference between the two arms is within .+-.0.2.pi. from (2m+1).pi.. Also, the output powers at drop prot and pass port are measured to be maximum at the phase difference of .pi./2 and .pi., respectively, as expected.

In this paper, we propose a locating strategy using a cache based on the distributed call processing stucture. In our stategy, each originating call server, withc is responsible for call setup, has a cache to memorize the service ratio of call server which serves the called terminal.We present performance comparison of the proposed strategy with the existing strategy via simulation. We can reduce the cost for call setup because the originating call server can simpley establish a call without tracing the location of the called terminal. The proposed strategy also reduceds network loads caused by signaling at call setup time and lessens the frequency of queries for the database systems which can be a bottleneck when it serves many subscriber.

We implemented a code searcher which is used for the PN(pseudo noise) code acquisition in CDMA cellular mobile station. To reduce the reuired hardware and the code acquisition time, we used the double dwell structure which is an effective serial code acquisition metho. We designed a code acquisition has acquired within 1/2 PN chip range. The code searcher is implemented using 0.8 micron code searcher is successfully working in CDMA cellular mobile station and it satisfies the code acquisition time specified in IS-95 standard.

To design a ATM Switch which ahs advantages in high sped packet switching, it is essential to set multiple paths between input ports and output ports and to design a new packet transfer technique on that paths for decreasing Packet Loss by conflicts in internal Switch Plane. We propose new packet transfer method, Alternate Path Transfer Mechanism by Dynamic Bypass Transfer Method which can solve conflict problem in Banyan network easily. Proposed ATM Switch consists of Banyan networks, Input/Ouput Port, Bypass Link, and Bypass Link Controller. Packets caused conflicts in SEs have another chances of packet transfer over alternate switching planes by using this mechanism.

In distributed autonomous robotic systems, each robot must behaves by itself according to the its states and environements, and if necessary, must cooperates with other orbots in order to carray out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, the new learning and evolution method based on reinforement learning having delayed reward ability and distributed genectic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. Reinforement learning having delayed reward is still useful even though when there is no immediate reward. And by distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the perfodrmance of evolution, selective crossover using the characteristic of reinforcement learning is adopted in this paper, we verify the effectiveness of the proposed method by applying it to cooperative search problem.

The effects of time-sampling on linear output regulation problem is ivestigated. It is found that the solvability of linear output regulation problem is generally not robust with respect to time-sampling although the solvability of that for single inut and single output linear systems and the solvability of linear robust output regulation problem are preserved under time-sampling. The resutls imply that one needs to seek a better approximate sampled-data output regulator.

In this paper, we propose a new fractal image decoding algorithm with fast convergence speed by using the data dependence and the improved initial image estimation. Conventional method for fractal image decoding requires high-degrdd computational complexity in decoding process, because of iterated contractive transformations applied to whole range blocks. On proposed method, Range of reconstruction imagte is divided into referenced range and data dependence region. And computational complexity is reduced by application of iterated contractive transformations for the referenced range only. Data dependence region can be decoded by one transformations when the referenced range is converged. In addition, more exact initial image is estimated by using bound () function in case of all, and an initial image more nearer to a fixed point is estimated by using range block division estimation. Consequently, the convergence speed of reconstruction iamge is improved with 40% reduction of computational complexity.

The range image is divided into surface regions which are homogeneous in their intrinsic properties. In this paper, we use cooperative relaxational algorithm between curvatures to escape local minima and choose optimal possibility to reserve edge. Cooperative relaxational algorithm between curvatures is relaxation process in which weights of center pixel;s and neighbor pixel's possiblility are determined adaptively by using deviation of curvatures. Experimental resutls show that the proposed method segments and classifies the range images more accurately compared to the other relational algorithms.

This paper proposes a new gray-level image segmentation method using GA(genetic algorithm) and an ACA(adaptive clustering algorithm). The solution in the general GA can be moving because of stochastic reinsertion, and suffer from the premature convergence problem owing to deficiency of individuals before finding the optimal solution. To cope with these problems and to reduce processing time, we propose the new GBR algorithm and the technique that resolves the premature convergence problem. GBR selects the individual in the child pool that has the fitness value superior to that of the individual in the parents pool. We resolvethe premature convergence problem with producing the mutation in the parents population, and propose the new method that removes the small regions in the segmented results. The experimental results show that the proposed segmentation algorithm gives better perfodrmance than the ACA ones in Gaussian noise environments.