A theoretical study on high slope-efficiency phase-shifted DFB laser diodes is presented. We have proposed a new grating structure called asymmetrically-pitch-modulated (APM) grating, and calculated its slope- efficiency and single-mode-yield. In order to take into account the modulated grating period; we have developed an F-matrix which directly includes a chirped grating structure. APM phase-shifted DFB laser diodes consist of a uniform grating in one half section of the cavity and a chirped grating in the other half. This structure causes asymmetrical field distribution inside the cavity and the optical output power from one facet is larger than that from the other facet. According to the simulation results, when the normalized coupling coefficient κ L is 3.0, the front-to-rear output power ratio is 2.6, while the single-mode-yield remains at 100%, and simultaneously the slope-efficiency improvement becomes 65% better than that of ordinary quarter-wave phase-shifted DFB lasers of the same κ L value.

This paper discusses and clarifies effectiveness of data-driven implementation of protocol handling system to access TINA (Telecommunications Information Networking Architecture) network and internet. TINA is a networking architecture that achieves networking services and management ubiquitously for users and networks. Many TINA related ACTS (Advanced Communication Technologies and Services) projects have been organized in Europe. In Japan, The TINA Trial (TTT) to achieve ATM network management and services based on TINA architectures was done by NTT and several manufactures from April 1997 to April 1999. In these studies and trials, much effort is devoted to development of software based on service architecture and network architecture being standardized in TINA-C (TINA Consortium). In order to achieve TINA environment universally in customers and network sides, we have to consider how to deploy TINA environment onto user side and how to use access transmission capacity as efficiently as possible. Recent technology can easily achieve application and environment downloading from the network side to user side by use of e. g. , JAVA. In accessing the network, there are several possible bottlenecks in information exchange in customer side such as PC processing capability, access protocol handling capability, intra-house wiring bandwidth. Authors, in parallel with TINA software architecture study, have been studying versatile requirements for hardware platform of TINA network. In those studies, we have clarified that the stream-oriented data-driven processor authors have been studying and developing have high reliability, high multiprocessing and multimedia information processing capability. Based on these studies, this paper first shows Von Neumann-based protocol handler is ineffective in case of multiprocessing through mathematical and emulation studies. Then, we show our data-driven protocol handling can effectively realize access protocol handling by emulation study. Then, we describe a result of first step of implementation of data-driven TCP/IP protocol handling. This result proves our TCP/IP hub based on data-driven processor is applicable not only for TINA/CORBA network but normal internet access. Finally, we show a possible customer premises network configuration which resolves bottleneck to access TINA network through ATM access.

This paper conducts performance evaluation for a code division multiple access (CDMA) system when channel bands of multiple neighboring CDMA/DSSS are overlapped in frequency domain. It is assumed that all systems adopt direct-sequence spread-spectrum (DSSS) technique and are BPSK modulated by the different carrier frequencies. Automatic power control (APC) is also applied in the interfered system such that the receiver gets the same power from all users. Without loss generality, an additive white Gaussian noise (AWGN) channel is also assumed during analysis. In this paper, the analytic solution of the signal to noise ratio (SNR) is first derived in which both CDMA systems are modulated by different carrier frequencies. This analysis is good for general cases; and the result shows an excellent computational performance. In particular, the result is very close to Pursly's result, when the systems have the same code length with no carrier difference.

The multiple access causes an interference problem in the direct-sequence code-division multiple access systems. An efficient adaptive algorithm should be used to suppress this interference for the improvement of system performance. In this paper, the new blind adaptive method is suggested using the constant modulus algorithm for the purpose of interference suppression. Simulation results show that the converged value of signal to interference ratio for the proposed method is approximately 6 [dB] larger than that of a conventional Blind-MOE receiver in the additive white Gaussian noise channel and channel with inter-symbol interference while the signal to interference ratio improvement is almost 4 [dB] better in the Rayleigh fading channel. The suggested method is also robust to the new user interference resulting the nearly 3 [dB] improvement of the SIR value comparing with the conventional receiver. Based on these results, it is shown that the BER of the proposed receiver is lower than that of any other conventional receiver. Therefore, using the newly suggested method, the considerable performance improvement can be obtained for the DS-CDMA systems.

A new computational method for evaluating the reverse-link interference distribution in a cellular CDMA system is proposed. In particular, a positive feedback effect of the reverse-link closed-loop power control has been taken into account to precisely capture a realistic effect of unequal cell loading on system capacity. It subsequently facilitates computing the frequency reuse efficiency of the cellular CDMA system under unequal cell loading.

