In this paper, authors propose a linear array antenna using two bifilar helical antenna elements placed along the helix axis to reduce beam direction movement according to frequency change. The beam direction movement of this proposed array antenna is smaller than that of a conventional bifilar helical antenna. Also, the gain of this proposed array antenna is higher than that of the conventional helical antenna for a cross point angle of radiation patterns at the different transmit and receive(Tx and Rx) frequencies. The conventional helical antenna is suitable for vehicle antennas in mobile satellite communication systems such as the MSAT system because it owns circularly polarized omni-directional radiation pattern and its thin pole form. However, this antenna has a disadvantage that the beam direction in an elevation plane moves according to frequency change. In the proposed array antenna, the beam direction movement is about 9 smaller than that of the conventional bifilar helical antenna on condition that antenna total length is 4.83 λ0, antenna diameter is 0.12 λ0, and frequency change is from 0.957f0 to 1.043f0(f0 is center frequency and λ0 is free space wavelength at f0). Also, the Tx and Rx gains of this proposed array antenna at the cross point angle between Tx and Rx beams are about 2 dB higher than that of the conventional bifilar helical antenna on the same condition.

In ths letter, we suggest a collision resolution algorithm when the packet length is random, and analyze its throughput and delay performance. Here, three different packet length distributions and two feedback schemes (ternary and binary success/failure feedback) are considered.

A multi-terminal serial optical link(MSOL) achieves very simple and cost effective radio cell configurations because only one pair of fibers is needed. In addition, low cost Fabry-Perot laser diodes(FP-LDs) can be employed. MSOL has a substantial problem in that the beat noise degrades the C/N in the up-link. To reduce this noise, we propose using an automatic wavelength-offset control(AWOC) circuit. The AWOC circuit offsets the LD wavelength by controlling the laser bias current to minimise the RF band beat noise which is inherent in MSOL systems, and enables high C/N optical-microwave transmission. An experimental MSOL consisting of 5 radio access stations, each equipped with AWOC, is constructed to estimate the noise free dynamic range for 800-MHz 20-carrier signal transmission. The up-link comprises a single mode fiber connecting five 1.3-µm FP-LDs operating at 0.2 mW. The down-link consists of a single mode fiber and one 1.3-µm Distributed Feedback type Laser Diode(DFB-LD) emitting at 4.0 mW. The experimental device achieves over 15 dB noise reduction compared to MSOL without AWOC in the temperature range of 0 to 40. By using the proposed AWOC, MSOL can achive low cost optical fiber RF microcell systems that are easy to install. Additionally, when we install MSOL in the radio base station, the links become more cost effective than coaxial cable links; they offer a wide dynamic range and higher transmission quality.

We propose an architecture of a high-speed internetworking device using central control method. Co-operations of hardware and software is required to realize high relay performance. For the hardware, we have designed an original bus arbitration control method to achieve a high throughput of a data bus. For the software, we have devided a normal relay processing from other processing and built it as a basic function of the monitor. By this method, relay perfomance improves dramatically, because of a multiple effect of the reduction of software overheads and the improvement of cache hit ratio. We have developed the prototype device and confirmed the effects of the proposed method.

AlGaAs/GaAs power HBTs for digital cellular phones have been developed. A three-dimensional thermal analysis taking the local-temperature dependence of the collector current into account was applied to the thermal design of the HBTs. The HBTs were fabricated using the hetero-guardring fully selfaligned transistor technique. The HBT with 220µm2 60 emitters produced a 31.7 dBm CW-output power and 46% poweradded efficiency with an adjacent channel leakage power of -49 dBc at the 50kHz offset bands for a 948 MHz π/4-shifted QPSK modulated signal at a low collector-emitter voltage of 3V. Through comparison with the conventional GaAs power FETs, it has been shown that AlGaAs/GaAs power HBTs have a great advantage in reducing the chip size.

