This paper describes a parameter extraction system that can easily accommodate many MOSFET models. The model-adaptability is contributed by tow factors; a model-adaptable initial value estimation technique and an environment which stores and reuses extraction procedures. A designer can easily develop an extraction procedure for a new MOSFET model by modifying a procedure for another MOSFET model developed previously. We have verified that the system is suitable for major SPICE models.

Various approaches on optical network systems using wavelength-division multiplexing (WDM) technique have been proposed. It is difficult to make a scale of WDM network larger since a number of the optical wavelength which can be used is limited. In order to make easily larger scale of network, multi-hop WDM network have been proposed. We have studied 2-hop network: RookNet which has simple routing algorithm and high network throughput. Nodes in RookNet are divided into row groups and column groups and are placed in a mesh form. Packets are transferred between nodes over 1-hop or 2-hops. The 2-hop transfer means that a source node sends packets to a destination node via a relay node. When 2-hop traffic increases, relay processing time in a relay node is increasing. This is the reason that network throughput becomes low. To solve this problem is very important. In this paper, we show RookNet rearrangement algorithm which replaces location of node within group so as to decrease the 2-hop traffic and to maintain high network throughput. Proposed rearrangement algorithm can achieve improvement of 10 percent in terms of throughput. We also propose RookNet configuration which discriminates optical wavelength and subcarrier effectively in order to decrease the relay processing time.

In this paper, the computational model of Quasi-Ecosystem that is constructed in the way of bottom up, i.e., that consists of herbivores, carnivores and plants is proposed and the simulation result is shown. The behavior pattern of the model is represented by finite state automata. Simple adaptive behavior of animals was observed in this simulation. This indicates that mutation is effective method for self adaptive behavior and the possibility that the model can be used as a framework for autonomous agents.

Recenty, the Josephson effect-based voltage standard has been realized by using the Josephson junction array which is constructed by integrating many Josephson junctions. In this article, the 1-V Josephson-junction-array voltage standard used in routine calibration work and further development of the 10-V Josephson junction array at the Electrotechnical Laboratory (ETL) are introduced.

This paper describes a SQUID magnetometer and the measurement of small signals. It also describes the current state of SQUID technology developed in the SSL project.

This paper describes a fully digitized modem designed for variable baud rate transmission systems with the aim of efficiently providing multimedia services over a wireless communication network. The concept of a variable baud rate wireless communication system is discussed focusing on the access scheme and channel allocation from the viewpoint of frequency utilization efficiency. For easy system construction, we propose a fully digitized variable baud rate modem based on multirate digital signal processing, taking into account the need for even performance and easy clock control for all transmission rates. We also discuss the operational principle of modulation, the degradation factor in the A/D converter, and the configuration of the clock recovery circuit. Steady modulation performance can be kept by generating the same frequency system clock for all transmission rates and using the sampling rate conversion technique without selecting the channel filter for each transmission rate. It is proved by the analysis of the degradation factor in the A/D converter that only the bandwidth of the channel filter in demodulator should be changed for the transmission rate. A double loop clock recovery configuration capable of both tank-limit type and baseband estimation type clock recovery is shown to be suitable for this system. The tank-limit clock recovery circuits can be constructed easily by employing a tank circuit array. Finally, we present experimental results for a modem having transmission rates of 1.544Mbps and 6.312Mbps for the digital hierarchy and information speed of video signals such as MPEG-1 and MPEG-2. The measured basic performance of the proposed modem shows it delivers superior performance without the need for precise adjustment when a QPSK modulation scheme is employed.

The performance of trellis coded hybrid frequency and phase shift modulation (TC HFPSK) with the expurgated phase code and the asymmetric signal constellation is investigated by using the minimum squared free Euclidean distance d 2free and the bit error rate (BER). It is found that TC hybrid 2FSK/4PSK with the expurgated phase code shows larger d 2free than the corresponding TC hybrid 2FSK/4PSK with the complete phase code for varying the angle φ that determines the asymmetric signal constellation. The maximum value of d 2free of TC hybrid 2FSK/4PSK with the expurgated phase code can be obtained when the signal constellation is symmetric. The performance of BER is analyzed in additive white Gaussian noise (AWGN) and fading channels by using uniform error property and error bound based on transfer function. It is found that the coding gain of TC hybrid 2FSK/4PSK with the expurgated phase code over uncoded hybrid 2FSK/2PSK at BER=10-4 are 2.71dB and 4.74dB in AWGN and fading channels, respectively. The performance improvements of TC hybrid 2FSK/4PSK with the expurgated phase code over TC 8PSK at BER=10-4 are 0.68dB and 4.07dB in AWGN and fading channels, respectively.

In coherent optical space communication systems, the phase noise generated from high power laser diodes and the polarization axis mismatch between transmitter and receiver are the serious problem. In this paper, a novel coherent optical space communication system, called optical polarization azimuth modulation (POLAM)/heterodyne detection system is newly proposed, and its system performance is theoretically investigated. It is clarified that the POLAM system can perfectly remove the laser phase noise, is actually insensitive to the polarization axis mismatch, and can provide the remarkable performance improvement compared to a conventional optical frequency modulation system.

