Outage probability evaluation for a new category of wireless access systems is discussed. Wireless access systems dealt with in this paper are links which connect a portable terminal to a base station through a line-of-sight path. It is also assumed that the terminal equipment is operated in a still atate during actual communications. This mobility restriction enables the wireless access to have a capacity as high as the Mbit-order with high quality performance. Multipath fading observed in such a system may have more moderate variations than Rayleigh distribution. This paper tentatively designates the above wireless access as relocatable systems, and attempts to analyze their error performance, approximating the fading characteristics with Gamma-distribution. Also dynamic relations between bit error rate (BER) and signal-to-noise ratio are calculated under Gamma-distribution fading. Based on the analyses prediction methods for outage probability of typical QPSK systems are given, and thus it is established to design the performance aspect of relocatable systems with different features from both fixed and mobile systems.

The usage of a diagram, which we call a state fence diagram (SFD), for analyzing discrete event systems such as reactive systems, is presented. This diagram is useful for event concurrent response and scenario analysis by using its three description styles.

We present a very fast method for calculating an inverse filter for audio reproduction system. The proposed method of FFT-based inverse filter design, which combines the well-known principles of least squares optimization and regularization, can be used for inverting systems comprising any number of inputs and outputs. The method was developed for the purpose of designing digital filters for multi-channel sound reproduction. It is typically several hundred times faster than a conventional steepest descent algorithm implemented in the time domain. A matrix of causal inverse FIR (finite impulse response) filters is calculated by optimizing the performance of the filters at a large number of discrete frequencies. Consequently, this deconvolution method is useful only when it is feasible in practice to use relatively long inverse filters. The circular convolution effect in the time domain is controlled by zeroth-order regularization of the inversion problem. It is necessary to set the regularization parameter β to an appropriate value, but the exact value of β is usually not critical. For single-channel systems, a reliable numerical method for determining β without the need for subjective assessment is given. The deconvolution method is based on the analysis of a matrix of exact least squares inverse filters. The positions of the poles of those filters are shown to be particularly important.

Recently, a wavelength division multi/demultiplexing system has been viewed with keen interest because it is possible to increase the transmission capacity and system flexibility. An arrayed waveguide grating (AWG) type of Multi/demultiplexer which is one of the key components to realize such a system has been developed by using Planar Lightwave Circuits (PLCs). Newly designed optical circuits have been incorporated into the AWG to control the center wavelength and to expand the pass band width. The 3 dB pass band width is 1.4 times that of a conventional AWG. It is confirmed that the newly developed AWG has low polarization dependence, low temperature dependence and high reliability.

We extend the Rabin cryptosystem to the Eisenstein and Gauss fields. Methods for constructing the complete representation class and modulo operation of the ideal are presented. Based on these, we describe the methods of encryption and decryption. This proposed cryptosystem is shown to be as intractable as factorization, and recently presented low exponent attacks do not work against it.

In this paper, we propose a handoff scheme with two-level priority for the reservation of handoff request calls in mobile cellular radio systems. We assume two types of mobile subscribers with different distributions of moving speed, that is, users with low average moving speed (e.g., pedestrians) and high average moving speed (e.g., people in moving cars). A fixed number of channels in each cell are reserved exclusively for handoff request calls. Out of these number of channels, some are reserved exclusively for the high speed handoff request calls. The remaining channels are shared by both the originating and handoff request calls. In the proposed scheme, both kinds of handoff request calls make their own queues. The system is modeled by a three-dimensional Markov chain. We apply the Successive Over-Relaxation (SOR) method to obtain the equilibrium state probabilities. Blocking probabilities of calls, forced termination probabilities and average queue length of handoff calls of each type are evaluated. We can make the forced termination probabilities of handoff request calls smaller than the blocking probability of originating calls. Moreover, we can make the forced termination probability of high speed handoff request calls smaller than that of the low speed ones. Necessary queue size for the two kinds of handoff request calls are also estimated.

Because a massively parallel computer processes vast amounts of data and generates many access requests from multiple processors simultaneously, parallel secondary storage requires large capacity and high concurrency. One effective method of implementation of such secondary storage is to use disk arrays which have multiple disks connected in parallel. In this paper, we propose a parallel file access method named DECODE (dynamic express changing of data entry) in which load balancing of each disk is achieved by dynamic determination of the write data position. For resolution of the problem of data fragmentation which is caused by the relocation of data during a write process, the concept of "Equivalent Area" is introduced. We have performed a preliminary performance evaluation using software simulation under various access statuses by changing the access pattern, access size and stripe size and confirmed the effectiveness of load balancing with this method.