The problem of genetic algorithm's efficiency has been attracting the attention of genetic algorithm community. Over the last decade, considerable researches have focused on improving genetic algorithm's performance. However, they are generally under the framework of natural evolutionary mechanism and the major genetic operators, crossover and mutation, are activated by the prior probabilities. An operator based on a prior probability possesses randomness, that is, the unexpected individuals are frequently operated, but the expected individuals are sometimes not operated. Moreover, as the evaluation function is the link between the genetic algorithm and the problem to be solved, the evaluation function provides the heuristic information for evolutionary search. Therefore, how to use this kind of heuristic information (present and past) is influential in the efficiency of evolutionary search. This paper, as an attempt, presents a eugenics-based genetic algorithm (EGA) -- a genetic algorithm that reflects the human's decision will (eugenics), and fully utilizes the heuristic information provided by the evaluation function for the decisions. In other words, EGA = evolutionary mechanisms + human's decision will + heuristic information. In EGA, the ideas of the positive eugenics and the negative eugenics are applied as the principle of selections and the selections are not activated by the prior probabilities but by the evaluation values of individuals. A method of genealogical chain-based selection for mutation is proposed, which avoids the blindness of stochastic mutation and the disruptive problem of mutation. A control strategy of reasonable competitions is proposed, which brings the effects of crossover and mutation into full play. Three examples, the minimum problem of a standard optimizing function--De Jong's test function F2, a typical combinatorial optimization problem--the traveling salesman problem, and a problem of identifying nonlinear system, are given to show the good performance of EGA.

This paper proposes a new digitized group modulator for radio base station transmitters of multi-carrier TDMA. This group modulator can flexibly set carrier spacing and features a simple construction as a result of employing the Simple Fractional Sampling technique. A group modulator LSI was designed and built using 0.5-µm BiCMOS technology, and a π/4-shifted QPSK group modulator was constructed using this LSI. Experiments confirm that the modulator simultaneously generates multiple carriers in a wide bandwidth without the need for precise adjustment and there is little difference between each of the carriers in terms of BER performance. Moreover, experiments confirm that the group modulator's burst-output (frequency hopping) performance is excellent.

For similarity methods to work well, the image must be blurred before being input. However, the relationship between the blurring operation and the similarity is not fully understood. To solve the problem of this relationship, in this paper, the effect of blurring is investigated by expressing figure f(x) in the form of the sum of higher derivatives of f (x,σ), and then a simple similarity between figures was mathematically formulated in terms of the relation between visual patterns. By modifying this formulation, we propose pluralized simple similarity to increase the allowance in different view of multiple similarity. The similarity maintains higher allowance without any discernible loss of distinguishing power. We verify the effectiveness of the pluralized simple similarity throughout some experiments.

This paper describes the results of tests that measured the allowable delay between images and tactile information via a force feedback device. In order to investigate the allowable delay, two experiments were performed: 1) subjective evaluation in real space and 2) subjective evaluation in virtual space using a force feedback device.

It is well known that the Hopfield Model (HM) for neural networks to solve the TSP suffers from three major drawbacks: (D1) it can converge to non-optimal local minimum solutions; (D2) it can also converge to non-feasible solutions; (D3) results are very sensitive to the careful tuning of its parameters. A number of methods have been proposed to overcome (D1) well. In contrast, work on (D2) and (D3) has not been sufficient; techniques have not been generalized to larger classes of optimization problems with constraint including the TSP. We first construct Extended HMs (E-HMs) that overcome both (D2) and (D3). The extension of the E-HM lies in the addition of a synapse dynamical system cooperated with the corrent HM unit dynamical system. It is this synapse dynamical system that makes the TSP constraint hold at any final states for whatever choices of the HM parameters and an initial state. We then generalize the E-HM further into a network that can solve a larger class of continuous optimization problems with a constraint equation where both of the objective function and the constraint function are non-negative and continuously differentiable.

There are some results indicating that a quantum computer seems to be more powerful than ordinary computers. In fact, P.W. Shor showed that a quantum computer can find discrete logarithms and factor integers in polynomial time with bounded error probability. No polynomial time algorithms to find them using ordinary computers are known. In this paper, we show that the cycles in some kinds of periodic functions, e.g., functions proposed as pseudo-random generators, can be found in polynomial time with bounded error probability on a quantum Turing machine. In general, it is known that ordinary computers take exponential time to find the cycles in periodic functions.

This paper compares some popular character recognition techniques which have been proposed until today. 17 feature extraction methods and 4 neural network based recognition processes were used in handwritten numerals (postal codes) recognition. It was found that Weighted Direction Index Histogram, Peripheral Direction Contributivity Function and Expansion Cell feature extractions gave good results. As for the neural network recognition process, CombNET- and multi layer neural network showed good performances.

