This study proposes an amplitude limiting type spread spectrum communication to be applied to extremely low power radio wave communicaion and evaluates capability of the code division multiplex. First, changes in output from the correlation device, maximum power, and in allowable noise power are compared by computer simulation for the case where the number of multiplex channels is increased. Second, possible relationship between noise intensity and error rate is measured by actual loading experiments using a device developed for trial purpose. Third, majority decision logic is proposed for the said device to realize amplitude limiting type code division multiplex easily. When the amplitude is limited, the maximum power can be controlled at about 2 dB, and channels with more than half of the number of spread sign can be used. It is revealed that, in the spread spectrum, alteration of the number of multiplex channels is made easy by application of this method.

The purpose of our study is to develop an intelligent adaptive instruction system that manages intelligently the learner's estimated knowledge structure and optimizes the selection of problems according to his/her knowledge structures. The system adopts the dynamic problems of high school physics as a material of study, and is intended to operate on a UNIX Work Station. For these purposes, the system is composed of three parts, 1) interface part, 2) problem solving expert part, and 3) optimization expert system part for problem selection. The main feature of our system is that both knowledge structures of learner and teacher are represented by structural graph, and the problem selection process is controlled by the relationship between the learner's knowledge structure and the teacher's knowledge structure. In our system the relationship between these two knowledge structures is handled in the optimization expert system part for problem selection. In this paper the theory of the optimization expert system part for problem selection is described, and the effectiveness of this part is clarified through a simulation experiment of the originally defined matching coefficient.

We developed the computer calligraphy, that is, a computer formation of brush-written Kanji characters using calligraphic knowledge. The style of brush handwriting depends mainly on the way of using a writing brush. Brush writing skills include the direction of brush at the beginning, curvature and turning the brush, the brush-up at the termination point in a stroke. We make up the calligraphic knowledge base according to the above mentioned brush writing skills. For simulating real brush movement, we represent the brush contact form that is the brush shape on the writing plane as a brush-touch. The system can control the size and direction of this brush-touch during the brush simulation. The system simulates the real brush writing to move the brush-touch along the skeleton letter shape in the standard database. We get the brush written Kanji from the locus of the brush-touch movement. We can extend this system to the new on line training system for brush writing using the simulation of brushtouch movement modified by the pressure, speed and rotation of the writing brush, and the skeleton letters written by a learner from the tablet. This system is also useful for students learning how to write Japanese letters beautifully with brush.

This paper investigates the accepting powers of multi-inkdot two-way alternating pushdown automata (Turing machines) with sublogarithmic space and constant leaf-size. For each k1, and each m0, let weak-ASPACEm [L(n),k] denote the class of languages accepted by simultaneously weakly L(n) space-bounded and k leaf-bounded m-inkdot two-way alternating Turing machines, and let strong-2APDAm[L(n),k] denote the class of languages accepted by simultaneously strongly L(n) space-bounded and k leaf-bounded m-inkdot two-way alternating pushdown automata. We show that(1) strong-2APDAm [log log n,k+1]weak-ASPACEm[o(log n),k]φfor each k1 and each m1, and(2) strong-2APDA(m+1) [log log n,k]weak-ASPACEm[o(log n),k]φfor each k1 and each m0.

This paper obtains some new results about the existence, uniqueness, and global asymptotic stability of the equilibrium of a nonlinear continuous neural network, under a sufficient condition weaker than ones presented in the literature. The avobe obtained results can also imply the existing ones about avsolute stability of nonlinear continuous neural networks

Periodic reservation allows periodic and random packets to share the same satellite random access channel efficiently. The periodic reservation protocol is particularly suitable for mobile satellite position reporting services, where some of the information messages, such as dispatch function, are classified as "periodic" and others, such as signaling, are classified as "random." When a new mobile terminal logs on to the system, Network Management Center (NMC) reserves subsequent time slots for transmitting periodic packets without contention. A mobile terminal recognizes each time slot as "reserved" or "unreserved (available)" according to the broadcast message received from NMC. Other random packets use the slotted ALOHA protocol to contend with other mobile terminals for an unreserved time slot. The performance results suggest that the use of the periodic reservation protocol can be regarded as a viable solution for mobile satellite position reporting services such as automatic dependent surveillance (ADS).

A fault in multi-processing system arbitration circuits result in incorrect arbitration or abnormal operation of the system. A highly reliable system requires dependable arbitration in order to operate properly. Previously, we proposed alternate competing arbitration suitable for highly reliable systems. In this paper, we propose a method for improvement of fault detection and location using additional checkers. This method is effective to maintain reliability of the system.

