Modeling and performance analysis have played an important role in the economical design and efficient operation of switching systems, and is currently becoming more important because the switching systems should handle a wide range of traffic characteristics, meeting the grade of service requirements of each traffic type. Without these techniques we could no longer achieve economy and efficiency of the switching systems in complex traffic characteristic environments. From the beginning of research on electronic switching systems offering circuit-switched applications, Stored Program Control (SPC) technology has posed challenges in the area of modeling and performance analysis as well as queueing structure, efficient scheduling, and overload control strategy design. Not only teletraffic engineers and performance analysts, but also queueing theorists have been attracted to this new field, and intensive research activities, both in theory and in practice, have continued over the past two decades, now evolving to even a broader technical field including traditional performance analysis. This article reviews a number of important issues that have been raised and solved, and whose solutions have been reflected in the design of SPC switching systems. It first discusses traffic problems for centralized control systems. It next discusses traffic problems inherent in distributed switching systems.

The embedded Markov processes associated with Markovian queueing systems are closely related, and their relationships are important for establishing an analytical basis for performance evaluation techniques. As a first step, we analyze the embedded processes associated with a general M/M/1 queueing system. Linear transformations between the infinitesimal generators and the transition probability matrices of embedded processes at arrival and departure times are explicitly derived. Based upon these linear transformations, the equilibrium distributions of the system states at arrival and departure times are obtained and expressed in terms of the equilibrium distribution at arbitrary times. The approach presented here uncovers an underlying algebraic structure of M/M/1 queueing systems, and establishes an algebraic methodology for analyzing the equilibrium probabilities of the system states at arrival and departure times for more general Markovian queueing systems.

This paper presents an efficient algorithm for computing the capacity of discrete memoryless channels. The algorithm uses Newton's method which is known to be quadratically convergent. First, a system of nonlinear equations termed Kuhn-Tucker equations is formulated, which has the capacity as a solution. Then Newton's method is applied to the Kuhn-Tucker equations. Since Newton's method does not guarantee global convergence, a continuation method is also introduced. It is shown that the continuation method works well and the convergence of the Newton algorithm is guaranteed. By numerical examples, effectiveness of the algorithm is verified. Since the proposed algorithm has local quadratic convergence, it is advantageous when we want to obtain a numerical solution with high accuracy.

This paper describes a new method for verifying designs at the RTL with respect to their specifications at the functional level. The base of the verification method shown here is the translation of the specification and design representations to graph models, where the descriptions common to both representations have a symbolic representation. These symbol labeled graphs are then simplified and, by solving the all node-pair path expression problem for them, a pair of regular expressions is obtained for every two nodes in the graphs. The first regular expression in each pair represents the flow of control and the second one the flow of data between the corresponding nodes. The process of verification is carried out by checking whether or not every pair of regular expressions of the specification has a corresponding pair in the design.

Boolean unification is an algorithm to obtain the general solution of a given Boolean equation. Since a general solution provides a way to represent a complete don't care set, Boolean unification can be a powerful technique when applied to logic synthesis. In this paper we present various applications of Boolean unification to combinational logic synthesis. Three topics of combinational logic synthesis: redesign, multi-level logic minimization and minimization of Boolean relations are discussed. All these problems can be uniformly formalized as Boolean equations. Experimental results are also reported.

