In the conventional antenna system for the handset, some gain degradation has been observed when an operator holds the handset. This is caused by the variation of the current on the conducting box used in the handset due to the body effect. This paper presents (1) design concept of antenna for the handset and (2) analysis of a newly proposed loop antenna system, which has the balance structure for the antenna feed to reduce the effect of currents on the conducting box. In order to confirm the effectiveness of using the balance-fed loop antenna, a simple model using a small loop antenna mounted on a ground plane is analyzed. The current distribution for the balance-fed loop antenna system is obtained calculatedly and also experimentally and is compared with that for the unbalance-fed loop antenna system. In a result, remarkable decrease in the current distribution on the ground plane for the case of the balance-fed antennas system is shown. Calculated results are in good agreement with measured results.

This paper discusses microwave path-loss characteristics as a function of mobile antenna height in an urban line-of-sight environment. Measurements were made in metropolitan Tokyo with high-density buildings, using base station antenna heights of 4 and 8 m. We describe the path-loss characteristics of vehicle-mounted mode (mobile antenna height is 2.7 m) and portable mode (mobile antenna heights are 1.6 and 0.5 m). Dependence of path loss on the distance between base and mobile stations was analyzed. This reveals that the break points shift to the near side in the vehicle-mounted mode. This phenomenon can be interpreted by the existence of an effective height h of the road. The typical value of h was found approximately 1.4 m. In the portable mode, on the other hand, break points were not observed. The mobile antenna heights (1.6 and 0.5 m) in this mode are close to or less than the average height (1-2 m) of pedestrians on the sidewalk; and the received waves at the mobile station are often disturbed by pedestrians. This explains the nonexistence of break points in portable mode. The average attenuation coefficients is observed 3.2 in this mode. The attenuation coefficients tend to be larger at lower base station antenna heights and narrower road widths.

This paper proposes an adaptive transmission control scheme for code-division multiple-access (CDMA) cellular slotted-ALOHA systems. This scheme adaptively controls the target received power and the processing gain according to both channel load and location of the mobile station. The target received power of each mobile station is controlled so that the difference between the target received powers by distance becomes large under heavy load conditions. As the distance from the base station increases, the target received power becomes smaller. The processing gain of transmitted packets is concurrently controlled with their target received powers. The packets transmitted with low signal power are spread by a large processing gain in order to reduce the unfairness in packet reception. The radio channels with distance attenuation, shadowing, slow Rayleigh fading and imperfect power control are taken into consideration in order to evaluate the performance of this scheme in the case that mobile stations transmit short massages to the base station in cellular environments. Computer simulation validates the effectiveness of this scheme: the capture effect can be achieved under heavy channel loads, and therefore, throughput performance is improved. Detailed evaluation of throughput, packet reception probability and transmission complete probability is presented. The effect of movement of mobile stations is also discussed. Calculated results show that the proposed scheme has superior characteristics and thus can expand the allowable load area in the cellular environments with slow Rayleigh fading channels.

Hierarchical macrocell/microcell architectures have been proposed for future cellular mobile communication. The performance analysis for the hierarchical cellular system becomes an important issue. In this paper, extending the analytical methods from[1][2][8], assuming that the imperfect power control follows log-normal statistics, and employing different attenuation models for macrocells and microcells, the capacity plane and outage probability of the system are examined and quantified with and without perfect sectorization. From the numerical results of parameters of IS-95 protocol, the high user capacity and lower outage probability may be expected in the case of relatively tight power control and narrower overlap between sectors. These results are compared with the previously published CDMA nonhierarchical cellular system estimation. When we employ the hierarchical cellular system, we can increase the user capacity 2.3 times with the same bandwidth 1.25 MHz than the one of the nonhierarchical cellular system.