Optical surface mount technology (O-SMT), which was proposed to provide a possible solution to growing serious problems in manufacturing process of optoelectronic products, is introduced. After discussing the basic idea of O-SMT, experimental results are also described to show its feasibility.

Polarization insensitive discrete electroabsorption modulators have been designed as an optical gating device. It reveals the first finding, to our knowledge, that the ratio of the optical confinement factor (Γ) to the differential of the values (ΔΓ) between TE and TM polarized lights decides polarization dependence of attenuation. The ratio ΔΓ/Γ is significantly reduced by increasing core thickness. Large optical confinement structures combining a thick InGaAsP bulk absorption layer and polyimide-buried mesa-ridge waveguide have fabricated. The ratio ΔΓ/Γ of the high-mesa structure was estimated to be less than 0.05 in the gain-region of an erbium-doped fiber amplifier (EDFA), which enable us extremely low polarization sensitivity less than 1 dB up to 20 dB extinction. Proper waveguide length of the structure allowed low insertion loss ( 9.3 dB), small loss-change ( 1.8 dB) and sufficient modulation depth ( 30 dB) simultaneously in the EDFA's gain region. The low-mesa structure provided low insertion loss around 7 dB with small deviation in the wavelength region. High modulation band-width and a polarization-insensitive optical gating waveform have also demonstrated.

This paper describes the design and performance of optical components for in-service fiber testing and monitoring in optical subscriber loops. As the number of test fibers increases, compact and cost-effective components are becoming more important. To meet this need, we have developed a highly-dense hybrid structure for optical couplers and filters, which both play key roles in testing systems. It was realized by utilizing a polyimide-base thin film filter and a waveguide-type wavelength insensitive coupler. This component operates by combining a signal and a test light with a ratio of 80/20% and isolating the test light with a value of 50 dB. The experimental samples were successfully fabricated with an excess loss of 1 dB, a return loss of 40 dB, a plolarization dependent loss (PDL) of 0.3 dB, and good environmental and mechanical stability. We successfully applied the samples to an optical branch module (OBM), and achieved a component density twice that of a conventional module. The optical characteristics of the OBM met our target values. The results we obtained for termination cords incorporating the polyimide-base filter were also satisfactory.

This letter shows an architectural approach for analyzing real-time aspects of distributed multimedia processing systems. The results of this letter are 1) to propose the concept real-time supporting environments which consist of real-time traffic management/control environment and real-time application environment and 2) to analyze the real-time requirements of such environments.

Banyan networks are used in multiprocessor computer applications for an ATM switching. In this paper, we study the continuous blocking of the first n-stage which makes the performance of the banyan networks decrease. We use the 2-dilated banyan networks into the banyan networks to remove the continuous blocking of the first n-stage. We call the new networks as the hybrid dilated banyan networks. We explain how to analyze the throughput of this networks at each stage. Based on the analysis of input rate and output rate at each stage, we can design the hybrid dilated banyan networks with the desirable output rate. The result of analysis shows the hybrid dilated banyan networks have higher performance and feasibility than the banyan networks.

The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.

This paper analyzed the connection points of Main Distribution Frames (MDF), which are installed between outside plants and inside plants (service nodes). This paper also proposes a connecting system for forthcoming FITL (Fiber In The Loop) networks. NTT has developed the Subscriber Line Cross-Connecting Module (LXM) for the FITL network and will continue to introduce LXMs and deploy optic subscriber networks in big cities throughout Japan.

Asynchronous Transfer Mode (ATM) is considered to bo the key technology for realizing B-ISDN. This paper discusses current research on ATM switching nodes for high-speed communication networks. Although some ATM switching nodes have been deployed, much work continues for resolving problems as regards operations and maintainability, such as ATM layer performance evaluation including layered management scheme upon detection of line failure, function test methods regarding channel connectivity for multicasting, and real-time ATM traffic-monitoring mechanism with QoS control. To achieve sufficient ATM node maintainability, the ATM cell transfer quality on the VP and VC levels should be ensured both within the ATM nodes and between adjacent ATM nodes. Since ATM switching nods handle many kinds of virtual paths and virtual channels, each channel's connectivity must be confirmed. This paper proposes ATM layer performance evaluation concept, layered management scheme upon detection of line failure, function test methods for a multicast switch using test cells that periodically pass through pre-determined switching path routes. It also proposes the concept of test cell generation for simulating multiplexed ATM test cells taking ATM truffic characteristics into account. Furthermore, this paper describes a fault diagnosis scheme using test cells that can continually observe the entire ATM connection length in the system. A real-time traffic monitoring hardware configuration and an interface with software control are also discussed and it is clarified that the required functions can be realized by using commercially available DSPs.

