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.

We present a superconducting neural network which functions as an RS flip-flop. We employ a coupled-SQUID as a neuron, which is a combination of a single-junction SQUID and a double-junction SQUID. A resistor is used as a fixed synapse. The network consists of two neurons and two synapses. The operation of the network is simulated under the junction current density of 100 kA/cm2. The result shows that the network is operated as an RS flip-flop with clock speed capability up to 50 GHz.

This paper presents a new piecewise-linear dc model of the MOSFET. The proposed model is derived for long channel MOSFETs from the Shichman-Hodges equations, with emphasis on the accurate modeling of the major electrical characteristics, and is extended for short channel MOSFETs. The performance of the model is evaluated by comparing current-voltage characteristics and voltage transfer characteristics with those of the SPICE level-l and Sakurai models. The experimental results, using three or fewer piecewise-linear region boundaries on the axes of VGS, VGD and VSB, demonstrate that the proposed model provides enough accuracy for practical use with digital circuits.

The optical ATM transport networks are the key technology for B-ISDN which integrates wide variety of communication services. In a photonic ATM switch, electronically operated switching control drastically limits the total throughput. With this bottleneck of the control speed of the switch compared to the cell transmission speed, if the unit of switching operation can be made longer, the system throughput will be improved. This paper proposes the optical backbone network configuration to obtain traffic concentrating effect to construct a large switching unit called a multi-cell. In the backbone network applied the concept of virtual path set (VPS), a multi-cell is constructed by cells from all of ATM switches in a regional network connected with each own's cross connect. The multi-cell format in the case of two different network models is investigated in this paper. The average delay and average idle cells per multi-cell in the multi-cell MUX of an optical cross connect are evaluated by computer simulation as the performance of the multi-cell transfer scheme in the backbone network. Simulation results show that the multi-cell transfer scheme can be operated efficiently with traffic load of more than 0.5. This paper also proposes the configuration of multiplexing and demultiplexing module to assemble and disassemble the multi-cell.

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.

