A random access micro-cellular system based on CSMA (RAMCS/CSMA) is proposed. On uplink in RAMCS/ CSMA, packets are transmitted by means of CSMA at the same carrier frequency in any cell. On downlink, packets are broadcast conforming to TDMA, also at the same carrier frequency in any cell. In RAMCS/CSMA, deployed microcells produce higher system capacity. Nevertheless, " handoff on a terminal " isn't required. In this paper, overview of the system, fundamental uplink performance, and two kinds of power control methods are presented. As for the control methods, one is control according to packet priority. The other is a way according to location of a mobile terminal. By means of CSMA, throughput performance on uplink becomes great and is saturated at 0. 39 per cell. And the performance strongly depends on the threshold level on carrier sense. Such a throughput performance is peculiar to RAMCS/CSMA and different from an ordinary CSMA system. The optimum threshold is also indicated here. Furthermore, it is clarified that both power control methods highly improve the throughput performance. As a result, it is found that RAMCS/CSMA is excellent for mobile communications.

We will present a partial scan design method based on n-fold line-up structures in order to achieve high fault efficiency and reduce test pattern generation time for practical LSIs. We will also present a partial scan design method based on the state justification of pure load/hold FFs in order to achieve high fault efficiency and reduce the number of scan FFs for practical LSIs with lots of load/hold FFs. Experimental results for practical LSIs show that our presented methods can achieve high fault efficiency (more than 99%) and reduce the number of scan FFs for the LSI with lots of load/hold FFs.

This paper presents a new methodology for diagnosing transistor leakage faults in a CMOS circuit by using both IDDQ and logic value information. A hierarchical procedure is used to identify and delete impossible fault candidates efficiently and a procedure is employed to generate diagnostic tests for improving diagnostic resolution. A novel approach for handling the intermediate output voltage of a faulty gate is used in new methods for fault simulation and diagnostic test generation based on primary output values. Experimental results on ISCAS85 circuits show the effectiveness of the proposed methodology.

A photorefractive ring resonator with self-pumped four-wave mixing (PRRR-SPFWM) in which the Cat mirror region and the four-wave mixing region are formed in a single photorefractive crystal is proposed, and the steady-state analysis of this unknown device is first performed. Since the backward pump beam is generated as a phase conjugate of the forward pump beam in the Cat mirror region, counterpropagation of both pump beams is spontaneously obtained. We analyze its oscillation intensities in steady state, and show that the threshold coupling strength of oscillation depends on the cavity mirror reflectivity and the reflectivity of the Cat mirror region. We also show interesting property of PRRR-SPFWM, the possibility to switch over between unidirectional and bidirectional oscillation by controlling the amplitude of coupling strength.

With the advance of computer technologies, mobile computers can hold many local resources in themselves. In many cases it is impossible to announce local resources on them because almost information announcement systems are not designed for them. In this paper, an information announcement system for mobile computers based on WWW is proposed. The system efficiently announces resources on mobile computers independently of whether they are connected to a network or not, and wherever they are connected. The system can also select suitable announcement methods according to the type of resources. We implement a prototype of proposed system and evaluate it. The result of evaluation confirms effectiveness of the proposed system.

We have developed a new type of phase interpolation DDS with a digitally controlled delay generator. The new DDS is similar to a sine output DDS in that it produces low spurious signals, but it does not require a sine look-up table. Periodic jitter in the MSB of the DDS accumulator is reduced with the digitally controlled delay generator. Experimental results confirm successful frequency synthesizer operation in which the spurious signal level is successfully reduced to less than that the MSB of the accumulator.

Hogg and Huberman have proposed a strategy for stabilizing chaotic multi-agent systems. This paper applies their strategy to a resource allocation problem in a manufacturing system consisting of two machines and two types of parts. These part-types conflict each other over resource allocation. We introduce a discrete-time model of the system by using game theory, and examine stability and bifurcation phenomena of its fixed point. We show by computer simulation that chaotic behaviors are observed after successive occurrence of period-doubling bifurcations. It is also shown that the optimal state of the system is stabilized by a reward mechanism.