This paper presents a protocol verification method which verifies that the behaviors of a protocol meet requirements. In this method, a protocol specification is expressed as Extended Finite State Machines (EFSM's) that can handle variables, and requirements are expressed using a branching-time temporal logic for a concise and unambiguous description. Using the acyclic expansion algorithm extended such that it can deal with EFSM's, the verification method first generates a state transition graph consisting of executable transitions for each process. Then a branching-time temporal logic formula representing a requirement is evaluated on one of the generated graphs which is relevant to the requirement. An executable state transition graph for each process is much smaller than a global state transition graph which has been used in the conventional verification techniques to represent the behaviors of the whole protocol system consisting of all processes. The computation for generating the graphs is also reduced to much extent for a large complex protocol. As a result, the presented method achieves efficient verification for requirements regarding a state of a process, transmission and reception of messages by a process, varibales of a process and sequences that interact among processes. The validity of the method is illustrated in the paper by the verification of a path-updating protocol for requirements such as process state reachability or fair termination among processes.

High frequency and low power 128/129 dual modulus prescaler ICs are developed for mobile communication applications, using 0.5 µm GaAs MESFET technology. Provided with an on-chip voltage regulator, a prescaler IC with an input amplifier operates in a wide frequency range from 200 MHz to 1,500 MHz at input power from -15 dBm to +17 dBm at the temperature of -30 to +120 with supply voltage of 2.7 V, 3.0 V and 5.0 V. At the same time, it demonstrated its low power characteristics consuming 3.68 mA with 3.0 V at +30 in operation, 0.16 mA while powered-off. Another prescaler IC without an input amplifier operates up to 1,650 MHz with Vdd=2.7 V, 3.0 V and 5.0 V at +30, dissipating 2.74 mA/3.0 V.

An accurate numerical solution is presented for the electromagnetic scattering from infinite strip gratings attached to both sides of a dielectric slab. This structure is a model of polarization discriminating devices. The period of the strips is common to both planes, but the widths and the axes may be different. The direction of propagation and the polarization of an incident plane wave are arbitray. We derive a set of singular integral equations and solve it by the moment method, where the Chebyshev polynomials are successfully used as the basis and the testing functions. This method is accurate and effective owing to the incorporation of the edge condition and the decomposition of the kernel functions into the singular and the regular parts. Numerical calculations are carried out for the purpose of designing polarization discriminators, and it is shown that the band width is widened by decreasing the permittivity of the slab. The cross-polarization characteristics at skew incidence are also discussed.

As the size and complexity of network increases, the distributed systems management (DSM) will be vital in order to improve the availability of network management, to reduce the complexity of network operations, and to provide the high reliability. In this paper, we (1) describe general requirements required for systems management in distributed environment, (2) introduce the basic structure of distributed network management system (DNMS) for efficient network management, and also especially illustrate the concrete design of system management application process which is an important element among them, (3) propose the connectionless CMIP to accomplish for effectively managing the distributed management system, and indicate its efficiency; this protocol is available to manage dynamically changing DSM environment, to negotiate among the managing systems, to handle the dynamic informations etc. Finally, (4) the behavior and software structure of a suggested management system during negotiation to execute the received request for implementation are presented.

Bifurcations of the periodic solutions of the space-clamped Hodgkin-Huxley equations for the muscle membrane are studied regarding the chloride conductance as a parameter. A limit cycle appears at a Hopf bifurcation and disappears at a homoclinic orbit. With high sodium permeability, a subcritical period doubling bifurcation occurs before it disappears.

This paper describes a method of evaluating operations effort for fiber optic subscriber loops, such as the Central Terminal/Remote Terminal (CT/RT) system, which can economically provide a variety of telecommunication services. Four system configurations with different operation procedures are evaluated by simulation. By evaluating the operating costs associated with service provisioning, it is shown that automatic distributing frames are cost effective in subscriber loops with CT/RT systems. Moreover, the most economical operation strategies for installing and extending subscriber boards are discussed in terms of facility and operations cost.

This paper discusses and evaluates, from the viewpoints of definition, analysis, and performance, frequency assignment schemes that enable the efficient assignment of multiple-bandwidth carriers on the transponder in SCPC/FDMA systems with demand assignment operation. The system considered handles carriers of two different bandwidths, and assigns only consecutive slots on the transponder band to broadband carriers. Three types of frequency assignment schemes are proposed, each of which incorporates one or both of two assignment concepts: (1) pre-establishment of assignment priorities on the transponder band, and (2) establishment of broadband slots to guide broadband carrier assignment. Following a definition of the schemes, equations are derived to theoretically analyze performance factors such as call loss for the narrowband and broadband carriers, and system utilization efficiency. Finally, theoretical performance calculated for various traffic and system conditions are presented and evaluated, for the purpose of comparison between the three schemes. Computer simulation results are also presented, to demonstrate the accuracy of the derived equations and to supply data for models too large for theoretical computation. Main results obtained are as follows. (1) Regardless of traffic or system conditions, the assignment scheme incorporating both assignment priorities and broadband slots shows the best performance in terms of broadband call loss and system utilization efficiency. (2) The establishment of broadband slots improves performance when the ratio of broadband traffic to the total traffic volume is high, but worsens performance when the narrowband traffic ratio is higher. (3) All aspects of performance improve with the increase of the total number of assignable slots on the transponder band.

A frame-installed lightwave synthesizer is constructed for optical frequency-division-multiplexing (FDM) communication. The synthesizer consists of two DFB diode lasers, electrical feedback loops, and an HCN gas cell used as a frequency reference at v0=192,843GHz (1.55459µm in wave-length). Output frequency can be stabilized at anywhere within v0(220) GHz. The beat note observed between the synthesizer and another HCN-stabilized DFB laser is constant within 2MHz over 100 hours. Frequency stability better than 410-10 (80kHz, without normalization) is obtained for an averaging time of 200s.

This paper outlines an approach for specifying emissions performance at the component level. The objective is to move towards an industry specification for radiated emissions from large integrated circuits in order to facilitate cost effective system design for EMI compliance. Simple models of the mechanisms of direct chip radiation are provided based on the physical and electrical structure of large integrated circuits. These models lead to simple algorithms for estimating the total IC radiation based on IC design parameters. These models can be related to proposed emissions limits based on the desired application of the IC. Finally a measurement methodology is described which permits evaluation of the IC's relative to the limits and provides the information required to make detailed simulation models.

It has been recognized that there exist some disparities between properties of continuous control systems and those of discrete ones which are obtained from their continuous counterparts by use of a sampler and zero order hold. This still remains true even if the sampling rate becomes fast enough and sometimes causes unfavorable effects in control systems design. To reconcile with this conflict, use of delta operator has been proposed in place of z-operator recently. This note formulates a delta domain Lyapunov matrix equation and shows that the equation actually mediates the discrete Lyapunov equation and its continuous counterpart.

New methods are needed for accessing very large information services. This paper proposes the use of a user model neural network to allow better access to a news service. The network is constructed on the basis of articles read, and articles marked as rejected. It adapts over time to better represent the user's interests and rank the articles supplied by the news service. Using an augmented keyword search we can also search for articles using keywords in conjunction with the user model neural network. Trials of the system in a USENET news environment show promising results for the use of this approach in information retrieval.

Information technology equipment connected to telecommunications line can be a source of electromagnetic interference. Two sources of interference have been under evaluation. One is the digital pulses in the switching regulator and the clock oscillator, and the other is the signal's common mode voltage. In this paper, the interference-inducing mechanism for the signal's common mode voltage and a method for measuring the interference are described. An equivalent circuit representing both the equipment and the line is derived on the basis of the interference-inducing model. A method for estimating the signal's common mode voltage from the differential mode voltage and the line unbalance is obtained using the equivalent circuit. It is confirmed that the level difference between the estimated and the measured common mode level is less than 3dB.

Networks in this paper consist of non-commensurate transmission lines with branches and branching resistors at junctions. When signals on a transmission line are divided multiple ways at the junctions of branched lines, multiple reflection waves occur by the impedance mismatching. For the analysis of multiple reflections and network design, lattice diagrams have been used so far. However, the expansions of network transfer functions provide an easier way for the same purpose as in the case of lattice diagram. The output transient responses can be directly calculated from the expansions of network transfer functions or can be numerically calculated by software such as the fast Laplace transform. Therefore, once the network transfer functions are given, calculation of transient responses can be carried out quite easily. In this paper, the expansions of network transfer functions have been derived with respect to delay elements ξi=exp(-sτi) by formularizing the propagation of multiple reflection waves, and then the multi-variable rational network transfer functions have been obtained from the expansions. As an example, a 3-port transmission line network with normalized characteristic impedances 1, 1, 6 and normalized branching resistors 1/23, 1/23, 126/23 has been taken up. As the terminal resistances at output ports can be determined from the relation of the first arriving wave to the steady state, the design of 3-port transmission line networks which will furnish output waveforms similar to the waveform of the input within given tolerances has been considered. The output waveforms have been calculated for pure terminal resistances and for the pure terminal resistances plus parasitic parallel capacitances.

Proposed here is an internal representation and mapping method for multimedia information in which retrieval is based on the impression documents desired to make. A user interface design for a system using this method is also proposed. The proposed internal representation and mapping method represents each desired document impression as an axis in a semantic space. Documents are represented as points in the space. Queries are represented as subspaces. The proposed user interface design employs a method of visual presentation of the semantic space. Pictorial examples are given to illustrate the range of impressions represented by the axes. The relations between the axes are represented by dispersion diagrams for the documents stored in the document base. With this method, the user can intuitively decide the appropriate subspace for his needs and can specify it directly. For evaluation purposes, a prototype system has been developed. An image retrieval experiment shows that the proposed internal representation and mapping method and the user interface design provide effective tools for information retrieval.

We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.