A connection admission control (CAC) that guarantees a negotiated cell-loss ratio for all cell-streams passing through the usage parameter control (UPC) in ATM networks is proposed. In particular, the cases in which a jumping-window, sliding-window, or continuous-leaky-bucket scheme are used for peak-cell-rate policing are discussued, and the upper bound for cell-loss ratio of the cell-streams passing through each type of UPC is derived. The CACs based on the derived cell-loss-ratio upper bounds ensure the quality of service in all cases by combining the relevant UPCs. There are three possible combinations of CAC and UPC, depending on the UPC mechanism used. The impact of the choice of CAC and UPC combination on bandwidth utilization is discussed using several numerical examples.

This paper studies stabilization of timed discrete event systems with forcible events. We present an algorithm for computing the region of weak attraction for legal states.

In this paper, we extend the circuit partitioning algorithm which we have proposed for multi-FPGA systems and present a new algorithm in which the delay of each critical signal path is within a specified upper bound imposed on it. The core of the presented algorithm is recursive bipartitioning of a circuit. The bipartitioning procedure consists of three stages: 0) detection of critical paths; 1) bipartitioning of a set of primary inputs and outputs; and 2) bipartitioning of a set of logic-blocks. In 0), the algorithm computes the lower bounds of delays for paths with path delay constraints and detects the critical paths based on the difference between the lower and upper bound dynamically in every bipartitioning procedure. The delays of the critical paths are reduced with higher priority. In 1), the algorithm attempts to assign the primary inputs and outputs on each critical path to one chip so that the critical path does not cross between chips. Finally in 2), the algorithm not only decreases the number of crossings between chips but also assigns the logic-blocks on each critical path to one chip by exploiting a network flow technique. The algorithm has been implemented and applied to MCNC PARTITIONING 93 benchmark circuits. The experimental results demonstrate that it resolves almost all path delay constraints with maintaining the maximum number of required I/O blocks per chip small compared with conventional alogorithms.

In the proposed architecture, switching system hardware resources are allocated at the equipment level rather than at the component level of LSI chips. Equipment using these resources can thus be shared between independent systems. The efficiency of system development is improved by using structural elements called functional blocks (FBs). The hardware in each FB consists of a shared part (amicroprocessor, its peripheral circuitry, and memory) and a dedicated part that implements the specific functions of the FB. Firmware loaded into the microprocessor consists of a shared part and a dedicated part that corresponds to the hardware parts. Each FB also has its own built-in autonomous testing function to test the reliability of that FB and has its own identification function. By combining these FBs, this approach can flexibly cope with various switching system configurations for plain old telephone service (POTS), integrated services digital network (ISDN), and broad-band ISDN (B-ISDN). Tests using several types of FBs showed that the shared hardware and firmware parts of an FB can be shared between blocks. An architecture based on FBs results in a platform that can handle the hardware for various systems, making it easy to construct new switching systems.

The currying of term rewriting systems (TRSs) is a transformation of TRSs from a functional form to an applicative form. We have already introduced an order-sorted version of currying and proved that the compatibility and confluence of order-sorted TRSs were preserved by currying. In this paper, we focus on a key property of TRSs, completeness. We first show some proofs omitted in Ref. [3]. Then, we prove that the SN (strongly normalizing) property, which corresponds to termination of a program, is preserved by currying. Finally, we prove that the completeness of compatible order-sorted TRSs is preserved by currying.

We are working on an algorithm to optimize the logic circuits that can be realized on the super fine-grain parallel processing architecture. As a part of this work, we have developed an inverter reduction algorithm. This algorithm is based on modeling logic circuits as dynamical systems. We implement the algorithm in the PARTHENON system, which is the high level synthesis system developed in NTT's laboratories, and evaluate it using ISCAS85 benchmarks. We also compare the results with both the existing algorithm of PARTHENON and the algorithm of Jain and Bryant.

Periodic solutions of slow-fast systems called "canards," "ducks," or "lost solutions" are examined in a second order autonomous system. A characteristic feature of the canard is that the solution very slowly moves along the negative resistance of the slow curve. This feature comes from that the solution moves on or very close to a curve which is called slow manifolds or "rivers." To say reversely, solutions which move very close to the river are canards, this gives a heuristic definition of the canard. In this paper, the generation mechanism of the canard is examined using a piecewise linear system in which the cubic function is replaced by piecewise linear functions with three or four segments. Firstly, we pick out the rough characteristic feature of the vector field of the original nonlinear system with the cubic function. Then, using a piecewise linear model with three segments, it is shown that the slow manifold corresponding to the less eigenvalue of two positive real ones is the river in the segment which has the negative resistance. However, it is also shown that canards are never generated in the three segments piecewise linear model because of the existence of the "nodal type" invariant manifolds in the segment. In order to generate the canard, we propose a four segments piecewise linear model in which the property of the equilibrium point is an unstable focus.

