Active frequency-tuning beam-scanning leaky-mode antenna arrays have been demonstrated in this paper. These antennas integrated one or several microstrip leaky-wave antenna elements with a single varactor-tuned HEMT VCO as an active source. Noted that the measured scan angles of the 11 and 14 antennas were approximately 24 and the scanning range of the 12 antenna was 20. Furthermore, reflected wave due to the open end of each leaky-wave antenna element has been suppressed by the symmetric configuration of this antenna array and the antenna efficiency increases. When comparing with the measured radiation pattern of the single element antenna, we found that the 12 and 14 antenna arrays can effectively suppress the reflected power by more than 5.5 dB and 10.5 dB, respectively, at 10.2 GHz. The power gain are more than 2 dB and 3.16 dB higher than the single element antenna with a measured EIRP of 18.67 dBm.

The wavelet matrix transform approach, in combination with the method of moments (MoM), is applied to solve the electromagnetic scattering problem of an array of metal strips. The problem is first discretized by the conventional MoM to obtain a dense impedance matrix, then the wavelet matrix transform is applied to produce a sparse matrix. This approach avoids a great number of integral computations existing in the wavelet basis expansion method and provides fast approach to solution for the scattering problem. Daubechies' wavelet is chosen as the mother wavelet to construct a sparse wavelet matrix so that the matrix-matrix multiplications occurring in the transform cost only O(N2) with N unknowns. Numerical tests show that the computation cost necessary for solving the resultant sparse matrix is only O(N log N). An appropriate choice of the number of vanishing moments of wavelets is suggested from consideration of total computation cost and accuracy of solutions.

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.

In coupled oscillator arrays, it is possible to control the inter-element phase shift up to 180 by free-running frequency distribution based on injection-locking phenomenon. In this paper, a new technique to control the inter-element phase shift electronically up to the maximum extent of 360 is reported. Oscillators are unilaterally coupled to the preceding oscillator through one of the two paths, which differ from each other 180 in electrical length and each includes an amplifier. Turning on the desired amplifier one can control the phase shift either -180 to 0 or 0 to 180. The technique was applied in a three-element oscillator array each coupled to a patch antenna via a round aperture. The radiation beam of the array could be scanned 47 in total.

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.

This paper presents a new approach to computer image generation via three proposed methods for translating the evolution of a Petri net into fractal image synthesis. The idea is derived from the concept of fractal iteration principles in the escape-time algorithm and chaos game. The approach uses a Petri net as a powerful abstract modeling tool for fractal image synthesis via its duality, deadlock, inhibitor arc, firing sequence and marking reachability. The objective of this approach is to enhance the analysis technique of a Petri net and use it as a novel technique for fractal image synthesis. Generating fractal images via the dynamics of a Petri net allows an easy and direct proof for the similarity and correspondence between the dynamics of complex quadratic fractals by the recursive procedure of the escape-time algorithm and the state of a Petri net via a reachability problem. The reachability problem will be manipulated in terms of the dynamics of the fractal in order to generate images via three proposed methods. Validation of our approach is given by discussion and an illustration of some experimental results.

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.

When designing microwave amplifiers, it is the task to select values of the source (input generator) and load reflection coefficients for the transistor, to achieve certain amplifier performance requirements and ensure stability. For unconditionally stable transistors, simultaneous conjugate matching can be achieved using well-known design formulae. Under this condition, the gain is maximised, and the input and output ports are matched. On the other hand when the transistor is conditionally stable, source and load reflection coefficients are selected using graphical design methods, involving gain and stability circles. To eliminate the reliance on graphical techniques, this paper shows the derivation of explicit design formulae that ensure maximum gain for a minimum specified safety margin, with one port matched. In this work, the safety margin is the distance between the chosen source or load reflection coefficient and its respective stability circle. In a production environment, where the circuit and transistor parameters are subject to random variations, the safety margin therefore makes allowance for such variations. This paper shows that the design problem for conditionally stable transistors can be reduced from the selection of values for two complex variables (port terminations) to the selection of the value for just one scalar variable.

Network monitoring is one of the most significant functions in network management to understand the state of a network in real-time. In SNMP (Simple Network Management Protocol), polling is used for this purpose. If the time interval for two consecutive polling requests is too long, then we cannot understand the state of the network in real-time. Conversely, if it is too short, then the polling message traffic increases and imposes a heavy load on the network. Many dynamic polling algorithms have been proposed for controlling the increase in the polling message traffic. However, they cannot keep track of the time variations of management information values, since their main objectives are to check whether or not a network node is active and the next polling interval is determined being independent of the time variations of the values. The existing polling algorithms are thereby not applicable to the case where monitoring the time variation of management information values is critical. This paper proposes a new dynamic polling algorithm which, by making use of Discrete Fourier Transformation, enables not only to control the increase in the polling message traffic but also to keep track of the time variations of network management information values. We show the availability of the proposed algorithm by evaluating it through both simulations and experiments in actual network environment.