For a fuzzy control of manipulated variable so as to match a required output of a plant, tuning of fuzzy rules are necessary. For its purpose, various methods to tune their rules automatically have been proposed. In these method, some of them necessitate much time for its tuning, and the others are lacking in the generalization capability. In the fuzzy control by the steepest descent method, a use of piecewise linear membership functions (MSFs) has been proposed. In this algorithm, MSFs of the premise for each fuzzy rule are tuned having no relation to the other rules. Besides, only the MSFs corresponding to the given input and output data for the learning can be tuned efficiently. Comparing with the conventional triangular form and the Gaussian distribution of MSFs, an expansion of the expressiveness is indicated. As a result, for constructing the inference rules, the training cycles can be reduced in number and the generalization capability to express the behavior of a plant is expansible. An effectiveness of this algorithm is illustrated with an example of a parallel parking of an autonomous mobile robot.

This paper proposes a design technique for 3-D non-separable QMF banks with Face-Centered Cubic Sampling (FCCS) and Body-Centered Cubic Sampling (BCCS). In the proposed technique, 2-D McClellan transformation is applied to a suitably designed 2-D prototype QMF to obtain 3-D QMFs. The design examples given in this paper demonstrate advantages of the proposed method.

Processor networks connected by buses have attracted considerable attention. Since a reconfigurable array is more powerful than a PRAM and more practical, it becomes the focus of attention. The Processor Array with Reconfigurable Bus System (PARBS) and the Reconfigurable Multiple Bus Machine (RMBM) are both models of parallel computation based on reconfigurable bus and processor array. The PARBS is a processor array that consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. The RMBM is also made of processors and reconfigurable bus system, but the processors are located in a row and the number of processors and the number of buses are independent of each other. Four versions of RMBM has been proposed and Extended RMBM (E-RMBM) is regarded as the most powerful one among them. In this paper, we describe that a PARBS of size N M can be simulated in constant time by a E-RMBM of 4NM processors, M + 3 buses and 1 read buffer, and that a E-RMBM of P processors, B buses and D read buffers can be also simulated in constant time by a PARBS of size B P. A PARBS or RMBM that solves a computational problem of size n is polynomially bounded iff the product of the number of processors and buses and red and write ports is O (nc), for some constant c. When a PARBS is polynomially bounded, the E-RMBM which simulates it is also polynomially bounded, and vice versa.

The mean field theory has been recognized as offering an efficient computational framework in solving discrete optimization problems by neural networks. This paper gives a formulation based on the information geometry to the mean field theory, and makes clear from the information-theoretic point of view the meaning of the mean field theory as a method of approximating a given probability distribution. The geometrical interpretation of the phase transition observed in the mean field annealing is shown on the basis of this formulation. The discussion of the standard mean field theory is extended to introduce a more general computational framework, which we call the generalized mean field theory.

An improved gate current model of GaAs FET's is presented. A conventional gate current and the reverse breakdown characteristics. Conseguentli, the model has been determined only by the forward current model fails to fit measured results in the reverse bias range, under which power amplifiers operate. The proposed model improves this problem and shows a great enhancement in accuracy throughout the whole operation range of FET's. The model consists of three diodes and a resistor, which are standerd elements implemented in commercially available circuit simulators, and thus it can easily be used for analyzing performances of various FET circits.

We proposed a new thchnique using saw wave modulation light to measure the thermal diffusivity of a transparent adhesive by photoacoustic microscope. In this technique, the time required for the measurement of it can be reduced by one-fifth compared with that of a conventional method.

Taking a 1.5-GHz SAW antenna duplexer for PDC, we have developed a new configuration for the transmitter final stage filter and a new weighting technique for the receiver top filter. These transmitter and receiver filters provide insertion losses as low as 0.8 and 1.6 dB, respectively. Combining the filters, we have developed a miniature antenna duplexer of which size is 1.40.60.2 cm3 , several-time smaller than that of a conventional dielectric-filter duplexer. It also ensures sufficient power-handing capabilities.

In the traditional note symbol extraction processes, extracted candidates of note elements were identified using complex if-then rules based on the note formation rules and they needed subtle adjustment of parameters through many experiments. The purpose of our system is to avoid the tedious tasks and to present an accurate and high-speed extraction of note heads, stems and flags according to the following procedure. (1) We extract head and flag candidates based on the stem positions. (2) To identify heads and flags from the candidates, we use a couple of three-layer neural networks. To make the networks learn, we give the position informations and reliability factors of candidates to the input units. (3) With the weights learned by the net, the head and flag candidates are recognized. As an experimental result, we obtained a high extraction rate of more than 99% for thirteen printed piano scores on A4 sheet which have various difficulties. Using a workstation (SPARC Station 10), it took about 90 seconds to do on the average. It means that our system can analyze piano scores 5 times or more as fast as the manual work. Therefore, our system can execute the task without the traditional tedious works, and can recognize them quickly and accurately.