Password checking schemes are human identification methods commonly adopted in many information systems. One of their disadvantages is that an attacker who correctly observed an input password can impersonate the corresponding user freely. To overcome it there have been proposed interactive human identification schemes. Namely, a human prover who has a secret key is asked a question by a machine verifier, who then checks if an answer from the prover matches the question with respect to the key. This letter examines such a scheme that requires relatively less efforts to human provers. By computer experiments this letter evaluates its resistance against a type of attack; after observing several pairs of questions and correct answers how successfully can an attacker answer the next question?

We extend the theorem of Gramlich on modular termination of term rewriting systems, by relaxing the disjointness condition and introducing the composability instead. More precisely, we prove that if R1, R-1 are composable, terminating term rewriting systems such that their union is nonterminating then for some a {1, -1}, Ra OR is nonterminating and R-aRa is Fa-lifting. Here, OR is defined to be the special system {or(x, y) x, or(x, y) y}, Fa is the set of function symbols associated with Ra, and an Fa-lifting system contains a rule which has either a variable or a symbol from Fa at the leftmost position of its right-hand side. The extended theorem is stronger than the original one in that it relaxed the disjointness and constructor-sharing conditions and allowed the two systems to share defined symbols in common under the restriction of composability. The corollaries of the theorem show several sufficient conditions for decomposability of termination, which are useful for proving termination of term rewriting systems defined by combination of several composable modules.

Board-to-board signal transmission in a rack system is affected by various types of noise. Signal transmission capability is evaluated on the basis of physical construction parameters and signal conditions, such as rise time and amplitude. This paper examines noise in a rack system and shows that the maximum single-ended transmission capability is 100Mbps when pin-type connectors are used with a signal/ground pin assignment ratio of 1/1.

This paper proposes a hybrid access control scheme for broadcast-based ATM-LANs. Broadcast-based ATM-LANs are shared media networks with star topology. In this network, packets are broadcast to all subscriber terminals by a CPYF (Cell COPY Function) node located in the ATM network and only relevant packets are extracted and sent to the destined user layer function by packet filtering functions in the terminals. The simplicity of the packet transfer mechanism makes the network very economical. In broadcast-based ATM-LANs, the hybrid access control scheme is effective in improving performance. In this scheme, short packets and long packets are transmitted respectively by means of a back-pressure type and a CSMA/CD type access control scheme. Throughput evaluation was performed by computer simulation and the results show that the proposed scheme achieves a high throughput characteristic.

Complexity of Boolean functions satisfying the propagation criterion (PC), an extended notion of the perfect nonlinearity, is discussed on several computation models. The following topics are investigated: (i) relationships between the unateness and the degree of the PC, (ii) the inversion complexity of perfectly nonlinear Boolean functions, (iii) the formula size of Boolean functions that satisfy the PC of degree 1, (iv) the area-time-square complexity of VLSI circuits computing perfectly nonlinear Boolean functions, (v) the OBDD size perfectly nonlinear Boolean functions.

In this paper, we propose a new framework for global traffic control in ATM networks which aims to maximize resource utilization and to guarantee the reliable congestion control. To do this, we first propose Global Traffic Control (GTC) mechanism which is based on harmonious cooperation of each traffic control function. GTC measures real bandwidth utilization to compensate inaccuracy of the declared mean cell rate and it also monitors cell losses to manage input traffic load when a network approaches congestion state. We also propose new adaptive connection admission control (CAC) algorithms which calculate cell loss performance of related function blocks in a switch node using only a declared peak cell rate and an estimated mean cell rate. We measure only the mean cell rate of the aggregate cell stream in a link to estimate the mean cell rate of each virtual channel connection. We adopt a peak cell rate spacer at the User Network Interface (UNI) to compensate a cell delay variation (CDV). We will also present an approximation technique to estimate a queue length distribution of a general queue. As this technique requires negligible calculation time, it can meet the stringent requirement on the connection set-up time.

This paper studies congestion control schemes for integrated variable bit-rate (VBR) video and data communications, where the quality of service (QOS) of each medium needs to be satisfied. In order to control congestion, we exert here either dynamic resolution control or QOS control. The dynamic resolution control scheme in this paper dynamically changes the temporal or spatial resolution of video according to the network loads. The QOS control scheme here assigns a constant capacity of buffer to each connection and determines the video resolution in order to guarantee the QOS of each medium at the connection establishment. The performance of these schemes is evaluated through simulation in terms of throughput, video frame delay probability distribution, and video frame loss rate. We also examine the effects of priority scheduling and packet discarding on the performance. Numerical results indicate that both dynamic resolution and QOS control attain low delay jitters as well as large video and data throughput. In particular, the QOS control is shown to be more suitable for integrated VBR video and data communications.