This paper describes a forward subchannel control of multi-carrier scheme intended to compensate for phase/amplitude distortions under frequency selective fading. The forward subchannel control scheme is used for a Time Division Duplex (TDD) multi-carrier system on up-link. The forward subchannel control scheme provides forward subchannel control of phase/amplitude variation and subchannel assignment control. These controls are applied before transmission of an up-link signal. The forward control parameters are estimated by a preamble down-link signal. Simulation results clarify that the BER performance with the forward subchannel control scheme shows a superiority of more than one order at the condition of 22 dB of E_b/N₀ and 400 Hz of fading frequency.

Multi-ary Trellis-Coded Modulation (TCM) schemes have been studied for use with digital radio communication systems. Among these TCM schemes, we have already reported the optimum signal constellation of a rate-3/4 trellis-coded (TC) 16-ary Amplitude and Phase Shift Keying (APSK) scheme and computed the minimum Euclidean distance: d_free. In this paper, we evaluate other performance parameters: N_free and bit error rate (BER) over an additive white Gaussian noise channel, and further investigate the various signal constellations of rate-4/5 TC 32-APSK schemes. It is found that the BER performances of circular-type signal constellations are superior to that of rectangular-type in the TC 16-APSK, and a (24,8) circular type signal constellation is superior to other constellations in the TC 32-APSK.

Multimedia mobile communication systems with high-speed radio transmission supported by asynchronous transfer mode (ATM) technologies have been intensively studied over the last few years. Smaller radio zones termed microcells and picocells will be used in this kind of mobile communication systems for the purpose of high-speed radio transmission. When the coverage of a radio zone is smaller, the amount of traffic per radio zone is relatively low. It is not possible to use the cable circuits connecting the switch and base stations in an efficient manner because of the lack of the scale effect of traffic. With smaller radio zones, moreover, handoff occurs frequently as a mobile station moves. The switch is required a large capacity to handle the processing of frequent handoffs. This paper proposes a mobile network architecture controlled by the concentrated grouping of base stations. A special feature of this configuration is the ability of the network's switches to efficiently accommodate numerous base stations that control small radio zones. It can also lighten the handoff control load of switches; the effect of handoff frequency reduction is evaluated with computer simulation.

Cell loss is one of the most important metrics of quality of service in ATM mobile communication systems. This loss can be suppressed by introducing buffer memories in the network, but that sacrifices delay. This paper proposes a lossless handover scheme for ATM mobile communication networks that can suppress delay fluctuations, and presents a subjective evaluation of MPEG2 images with various buffer memory sizes.

In this paper, the performance of dynamic channel assignment for cellular systems with an array antenna is evaluated assuming realistic beamformer. A new dynamic channel assignment algorithm is proposed to improve the performance by forming a directional beam pattern to cancel stronger co-channel interference with higher priority. Performance comparison is carried out by computer simulations. Conventional algorithm shows 2.7 fold capacity increase compared with an omni antenna system, whereas proposed algorithm shows around 3.3 fold capacity increase, at the point of 3 percent blocking probability. The simulation results also denote that a shorter reuse distance can be achieved by the proposed algorithm, which indicates a more efficient utilization of channel resource.

The feasibility of a dynamic zone configuration technique has been investigated. To make it easy to implement this technique in wireless communication systems, a simplified method for determining a suitable weight vector by using the least squares (LS) methods was developed. Simulations showed that the developed system is more effective than the present omni-directional zone system. Moreover, combining dynamic zone configuration technique with dynamic channel assignment strategy reduced blocking rate, forced call termination ratio, and required transmission power.

One effective way to make a large-capacity mobile communication system is to use a microcellular system. One way to do this is to place the base station antennas lower than the surrounding buildings. This result in what is called a street microcellular system. We previously presented basic simulation results evaluating the performance of a different-sized cell combination algorithm (DCC) designed to avoid the problems due to an unbalanced distribution of traffic in street microcellular systems. In this paper, we present the results of simulations evaluating the performance of an improved active different-sized cell combination method (ADCC) that controls the transmission power of each base station.