Integrating the power supply and signal processing circuit into one chip is an important step towards achieving a system-on-chip. This paper reviews and looks at the current technologies and their trends for power supply components such as DC-DC converters, intelligent power LSIs, and thin-film magnetic devices for the system-on-chip. A device structure has been proposed for the system-on-chip that is based on a quasi-SOI technique, in which the buried oxide layer is partially removed from the SOI substrate. In this structure, the CMOS devices for the digital signal-processing circuit and the bipolar transistors are formed in a conventional SOI region, and the CMOS analog devices and high-voltage devices are formed in a quasi-SOI region.

The use of existing metallic local line facilities is being studied for the provision of high-speed digital transmission services. Local line characteristics have to be modeled in the form of the objective requirements that should be met by DSL for estimating the feasibility of the service provision in the actual network. This paper presents the results of a study that models the metallic media characteristics of NTT's local network. First, the line lenghts determined by the existing local line deployment rule and the cable types used in the networks are introduced. Second, the values of crosstalk characteristics, the most significant factors in limiting DSL range, are given by classifying essential line conditioning states of each cable. The values of crosstalk characteristics are newly computed by taking into account detailed cable pair-binding (cabling) structures, and the worst case values among all possible combinations of multiple inter-pair interfering-interfered relationships within a cable are given though a previous study approximated cable pair-binding structures. The crosstalk characteristics of NTT's and American local networks are also compared. A modified approximate equation of line propagation characteristics is also proposed for representative local lines, and its precision is verified by comparing simulation results to actual measurements in both frequency and time domains.

The present paper describes a novel approach to interconnecting and assembling components of MEMS at room temperature. The main drawback of the conventional bonding methods is their rather high process temperatures. The new method, which is referred as the surface activated bonding (SAB), utilizes the phenomena of the adhesion between two atomically clean solid surfaces to enable the bonding at lower temperature or even at room temperature. In the bonding procedure, the surfaces to be bonded are merely brought into contact after sputter-cleaning by Ar fast atom in ultrahigh vacuum conditions. TEM observations of the bonded interfaces show that a direct bonding in atomic scale is achieved in the interface between the micro-components. Based on the concept of this new bonding technology, a micro-assembly system was developed. The micro-assembly system is operated by means of a virtual manipulation system in which 3D model of the micro-components are manipulated virtually in a computer graphics constructed in the world wide web (WWW) scheme. The micro-assembly system will provide a new design tool of three dimensional MEMS by combining the possibility of the flexible assembly and the intuitive operations.

In this paper, an efficient one-way point-to-multipoint communication protocol (PTMP) is proposed. The PTM protocol is helpful to distribute information to many workstations simultaneously and correctly. The PTM protocol is designed for network channels with low error possibility. The PTM protocol utilizes broadcast for data distributing. Re-transmission request for lost packet is returned to the server, and acknowledgment for correctly received packets is not returned to the server. We have applied the protocol to the network presentation system. The network presentation system is intended to display same graphical images to multiple workstations simultaneously on an X window system. This presentation system is able to provide services for at least forty X servers simultaneously, the capacity is limited to X server performance, except for pixmap drawing. For the case of pixmap drawing, the system capacity is limited to the network bandwidth. To solve network bandwidth problem, we combined PTM protocol with the network presentation system. With PTM protocol, system performance is improved and the use of network bandwidth is lowered.

Narrow-band ISDN services may experience nonstationary traffic conditions. Therefore, switch design should take account of these conditions. We propose new performance measures for switching systems and describe a traffic model, which is a mixture of stationary Poissonian traffic and momentarily focused traffic. On the basis of this model, performance measures are determined so as to satisfy grade of service requirements that are in effect during some short interval after the momentarily focused traffic enters the system. We also propose an overload control scheme that uses these new performance measures. Finally, we show practical and numerical examples for the performance measures and overload control scheme.

In accordance with the diffusion of applications, such as the Desk Top Publishing system, the Document Formatting system and the Document Editing system, it is easy to make a document by using a computer. However, as for allocating the diagrams (figures and tables), there are few document processing systems able to allocate diagrams on the appropriate places automatically. In a document processing system it is a very important issue to allocate diagrams on the most suitable places. This paper defines the criteria for allocating diagrams on the suitable positions by investigating published papers. These criteria concern 1) the order of diagrams to be allocated, 2) the stability of the diagram allocations, 3) the distance between the diagram and the location of the corresponding first reference in the text, 4) the allocation balance of diagrams in a text, 5) the restricted areas where diagrams shouldn't be allocated, 6) the allocation priorities between diagrams of different width. Moreover, this paper proposes a method for deciding the diagram allocations satisfying the above criteria automatically and fast on document formatting systems. In this case we have limited its application to one type of ducuments, which is papers. Especially, this method can skillfully allocate diagrams of different width on the page by reallocating the diagrams and texts within it, and can allocate diagrams over the document uniformly.