Voting is a general way of achieving mutual exclusion and synchronization in distributed systems with replicated data. In centralized voting protocols, a requesting node, which works as a central controller, exchanges messages in order to collect votes from other nodes. This paper proposes decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way. When a decentalized voting protocol is implemented by using one-round message exchange, it requires n(n1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The paper describes the computation in each node in the form of the finite state automaton, and gives communication structures for it. It is shown that kn(n1/k1) messages are enough when messages are exchanged in k rounds.

Over the last decade, the Internet has been extremely successful by distinguishing between overlaying applications and underlying networking technologies. This approach allows rapid and independent improvement in both networking and application technologies. The internetworking layer that divides applications and the network enables the Internet to function as a general and evolving infrastructures for data communications. The current Internet architecture offers only best-effort data delivery. However, recent emerging computer and networking technologies, demand the Internet guaranteed performance. In particular, audio and video applications have more rigid delay requirement than those applications which the current Internet supports. To offer guaranteed services in addition to best-effort services, both a new service model and a new architecture are necessary in the Internet architecture. The paper surveys researches and experiments conducted in the Internet community to accommodate a wide variety of qualities of services.

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.

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.

This paper describes reverse modulation carrier recovery with a tank-limiter for Offset QPSK (OQPSK) burst signals. Acquisition performance is discussed taking into account hardware implementation errors in the carrier recovery circuit. The results indicate hardware implementation errors cause a significant recovered carrier phase error during BTR (Bit Timing Recovery) of OQPSK burst signals. A phase error reduction technique by modifying the BTR code for OQPSK burst signals is proposed to improve the acquisition performance. Computer simulation and hardware experiments confirmed its improvement. The performance of a prototype OQPSK burst demodulator using the proposed carrier recovery scheme is also presented.

This paper discusses two approaches to statistical multiplexing: rate envelope multiplexing, allowing resource sharing with small delays for low peak rate connections, and rate sharing, based on the use of large multiplexer buffers to ensure high link utilization for high speed data traffic. We argue that the weighted fair queueing scheduling algorithm provides an efficient means for combining both kinds of multiplexing in the B-ISDN. A feasible implementation known as Virtual Spacing is outlined. We illustrate the flexibility of the proposed scheme by showing how different service categories could be provided.

With the development in portable electronic equipment, the demand for secondary batteries of high energy density is increasing. Recently, nickel metal hydride secondary batteries (Ni/MH) are expanding the market, and lithium ion secondary batteries have been newly developed and commercialized. This paper describes in detail Ni/MH and lithium ion secondary batteries, and reports on their development state and characteristics.

Low-power technology for front-end GaAs ICs and hybrid IC (HIC) for a mobile communication equipment will be presented. For low-power operation of GaAs front-end ICs, new techniques of the intermediate tuned circuits, the single-ended mixer, dualgate MESFETs, and the asymmetric self-aligned LDD process were investigated. The designed down-converter IC showed conversion gain of 21 dB, noise figure of 3.5 dB, 3rd-order intercept point in output level (IP3out) of 4.0 dBm, image-rejection ratio of 20 dB at 880 MHz, operating at 3.0 V of supply voltage and 5.0 mA of dissipation current. The down-converter IC was also designed for 1.9 GHz to obtain conversion gain of 20 dB, noise figure of 4.0 dB, IP3out of 4.0 dBm, image-rejection ratio of 20 dB at 3.0 V, 5.0 mA. The up-converter IC was designed for 1.9 GHz using the same topology of circuit and showed conversion gain of 15 dB, IP3out of 7.5 dBm, and 1 dB compression level of -8 dBm with -20 dBm of LO input power, operating at 3.0 V, 8.0 mA. Another approach to the low-power operation was carried out by HIC using the GaAs down-converter IC chip. The HIC was designed for 880 MHz to show conversion gain of 27 dB, noise figure of 3.3 dB, IP3out of 3.0 dBm, image-rejection ratio of 12 dB, at 2.7 V, 4.5 mA. The HIC measures only 8.0 mm6.0 mm1.2 mm.

We propose a method for configuring LSI manufacturing lines so that they can not only be used to manufacture low-cost LSIs in bulk quantities but also can be used to manufacture small lots with ultra-short TAT. This is achieved by adding a relatively small amount of single-wafer processing equipment to a existing conventional processing line, and therefore involves minimum investment.

We developed an eye-contact technique using a blazed half-transparent mirror (BHM), which is a micro-HM array arranged on the display surface, to make a compact eye-contact videophone. This paper describes a new BHM structure that eliminates ghosts and improves image quality. In the new BHM, the reflection and transmission areas are separated to exclude ghosts from appearing in the captured image. We evaluated the characteristics of the captured and displayed images. The results show that the contrast ratio of the captured image and the brightness of both captured and displayed images are much better than with the previous BHM.

The performance of a nonblocking switch with two kinds of correlated input calls is analyzed. We define two kinds of calls as the waiting call and the immediate call, and assume that the immediate call has the priority over the waiting call. If the traffic density of one kind of calls is larger than maximum throughput, the ratio of the corresponding kind of calls to the total traffic must be restrained in some range. We derive the maximum ratio of the waiting call by using two approximate methods. The effects of traffic densities and transition probabilities of two kinds of calls on the maximum ratio of the waiting call are also considered. It is shown that, if the traffic density of the immediate call is smaller than that of the waiting call, our approximate methods are useful to derive the maximum ratio of the waiting call to the total traffic.

In this paper, we demonstrate how Yamakawa's chaotic chips and Chua's circuits can be used to implement a secure communication system. Furthermore, their performance for the secure communication is discussed.

It has become more important to reduce the protocol implementation costs as the functions of protocols have become more abundant. The protocol implementation tools which automatically generate a protocol program from a specification described by an FDT (Formal Description Technique) are very promising. Selecting SDL as a target FDT, we have developed an SDL-based protocol implementation tool which consists of a process scheduler and a compiler. Since the efficient SDL process execution is a key to generating the high-speed program, the scheduler is introduced. It provides the mechanism which executes SDL processes concurrently as light-weight-processes. It optimizes so that as few context switches take places as possible. The compiler converts as many kinds of SDL functions whose behaviors can be determined at compile time into programming language statements as possible. These elaborations are so successful that the tool can generate an efficient program. The OSI Transport protocol class 0 program generated by the compiler can process more than 500 packets per second on a 6MIPS workstation.

This paper investigates the problem of scheduling parallel tasks" with consideration of communication cost on an m-processor system, where processors are assumed to be identical and tasks being scheduled are independent such that they can run on more than one processor simultaneously. Once a task is processed in parallel, its finish time will be speeded up, but communication cost will also be incurred and should be taken into account. To find a schedule with minimum finish time for the parallel tasks scheduling problem is NP-hard. Therefore, in this paper, we will propose a heuristic algorithm for this kind of problem and derive its performance bounds for two different cases of applications, respectively.