In a personal communication system (PCS), a scheme for reforwarding call-terminating setup messages (SETUP messages) from a network or a cell station is used to guard against their loss. We have developed a method for evaluating the loss probability of a reforwarding scheme in which the network monitors the response messages from a personal station after forwarding a SETUP message to that personal station and reforwards the SETUP message only if a response message is not received. We started with a stochastic model in which messages registered in the paging-channel queue in a cell station are cyclically forwarded to the wireless area. This model corresponds to the finite-capacity M/D/1/N model with vacation time. We then added a method for calculating the "timeout" probability. Next we expanded the model into one in which the SETUP messages are reforwarded when a response message is not received by the network. This model corresponds to the M/D/1/N model with vacation time and retrials. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the traffic characteristics of PCS call-terminating control.

This paper clarifies the appropriate traffic domains for combination between two database schemes (i. e. , HLR database scheme and VLR database scheme) and two call routing schemes (i. e. , Redirection Routing scheme and Look-a-head Routing scheme) in the Global Mobility Network (GLOMONET), which is able to provide global roaming service for the personal telecommunication user. The appropriate domains for combination between each scheme are shown to depend on user's mobility (i. e. the frequency of a user's access to a network where the user stays, the length of the period during which the user stays in the same network). Whether the appropriate domains for the HLR database scheme exist depends only on the frequency of the user's access to the network. When there are appropriate domains for the HLR database scheme, increasing the frequency of the user's access to the network, decreasing the length of the period the user stays in the user's home network, or increasing the length of the period the user stays in a network that isn't the user's home network widens the domains where the VLR database scheme is appropriate.

An ad hoc wireless network is a collection of mobile hosts that self-forming a temporary network without any required intervention of centralized system. In such environment, mobile hosts, which are not within transmission range from each other, require some other intermediate hosts to forward their packets to form a multi-hop communication. In this paper, an ad hoc network is modeled as a graph. Two nodes within the transmission range of each other are connected by an edge. Given a finite set of mobile nodes, a finite set of edges and a new multicast request, the wireless multicast tree problem (WMTP) is to find a multicast tree for the request so that the multicast loss probability is minimized. We prove the WMTP is NP-complete and a heuristic algorithm, called Degree-Based Multicast Routing Algorithm (DBMRA), is proposed. Based on the DBMRA, one algorithm was proposed to establish backup nodes for the multicast tree to improve the reliability. A node is needed to be backup only when it has a high probability to disconnect the multicast tree seriously. The qualification of a node to be backup is subject to a computed threshold, which is determined by a statistic analysis. The theoretical and experimental analyses are presented to characterize the performance of our algorithms.

In wireless ATM networks, the condition of the transmission channel fluctuates significantly as a result of many causes such as multipath, shadow phasing, and so forth. Several schemes have been proposed to take care of transmission errors. Some schemes are suitable for favorable channel conditions, while others are more suitable for unfavorable channel conditions. Thus, using a fixed error control scheme regardless of channel conditions is destined to be inefficient. This paper presents a dynamic error control scheme that dynamically selects an appropriate error control scheme according to the conditions of the transmission channel. Using this method, we can decrease both errors and the overhead of redundancy.

This article clarifies the requirements of VHE (Virtual Home Environment), issues and resolution for realization of VHE, when the environment will use Intelligent Network (IN) within IMT-2000 networks that is targeted to start in the year 2000. The IN aims the applicability of it's architecture to any kind of network. However, the following subjects need to be considered when IN will be used in the IMT-2000 network; The approach of the service related capabilities' extraction and specification; security management; cooperation between the service switching function within a core network and the IN function(s); cooperation between the mobility management function and the IN function(s); and consideration of mobile and fixed network convergence/integration. This article mainly focuses on these subjects. Some open issues like service/feature interaction and their tentative solutions are identified. Main results are; expandability of current IN to supporting IMT-2000 requirements, identification of key issues in providing VHE in IMT-2000, identification of candidate relationships, and associated issues for VHE. The currently available scenarios for VHE are evaluated from these points, and it is proposed that the specification to be common both for mobile and fixed network.