In this paper, a new digital chaos circuit which can generate multiple-scroll strange attractors is proposed. Being based on the piecewise-linear function which is determined by on-chip supervised learning, the proposed digital chaos circuit can generate multiple-scroll strange attractors. Hence, the proposed circuit can exhibit various bifurcation phenomena. By numerical simulations, the learning dynamics and the quasi-chaos generation of the proposed digital chaos circuit are analyzed in detail. Furthermore, as a design example of the integrated digital chaos circuit, the proposed circuit realizing the nonlinear function with five breakpoints is implemented onto the FPGA (Field Programmable Gate Array). The synthesized FPGA circuit which can generate n-scroll strange attractors (n=1, 2, 4) showed that the proposed circuit is implementable onto a single FPGA except for the SRAM.

The Joint CDMA/PRMA (JCP) protocol, proposed by Brand and Aghvami, is modified to increase the capacity for mobile communication systems. To reduce multiuser interference, the modified JCP uses an access channel additionally to the traffic channels, on which each mobile terminal reserves a unique slot and code. Furthermore, the modified JCP employs receiver-based code scheme. In the case of voice-only traffic, the throughput increases by up to 15% compared to that of the conventional JCP, when Ploss is 0.01. Also, for the mixed traffic case, the throughput increases about 20%.

A content-based image retrieval scheme based on scale-space theory is proposed. Instead of considering all scales for image retrieval, the proposed algorithm utilizes a modified histogram intersection method to compute the relative scale between a query image and a candidate image. The proposed method has been applied to various images and the performance improvement has been verified.

This paper treats a fault detection/location of multi-processor systems, and we present a checking scheme based on Modified Processor-Data (MPD) graph with considering an error generation/propagation model for Algorithm-Based Fault Tolerant (ABFT) systems. The error propagation model considered here allows a computation result with multiple (more than one) erroneous inputs to be either erroneous or error-free. Also a basic algorithm for constructing checks for single-fault locatable/two-fault detectable ABFT systems based on the checking scheme is described with design examples.

The rosette-scanning infrared seeker (RSIS) is a tracker that a single infrared detector scans the total field of view (TFOV) in a rosette pattern, and then produces 2D image about a target. Since the detected image has various shapes in accordance with the target position in the TFOV, it is difficult to determine a precise target position from the obtained image. In order to track this type of target, therefore, we propose an efficient tracking method using the K-means algorithm (KMA). The KMA, which classifies image clusters and calculates their centers, is used to cope with an countermeasure (CM) such as an IR flare. To evaluate the performance of the RSIS using the KMA dynamically, we simulate the RSIS in the various conditions, and discuss the tracking results.

Low-voltage technique for IC is getting one of the most important matters. It is quite difficult to realize a filter which can operate at 1 V or less because the base-emitter voltage of transistors can hardly be reduced. A design of a low-voltage continuous-time filter is presented in this paper. The basic building block of the filter is a pseudo-differential transconductor which has no tail current source. Therefore, the operating voltage is lower than that of an emitter-coupled pair. However, the common-mode (CM) gain of the transconductor is quite high and the CMRR is low. In order to reduce the CM gain, a CM feedback circuit is employed. The transconductance characteristic is expressed as the function of hyperbolic cosine. The designed filter is a fifth-order gyrator-C filter. The transconductor and the filter which has a fifth-order Butterworth lowpass characteristic are demonstrated by PSpice simulation. Transconductance characteristic, CMRR and stability of the transconductor are confirmed through the simulation. In the analysis of the filter, frequency response and offset voltage are examined. It is shown that the filter which has corner frequency of the order of megahertz can operate at a 1 V supply voltage.

The transfer function of IIR all-pass filters is a rational function of ω. However, the optimization of such a rational function using the successive projections method, which has a wider range of application than the Remez algorithm, has not been presented. In this paper, we propose designing IIR all-pass filters using the successive projections method.

This paper presents a new data path synthesis algorithm which takes into account simultaneously three important design criteria: testability, design area, and total execution time. We define a goodness measure on the testability of a circuit based on three rules of thumb introduced in prior work on synthesis for testability. We then develop a stepwise refinement synthesis algorithm which carries out the scheduling and allocation tasks in an integrated fashion. Experimental results for benchmark and other circuit examples show that we were able to enhance the testability of circuits significantly with very little overheads on design area and execution time.

This paper outlines the modeling requirements of integrated circuit (IC) fabrication processes that have lead to and sustained the development of computer-aided design of technology (i. e. TCAD). Over a period spanning more than two decades the importance of TCAD modeling and the complexity of required models has grown steadily. The paper also illustrates typical applications where TCAD has been powerful and strategic to IC scaling of processes. Finally, the future issues of atomic-scale modeling and the need for an hierarchical approach to capture and use such detailed information at higher levels of simulation are discussed.

Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.

The current Internet does not offer any quality of service guarantees or support to Internet multimedia applications such as Internet telephony and video-conferencing, due to the best-effort nature of the Internet. Their performance may be adversely affected by network congestion. Also, since these applications commonly employ the UDP transport protocol, which lacks congestion control mechanisms, they may severely overload the network and starve other applications. We present an overview of recent research efforts in developing adaptive delivery models for Internet multimedia applications, which dynamically adjust the transmission rate according to network conditions. We classify the approaches used to develop adaptive delivery models with brief descriptions of representative research work. We then evaluate the approaches based on important design issues and performance criteria, such as the scalability of the control mechanism, responsiveness in detecting and reacting to congestion, and ability to accommodate receiver heterogeniety. Some conclusions are developed regarding the suitability of particular design choices under various conditions.