The sign-language can be used as a communication means between avatars having no common language. As a trial to overcome the linguistic barrier, we have previously developed a 2D model-based sign-language chatting system between Korean and Japanese on the the Internet. In that system, there have been some problems to be solved for natural animation and real-time transmission. In this paper, we employ a 3D character model for stereoscopic gestures in the sign-language animation. We also utilize CG animation techniques which use the variable number of frames and a cubic spline interpolation in order to generate realistic gestures. For real-time communication, on the other hand, we make use of an intelligent communication method on a client-server architecture. We implement a preliminary communication system with Visual C++ 5.0 and Open Inventor on Windows platforms. Experimental results show a possibility that the system could be used for avatar communications between different languages.

Simultaneous wavelength conversion of multi-WDM channels is expected to be a key technique in near-future networks. In this paper, 4-channel wavelength conversion using four-wave mixing (FWM) in a hybrid wavelength selector is successfully demonstrated. The wavelength selector consists of two four-channel spot-size-converter-integrated semiconductor optical amplifier (SS-SOA) gate arrays on a planar-lightwave-circuit (PLC) platform and two PLC-arrayed-waveguide-gratings (AWGs). As the wavelength selector has an individual SS-SOA for the wavelength conversion of each channel, there is negligible interference between channels. Four WDM channels with an 2.5 Gb/s modulation were converted from 1555 to 1575 nm. Clear eye openings and only a small power penalty of less than 0.5 dB were observed. The receiver sensitivity was -31 dBm at a bit error rate (BER) of 10-9.

Interference suppression is one of the important functions for mobile communications and software radio. First, this paper shows a new type of interference suppression method by P-RCE (Probability-Restricted Coulomb Energy) which is applicable to mobile communications and software radio. P-RCE is one of the neural networks and mainly used in the field of pattern classification. Secondly, this paper presents several characteristics of this method. For example, it is found from our studies that good suppression effects can be performed even when the interference signals exist closely adjacent to the desired signal and/or total number of signals is more than that of the antenna elements. Next, this paper discusses two types of improvement of processing speed for new suppression method. One is the setting up the learning and non-learning intervals, and the other is the restriction of the number of prototype cells. According to the results, fairly good improvement is realized.

In this paper, we propose an idea of the generalization of threshold signature and authenticated encryption for group communications. The concept of the (t, n) threshold signature with (k, l) shared verification is implemented in group-oriented cryptosystems. In the system, any t members can represent a group to sign a message and any k verifiers can represent another group to authenticate the signature. By integrating the cryptographic techniques of data encryption, digital signature and message recovery, a group-oriented authenticated encryption scheme with (k, l) shared verification is also proposed. The message expansion and communication cost can also be reduced in our schemes.

This paper presents a constant-scale-factor radix-2-4-8 CORDIC algorithm for fast vector rotation and sine/cosine computation. The CORDIC algorithm is a well-known hardware algorithm for computing various elementary functions. Due to its sequential nature of computation, however, significant reduction in processing latency is required for real-time signal processing applications. The proposed radix-2-4-8 CORDIC algorithm dynamically changes the radix of computation during operation, and makes possible the reduction in the number of iterations by 37% for 64-bit precision. This paper also describes the hardware implementation of radix-2-4-8 CORDIC unit that can be installed into practical digital signal processors.

A new type of Meteor Burst Communication (MBC) network is developed. Each unit of the network is based on a DSP board running a modem software. All the fundamental blocks and functions of a modem are implemented in software. Unlike hardware modems, this software modem has flexibility of system configuration and operation. The system implements adaptability in terms of modulation type (number of phases in MPSK) using a unique dynamic channel estimation scheme appropriate for MBC channel. An MBC network protocol is implemented within the modem software. Some preliminary experiments were carried out for differential BPSK and differential QPSK modulations over a practical meteor burst link, and the results are presented.

The potential of Software Radio (SR) has been slow to materialize. Born out of the spoils of the Cold War, the SR concept has remained prisoner of its origin, mainly focused on the terminal, and still under considerable military influence. Such narrow perspective does not fit with our long held conviction that SR has far-reaching potential, and much broader application. While some saw it as "simply" freeing us from standards, by allowing the definition of the radio terminal in software (hence Software Defined Radio, SDR), we see it as changing not only the way we think radio systems and networks, but also the way we define and provide the services and adapt the applications that ran on top of them. We discuss here this much broader, all encompassing approach. While the "canonical" SDR approach concentrates on the terminal side, ours covers the whole system, extending through the network into service creation and application development. Instead of settling for defining the radio in software, we envision Re-configuring on demand not only the terminal but also the serving network(s) and the services they provide (hence Re-configurable Radio Systems and Networks). To illustrate aspects of this novel approach, we discuss past and ongoing research in Europe on Re-configurable Radio Systems and Networks, and identify areas requiring further attention.

We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.