The world of mobile communications has undergone dramatic changes in recent years. Since the Personal Digital Cellular (PDC) system of digital mobile communications became commercially available in Japan in 1993, the number of subscribers has increased to the extent that almost 30% of the Japanese population are subscribed. Furthermore, the increasing sophistication of communications, such as the growing popularity of the Internet and expansion of our spheres of existence, have led to demand for new applications, such as use on a global scale. Many new technologies are also being introduced, such as the IMT-2000 system and the IN system which are slated to be introduced at the end of 2000. Based on the above and in view of the increasing scale and sophistication of mobile communications networks, the time has come to reexamine the configuration within networks of SCPs, which perform subscriber data management and service control. This paper focuses on the functions of subscriber data management and service control, classifies data necessary for mobile networks and using the signal number of common networks as a guide considers the optimum arrangement of data and control nodes. The paper also examines reliability measures for SCPs to ensure the reliability of increasingly large-scale networks.

This letter proposes a diffusion model that considers both mobility and multimedia based on the user population process to examine the effects of multimedia in mobile communications. As an application example of this model, the shared bandwidth that can be used by one user in packet communications is evaluated. In this model, the user speed and variation in the number of users in a cell are interrelated with respect to mobility. By examining the shared bandwidth behavior based on multimedia teletraffic characteristics, assuming that the number of simultaneously-communicating users within a cell have self-similarity, we found that shared bandwidth and its variance are not dependent on self-similarity but that variance in the shared bandwidth is dependent on user speed.

This paper proposes a new design method of nonlinear filtering and fixed-point smoothing algorithms in discrete-time stochastic systems. The observed value consists of nonlinearly modulated signal and additive white Gaussian observation noise. The filtering and fixed-point smoothing algorithms are designed based on the same idea as the extended Kalman filter derived based on the recursive least-squares Kalman filter in linear discrete-time stochastic systems. The proposed filter and fixed-point smoother necessitate the information of the autocovariance function of the signal, the variance of the observation noise, the nonlinear observation function and its differentiated one with respect to the signal. The estimation accuracy of the proposed extended filter is compared with the extended maximum a posteriori (MAP) filter theoretically. Also, the current estimators are compared in estimation accuracy with the extended MAP estimators, the extended Kalman estimators and the Kalman neuro computing method numerically.

Newton based adaptive algorithms are among the algorithms which are known to exhibit a higher convergence speed in comparison to the least mean square (LMS) algorithms. In this paper we propose a simplified Newton based adaptive algorithm for an adaptive infinite impulse response (IIR) filter implemented using cascades of second order allpass filters and a finite impulse response (FIR) filter. The proposed Newton based algorithm avoids the complexity that may arise in the direct differentiation of the mean square error. The analysis and simulation results presented for the algorithm, show that the property of convergence of the poles of the IIR ADF to those of the unknown system will be maintained for both white and colored input signal. Computer simulation results confirm an increase in convergence speed in comparison to the LMS algorithm.

This paper presents two man-machine reliability models. A system consists of one machine unit, one operator, and one event detecting monitor. The machine unit has three states, normal, abnormal, and failed. The event detecting monitor may fail in two ways. If a machine unit becomes abnormal, the event detecting monitor sends a signal, and the operator takes necessary actions. If the operator fails in the action in the cause of human error, the machine unit goes down. The condition of the operator is classified into two types, good and bad. The time to repair, and the human error rate both depend on the condition of the operator. The MTTF is obtained by using a Markov model and numerical computation. Furthermore, the optimal operating period which minimizes the overall cost is decided by using computer methods. Some numerical examples are shown.

In this paper, the performance of some communication systems using chaos synchronization is evaluated and compared. A new channel model taking the attenuation, impedance mismatch and noise into account, is proposed for the performance evaluation. The evaluation of bit error rate is done for both ideal and non-ideal conditions using the channel model. It is confirmed that some chaos-based communication systems have a good performance compared with conventional analog communication schemes.