This paper proposes a novel updating technique, dynamically updating, for achieving extension or modification of functions in a distributed system. Usual updating technique requires synchronous suspension for multiple processes for avoiding unspecified reception caused by the conflict of different versions of processes. Thus, this technique needs very high overhead and it must restrict the types of distributed systems, to which it can be applied, to RPC (remote procedure call) type or client-server type. Using the proposed dynamically updating technique, updating management can be invoked asynchronously by each process with assurance of correct execution of the system, i.e., the system can cope with the effect of unspecified reception caused by mixture of different version processes. Therefore, low overhead updating can be achieved in partner type distributed systems, that is more general type including communications systems or computer networks. Dynamically updating technique is implemented by using a novel distributed algorithm that consists of group communication, checkpoint setting, and rollback recovery. By using the algorithm proposed in this paper, rollback recovery can be achieved with the lowest overhead, i.e., a set of checkpoint determines the last global state for consistent rollback recovery and a set of processes that need to rollback simultaneously is the smallest one. This paper also proves the correctness of the proposed algorithm.

The Manchester Dataflow Machine (MDFM) works with tasks of size equal to one single instruction. This fine granularity aims at exploring all parallelism at the instruction level. However, this project decision increases the instruction communication cost, which ends up to jam the interconnection network and reduces the system performance. One way to skirt this problem is to adopt variable size tasks instead of working with such small task size. In this paper, in order to study whether or not the usage of such variable size tasks in the MDFM architecture contributes to the improvement of the performance, some simulations by toy programs take place. In the simulation, variable size tasks are realized by packing the sequential instruction stretches into one task. To manage this packing, the Sequential Block (SB) technique is developed. The simulation of those packed and unpacked programs give an outline of advantages and disadvantages of working with variable size tasks, and how the SB technique should be implemented in the system.

In this paper, the ATM Mini-Bar System (AMBS) which is a future information providing service infrastructure is proposed. The purpose of AMBS is to provide a multi-media environment in which a user can (1) select and get quickly any needed information, in low cost, at any time, among very large amount of different media information provided by a variety of providers, (2) be charged only for the information which is selected and used, (3) edit or process informations into users' individually requested style or format before using them. The basic concept and configurations of AMBS are also addressed. This system is basically a center-end oriented one-way information providing system. The information center broadcasts its contents to all user equipments based on a user request forecast, and every user equipment stores the delivered contents in its large storage. A user can select one's needed informations from the storage, and may edit or process them within the user equipment. The charge is only on the read informations from the storage, not on all contents in it. The key points of this system are the following three. (A) Introduction of a broadcast (or multicast) media for economical information delivery (exactly speaking, it is a predelivery which means a delivery before request) to user equipments. (B) Introduction of a 1 to 1 communication network for selective charging and control of each user equipments. (C) Introduction of the user equipment storage for Quick response to user information request in most cases with the broadcast (or multicast) information delivery media described above, Separation of information delivery speed and replay speed to increase system flexibility, Local user information processing or editing. As an example of technical solutions, a memory architecture, which is based on hierarchical architecture, is described. AMBS is expected to give some impacts to information industries because it can integrate many kinds of services into the same platform, but some standerdization items are needed to realize it.

Two types of dynamic termination, latch-type and RC-type, are useful for low-power high-speed chip interconnection where the transmission line is terminated only if the signal is changed. The gate of the termination MOS in the latch-type is driven by a feedback inverter, and that in the RC-type is driven by a differentiating signal through the resistor and capacitor. The power dissipation is 13% for the latch-type, and 11% for the RC-type in a DC termination scheme, and the overshoot is 32% for the latch-type, and 16% for the RC-type in an open scheme, both at a signal amplitude of 2 V. The RC-type is superior for signal swing as low as a 1 V. On the other hand, RC termination requires large capacitance, and thus high power. Diode termination is not effective for a small swing because of the large ON voltage of diodes.

A multiple instruction stream-multiple data stream (MIMD) computer is a parallel computer consisting of a large number of identical processing elements. The essential feature that distinguishes one MIMD computer family from another is the interconnection network. In this paper, we are concerned with a representative type of interconnection networks: the hypercube connected network. A family of regular graphs is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architectures. The symmetry of graphs makes it possible to determine message routing by using a simple distributed algorithm. A candidate having the same property is the hypercube connected network. Arbitrary data permutations are generally accomplished by sorting. For certain classes of permutations, however, this is, for many frequently used permutations in parallel processing such as bit reversal, bit shuffle, bit complement, matrix transpose, butterfly permutations used in FFT algorithms, and segment shuffles, there exist algorithms that are more efficient than the best sorting algorithm. One such class is the bit permute complement (BPC) class of permutations. In this paper, we, first, develop an algorithm to realize an arbitrary BPC permutation in hypercube connected networks. The developed algorithm in hypercube connected networks requires only 1 token memory register in each node. We next evaluate the ability to realize BPC permutations in these networks of an arbitrary size by estimating the number of required routing steps.