A simple phase compensation technique with improved power supply rejection ratio (PSRR) for CMOS opamps is proposed. This technique is based on feeding back a current proportional to a derivative of the voltage difference between an output and an input, and does not require a common-gate circuit or a noise-free bias for the circuit. The proposed technique requires only two additional transistors, which are connected to the differential pair of transistors in a cascade manner, and the compensation capacitor is connected to the source node of the additional transistor. Experimental results show an improvement of more than 20 dB in the PSRR at high frequencies, comparing the technique with a Miller compensation. This technique also improves the unity gain frequency and the phase margin from 0.9 MHz and 17 to 1.8 MHz and 44 for 200 pF load capacitance, respectively.

Software radio base and personal station prototypes are proposed and implemented. The prototypes are composed of RF/IF, A/D and D/A, pre- and post-processors, CPU, and DSP parts. System software is partitioned into CPU program and DSP program to use processor resources effectively. They support various air interfaces, some of which are equivalent to the 384 kbit/s transmission rate PHS (personal handy phone system) and a 96 kbit/s transmission rate system. The base station can also be used as a communication bridge between two systems. In order to ease IF filter requirements, the zero-stuff method is employed. Basic transmission and receiving performances are evaluated in an experiment and their results agree well with those expected.

As the clock skew is one of the major constraints for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization may increase the total wire length; therefore, clock routing is performed within the given skew bound. Clock routing under the specified skew bound can decrease the total wire length. A new efficient algorithm for bounded clock skew routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevents the total wire length from increasing. Not only the total wire length and delay time minimization algorithm using the new merging point relocation method but also the clock skew reduction algorithm using link-edge insertion technique for a pair of nodes whose delay difference is large is proposed. The proposed algorithm constructs a new clock routing topology which is a generalized graph model, while most previous methods use only tree-structured routing topology. A new cost function is designed in order to select two nodes for link-edge addition. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance is small. Furthermore, routing topology construction and wire sizing algorithm is used to reduce the clock delay. The proposed algorithm is implemented in C programming language. The experimental results show that the total wire length can be reduced under the given skew bound.

A broadband and flexible receiver architecture is investigated for the handheld software defined radio (SDR). The proposed SDR architecture is based on the direct conversion and low intermediate frequency (low-IF) principle with digital channel filtering, which provides the receiver with flexibility for the multi-standard application. This architecture also enables analog-to-digital converter activating essentially in baseband or low frequency so that the clock jitter, which serves as an important subject in the well-known IF sampling method, can be reduced. Basic performance of the proposed architecture has been confirmed by the experimental model.

In this paper, we study efficient scheduling algorithms that are suitable for ATM networks. In ATM networks, all packets have a fixed small length of 53 bytes and they are transmitted at very high rate. Thus time complexity of a scheduling algorithm is quite important. Most scheduling algorithms proposed so far have a complexity of O(log N) per packet, where N denotes the number of connections sharing the link. In contrast, weighted round robin (WRR) has the advantage of having O(1) complexity; however, it is known that its delay property gets worse as N increases. To solve this problem, in this paper we propose two new variants of WRR, uniform round robin (URR) and idling uniform round robin (I-URR). Both disciplines provide end-to-end delay and fairness bounds which are independent of N. Complexity of URR, however, slightly increases as N increases, while I-URR has complexity of O(1) per packet. I-URR also works as a traffic shaper, so that it can significantly alleviate congestion on the network. We also introduce a hierarchical WRR discipline (H-WRR) which consists of different WRR servers using I-URR as the root server. H-WRR efficiently accommodates both guaranteed and best-effort connections, while maintaining O(1) complexity per packet. If several connections are reserving the same bandwidth, H-WRR provides them with delay bounds that are close to those of weighted fair queueing.

More than forty thousands computer viruses have appeared so far since the first virus. Six computer viruses on average appear every day. Enormous expansion of the computer network opened a thread of explosive spread of computer viruses. In this paper, we propose a distributed approach against computer virus using the computer network that allows distributed and agent-based approach. Our system is composed of an immunity-based system similar to the biological immune system and recovery system similar to the recovery mechanism by cell division. The immunity-based system recognizes "non-self" (which includes computer viruses) using the "self" information. The immunity-based system uses agents similar to an antibody, a natural killer cell and a helper T-cell. The recover system uses a copy agent which sends an uninfected copy to infected computer on LAN, or receives from uninfected computer on LAN. We implemented a prototype with JAVATM known as a multi-platform language. In experiments, we confirmed that the proposed system works against some of existing computer viruses that can infect programs for MS-DOSTM.

We deal here with diagnosis for failures of series/parallel structure system. The conventionals have assumed that the system failure is caused by a single minimal cut set (MCS). The purposes of this paper are to propose a new diagnosis method to identify all MCSs by utilizing the series/parallel structure and repair information without requiring an excessive number of inspections. Moreover, by applying our method to several types of series/parallel structure system, and to system having some kinds of probability distributions, desirable system for our method are persuaded. We evaluate not just the number of inspections but also the cost of diagnosis, and show the condition under which our method is effective.