The Time-Slicing paradigm is a newly developed method for the training of neural networks for speech recognition. The neural net is trained to spot the syllables in a continuous stream of speech. It generates a transcription of the utterance, be it a word, a phrase, etc. Combined with a simple error recovery method the desired units (words or phrases) can be retrieved. This paradigm uses a recurrent neural network trained in a modular fashion with natural connectionist glue. It processes the input signal sequentially regardless of the input's length and immediately extracts the syllables spotted in the speech stream. As an example, this character string is then compared to a set of possible words, picking out the five closest candidates. In this paper we describe the time-slicing paradigm and the training of the recurrent neural network together with details about the training samples. It also introduces the concept of natural connectionist glue and the recurrent neural network's architecture used for this purpose. Additionally we explain the errors found in the output and the process to reduce them and recover the correct words. The recognition rates of the network and the recovery rates for the words are also shown. The presented examples and recognition rates demonstrate the potential of the time-slicing method for continuous speech recognition.

Transport-processing FPGAs have been proposed for flexible telecommunication systems. Since those FPGAs have finer granularity of logic functions to implement circuits on them, the amount of routing resources tends to increase. In order to keep routing congstion small, it is necessary to execute placement and routing simultaneously. This paper proposes a simultaneous placement and global routing algorithm for transport-processing FPGAs whose primary objective is minimizing routing congestion. The algorithm is based on hierarchical bipartition of layout regions and sets of LUTs (Look Up Tables) to be placed. It achieves bipartitioning which leads to small routing congestion by applying a network flow technique to it and computing a maximum flow and a minimum cut. If there exist connections between bipartitioned LUT sets, pairs of pseudo-terminals are introduced to preserve the connections. A sequence of pseudo-terminals represents a global route of each net. As a result, both placement of LUTs and global routing are determined when hierarchical bipartitioning procedures are finished. The proposed algorithm has been implemented and applied to practical transport-processing circuits. The experimental results demonstrate that it decreases routing congestion by an average of 37% compared with a conventional algorithm and achieves 100% routing for the circuits for which the conventional algorithm causes unrouted nets.

This paper concerns a Petri-net-based model for describing reactive and concurrent systems. Although many high-level Petri nets have been proposed, they are insufficiently practical to describe reactive and concurrent systems in the detail modeling, design and implementation phases. They are mainly intended to describe concurrent systems in the rough modeling phase and lack in several important features (e.g., concurrent tasks, task communication/synchronization, I/O interface, task scheduling) which the most actual implementations of reactive and concurrent systems have. Therefore it is impossible to simulate and analyze the systems accurately without explicitly modeling these features. On the other hand, programming languages based on Petri nets are deeply dependent on their execution environments and not sophisticated as modeling and specification languages. This paper proposes MENDEL net which is a high-level Petri net extended by incorporating concurrent tasks, task communication/synchronization, I/O interface, and task scheduling in a sophisticated manner. MENDEL nets are a wide-spectrum modeling language, that is, they are suitable for not only modeling but also designing and implementing reactive and concurrent systems.

This paper describes an adaptive neural vector quantization algorithm with a deleting approach of weight (reference) vectors. We call the algorithm an adaptive learning and self-deleting algorithm. At the beginning, we introduce an improved topological neighborhood and an adaptive vector quantization algorithm with little depending on initial values of weight vectors. Then we present the adaptive learning and self-deleting algorithm. The algorithm is represented as the following descriptions: At first, many weight vectors are prepared, and the algorithm is processed with Kohonen's self-organizing feature map. Next, weight vectors are deleted sequentially to the fixed number of them, and the algorithm processed with competitive learning. At the end, we discuss algorithms with neighborhood relations compared with the proposed one. The proposed algorithm is also good in the case of a poor initialization of weight vectors. Experimental results are given to show the effectiveness of the proposed algorithm.

We found a novel connecting orbit in the averaged Duffing-Rayleigh equation. The orbit starts from an unstable manifold of a saddle type equilibrium point and reaches to a stable manifold of a node type equilibrium. Although the connecting orbit is structurally stable in terms of the conventional definition of structural stability, it is structually unstable since a one-deimensional manifold into which the connecting orbit flows is unstable. We can consider the orbit is one of global bifurcations governing the differentiability of the closed orbit.