In this paper, CDMA slotted ALOHA system with finite size of buffers is proposed. To analyze the system performance, we use the linear approximate solution based on restricted occupancy urn models. We evaluate the system performance in terms of throughput, average delay, and rejection probability and clarify the effect of buffer capacity.

A power amplifier employing a novel linearizing technique is proposed and is applied to digital mobile communication systems. The amplifier offers both high efficiency and excellent adjacent-channel power leakage (ACP) characteristics. The power added efficiency (PAE) of the proposed amplifier is 51% with an ACP of 45 dBc, which is the PDC standard (one of the Japanese mobile communication systems standards). This amplifier can be applied to various systems merely by changing the ROM data.

The increasing activity at millimeter wave frequency band and the growing demand for waveguide components to be applied for integrated circuit purpose have promoted the need for applying the field-theory-based approaches to the design procedure. In this paper, genetic algorithms (GA's) are applied to accurately design the iris-coupled waveguide filters based on network-boundary element method (NBEM). GA's model the natural selection and evolve towards the global optimum, thus avoid being trapped in local minima. Network-boundary element method, which combines boundary element method with network analysis method, derives the network parameters of the guided wave structures with less storage location and central processing unit time. Therefore, NBEM is a feasible and efficient field-theory-based approach for the GA optimization of waveguide filters. With NBEM performing the task of evaluating the performance of the filter designs optimized by the GA, rigorous and optimal designs of the waveguide filters are realized. The obtained analysis and optimization results are compared to a number of reference solutions to demonstrate the validity and accuracy of the proposed approach.

Two-dimensional (2-D) adaptive digital filters (ADFs) for 2-D signal processing have become a fascinating area of the adaptive signal processing. However, conventional 2-D FIR ADF's require a lot of computations. For example, the TDLMS requires 2N2 multiplications per pixel. We propose a new 2-D adaptive filter using the FFTs. The proposed adaptive filter carries out the fast convolution using overlap-save method, and has parallel structure. Thus, we can reduce the computational complexity to O(log2N) per pixel.

This paper describes a neuro-based optimization algorithm for three dimensional (3-D) rectangular puzzles which are the problems to arrange the irregular-shaped blocks so that they perfectly fit into a fixed three dimensional rectangular shape. First, the fitting function of the 3-D block, which means the fitting degree of each irregular block to the neighboring block and the rectangular configuration, is described. Next, the energy function for the 3-D rectangular puzzles is proposed, where the horizontal rotation of the block is also considered. Finally, our optimization method is applied to several examples using the 3-D analog neural array and it is shown that our algorithm is useful for solving 3-D rectangular puzzles.

This paper proposes an automatic structural programming system. Genetic Programming achieves success for automatic programming using the evolutionary process. However, the approach doesn't deal with the essential program concept in the sense of what is called a program in software science. It is useful that a program be structured by various sub-structures, i. e. subroutines, however, the above-mentioned approach treats a single program as one sequence. As a result of the above problem, there is a lack of reusability, flexibility, and a decreases in the possibility of use as a utilitarian programming system. In order to realize a structural programming system, this paper proposes a method which can generate a program constructed by subroutines, named formula, using the evolutionary process.

In [1], approximate eigenvalues and eigenvectors are defined and algorithms to compute them are described. However, the algorithms require a certain condition: the eigenvalues of M modulo S are all distinct, where M is a given matrix with polynomial entries and S is a maximal ideal generated by the indeterminate in M. In this paper, we deal with the construction of approximate eigenvalues and eigenvectors when the condition is not satisfied. In this case, powers of approximate eigenvalues and eigenvectors become, in general, fractions. In other words, approximate eigenvalues and eigenvectors are expressed in the form of Puiseux series. We focus on a matrix with univariate polynomial entries and give complete algorithms to compute the approximate eigenvalues and eigenvectors of the matrix.

We study the pm-degrees and pT-degrees of immune and bi-immune sets. We demonstrate the existence of incomparable pT-immune degrees in deterministic time classes.

The adaptive associative memory proposed by Ma is used to construct a new model of semantic network, referred to as associative semantic memory (ASM). The main novelty is its computational effectiveness which is an important issue in knowledge representation; the ASM can do inference based on large conceptual hierarchies extremely fast-in time that does not increase with the size of conceptual hierarchies. This performance cannot be realized by any existing systems. In addition, ASM has a simple and easily understandable architecture and is flexible in the sense that modifying knowledge can easily be done using one-shot relearning and the generalization of knowledge is a basic system property. Theoretical analyses are given in general case to guarantee that ASM can flawlessly infer via pattern segmentation and recovery which are the two basic functions that the adaptive associative memory has.

In high-frequency operation, it is difficult to obtain a large tuning range in load-pull measurement due to losses in the tuning network and RF-probes. In this paper, a low-loss on-wafer-tuning load-pull method is proposed. The output matching network consists of two CPWs connected to a FET output terminal. The impedance of the network can be controlled by changing the effective length of the CPWs by replacing RF-probes and removing air-bridges. To confirm the validity of this load-pull method, a K-band high-efficiency MMIC power amplifier has been designed using the method and fabricated. The amplifier demonstrates performance of 19. 5-dBm saturated output power, 12. 5-dB linear gain and 49. 3% maximum power-added efficiency (PAE) at Vds = 3 V for 26 GHz operation. At 1-dB gain-compression, the PAE is still as high as 44%. This high PAE result clearly indicates that the proposed method is a useful tool for designing power amplifiers, especially those for use in high-frequency (e.g. K-band) operation.

In this paper, we apply the Semi-markov Memory and Cache coherence Interference (SMCI) model, which we had proposed for invalidating based cache coherent parallel computers, to an updating based protocol. The model proposed here, the SMCI/Dragon model, can predict performance of cache coherent parallel computers with the Dragon protocol as well as the original SMCI model for the Synapse protocol. Conventional analytic models by stochastic processes to describe parallel computers have the problem of numerical explosion in the number of states necessary as the system size increases. We have already shown that the SMCI model achieved both the small number of states to describe parallel computers with the Synapse protocol and the inexpensive computation cost to predict their performance. In this paper, we demonstrate generality of the SMCI model by applying it to the another cache coherence protocol, Dragon, which has opposite characteristics than Synapse. We show the number of states required by constructing the SMCI/Dragon model is only 21 which is as small as SMCI/Synapse, and the computation cost is also the order of microseconds. Using the SMCI/Dragon model, we investigate several comparative experiments with widely known simulation results. We found that there is only a 5. 4% differences between the simulation and the SMCI/Dragon model.

Theoretical calculations of the pulsing operation and the intensity noise under the optical feedback are demonstrated for operation of the self-sustained pulsation lasers. Two alternative models for the optical feedback effect, namely the time delayed injection model and the external cavity model, are applied in a combined manner to analyze the phenomena. The calculation starts by supposing the geometrical structure of the laser and the material parameters, and are ended by evaluating the noise. Characteristics of the feedback induced noise for variations of the operating parameters, such as the injection current, the feedback distance and the feedback ratio, are examined. A comparison to experimental data is also given to ensure accuracy of the calculation.

In recent years, the rapid advancements of wireless communication technology and computer down-sizing technology have enabled users to utilize computing resources anywhere in the computer network. New applications constructed on the mobile database system are becoming popular. However, the current database systems do not provide special facilities for specific update operations in a mobile computing environment. Moreover, due to the lack of a common data handling method and a mutual communication mechanism, varieties in implementations may cause applications to be incompatible with each other. In this paper, we take up the issue of data handling, in a mobile computing environment, and propose an active mobile database system (AMDS) to solve this issue. First, we review the difficulties of dynamic update of databases in a mobile computing environment, and provide a basic concept of AMDS as a solution for these difficulties. In order to construct an AMDS, we focus on asynchronous events such as the appearance and disappearance of a mobile computer in a wireless communication cell. Then we provide a facility to specify the behavior of each system in Event-Condition-Action(ECA) rules in the same way as normal active database systems. Moreover, we show the architecture and the design of our implementation of AMDS. And, finally AMDS can be easily implemented as a common database infrastructure and work well on heterogeneous systems through indoor experiments.