Novel memory and several logic circuits utilizing the chaotic oscillations produced in SQUIDs are proposed. First, the oscillation modes that can be produced in a SQUID circuit are analyzed. The results of simulation for the SQUID show that there exist four types of oscillations: periodic, subharmonic, chaotic and relaxation oscillations. The bifurcation diagram of oscillation waveforms reveals that the hysteresis phenomena in the relation between the terminal voltage or the current and the external flux appear and that these phenomena can be used for a memory operation. Secondary, novel digital circuits such as memory, Exclusive-OR and full adder circuits are proposed by utilizing the chaotic oscillations. In these digital circuits the chaotic oscillations are made correspond to the logic "1," while the periodic and subharmonic oscillations are made to the logic "0." In order to investigate how these digital circuits perform their functions, computer simulations are made. The simulation results show that the right operations can be achieved.

In this paper, we consider the Integrate-and-Fire Model (ab. IFM) with two periodic inputs. The IFM outputs a pulse-train which is governed by a one dimensional return map. Using the return map, the relationship between the inputs and the output is clarified: the first input determines the global shape of the return map and the IFM outputs various periodic and chaotic pulse-trains; the second input quantizes the state of the return map and the IFM outputs various periodic pulse-trains. Using a computer aided analysis method, the quantized return map can be analyzed rigorously. Also, some typical phenomena are confirmed in the laboratory.

In this paper CMOS VLSI circuit solutions are suggested for on-chip learning and weight storage, which are simple and silicon area efficient. In particular a stochastic learning scheme, named Random Weight Change, and a multistable weight storage approach have been implemented. Additionally, the problems of the influence of technological variations on learning accuracy is discussed. Even though both the learning scheme and the weight storage are quite general, in the paper we will refer to a class of networks, named Approximate Identity Neural Networks, which are particularly suitable to be implemented with analog CMOS circuits. As a test vehicle a small network with four neurons, 16 weights, on chip learning and weight storage has been fabricated in a 1.2 µm double-metal CMOS process.

The use of hand gesture provides an attractive alternative to cumbersome interface devices for human-computer interaction (HCI). In particular, visual interpretation of hand gestures can help achieve easy and natural comprehension for HCI. Many methods for hand gesture recognition using visual analysis have been proposed such as syntactical analysis, neural network (NN), and hidden Markov model (HMM)s. In our research, HMMs are proposed for alphabetical hand gesture recognition. In the preprocessing stage, the proposed approach consists of three different procedures for hand localization, hand tracking and gesture spotting. The hand location procedure detects the candidated regions on the basis of skin color and motion in an image by using a color histogram matching and time-varying edge difference techniques. The hand tracking algorithm finds the centroid of a moving hand region, connect those centroids, and produces a trajectory. The spotting algorithm divides the trajectory into real and meaningless gestures. In constructing a feature database, the proposed approach uses the weighted ρ-φ-ν feature code, and employ a k-means algorithm for the codebook of HMM. In our experiments, 1,300 alphabetical and 1,300 untrained gestures are used for training and testing, respectively. Those experimental results demonstrate that the proposed approach yields a higher and satisfactory recognition rate for the images with different sizes, shapes and skew angles.

In this paper, a general formula of disparity estimation based on Bayesian Maximum A Posteriori (MAP) algorithm is derived and implemented with simplified probabilistic models. The formula is the generalized probabilistic diffusion equation based on Bayesian model, and can be implemented into some different forms corresponding to the probabilistic models in the disparity neighborhood system or configuration. The probabilistic models are independence and similarity among the neighboring disparities in the configuration. The independence probabilistic model guarantees the discontinuity at the object boundary region, and the similarity model does the continuity or the high correlation of the disparity distribution. According to the experimental results, the proposed algorithm had good estimation performance. This result showes that the derived formula generalizes the probabilistic diffusion based on Bayesian MAP algorithm for disparity estimation. Also, the proposed probabilistic models are reasonable and approximate the pure joint probability distribution very well with decreasing the computations to O(n()) from O(n()⁴) of the generalized formula.