We propose a novel InGaAsP semiconductor laser which theoretically exhibits a high differential gain. The proposed semiconductor laser contains an asymmetric double quantum well structure as the active region. The differential gain enhancement invokes resonant tunneling of heavy holes in the asymmetric double quantum well structure, which takes place on the way of carrier injection process. The proposed laser is expected to be far more efficient in reducing pulse width and spectral broadening (chirping) than conventional multiquantum well lasers when driven by the gain switching method.

The novel application potential of mode-locked laser diodes (MLLDs) in ultrafast optical signal processing in addition to coherent optical pulse generation is described. As the most fundamental function of MLLDs, we show that the generation of ultrashort (2 ps) coherent optical pulses with low timing jitter (<0. 5 ps) at precisely controlled wavelength and repetition frequency can be achieved by employing a rigid module configuration for an external-cavity MLLD. We then discuss new aspects of MLLDs which are functions of ultrafast all-optical signal processing such as optical clock extraction and optical gating. All-optical clock extraction is based on the timing synchronization of MLLD output to the injected optical data pulse. When the passive mode-locking frequency of an MLLD is very close to the fundamental clock pulse frequency of optical data, the former frequency is pulled into the latter frequency by optical data injection. We show that same-frequency and subharmonic-frequency optical clock pulses can successfully be extracted from optical data pulses at bit rates of up to 80 Gbit/s with very simple configurations and very low excess timing jitter (<0. 1 ps). On the other hand, optical gating is due to absorption saturation and the following picosecond absorption recovery in a saturable absorber (SA) in an MLLD structure incorporating optical gate-pulse amplification. Here, MLLDs are anti-reflection coated and used as traveling wave devices instead of laser oscillators, and small saturation energy (<1 pJ) and ultrafast recovery time (<8 ps) are demonstrated. By combining all these MLLD functions, we successfully demonstrated an experiment with 40- to 10-Gbit/s all-optical demultiplexing processing.

The semiconductor lasers operating with self-sustained pulsation are under developing to be lasers which are less disturbed by the optical feedback from a surface of optical disk. Structures setting saturable absorbing regions utilizing the multi-layer configuration become popularly used for giving stronger pulsation. However, the quantum (intensity) noise in these lasers tends to be enhanced. The ridge stripe structure, of which almost self-sustained pulsation lasers consist, seems to give a leak current flowing along plane of the cladding region. Such leak current also increases the quantum noise. In this paper, theoretical calculations of operating characteristics, such as the self-sustained pulsation, the optical output, the quantum noise as well as the transverse filed profile, are theoretically analyzed by including the above mentioned several phenomena.

Recent advances in solid-state laser technology and ultrafast optics led to the generation of optical pulses as short as 5 femtoseconds with peak powers up to the subterawatt level from a compact kHz-repetition-rate all-solid-state laser. This source significantly pushes the frontiers of nonlinear optics. Exciting new possibilities include the investigation and exploitation of reversible nonlinear optical processes in solids at unprecedented intensity levels, the development of a compact laser-driven coherent soft-X ray source at photon energies near 1 keV, and the generation of attosecond xuv pulses. First, a brief review of recent milestones in the evolution of ultrafast laser technology is given, followed by a description of the high-power 5-fs source. The rest of the paper is devoted to applications in previously inaccessible regimes of nonlinear optics. We demonstrate that wide-gap dielectrics resist intensities in excess of 1014 W/cm2 in the sub-10 fs regime and the extension of high-harmonic generation in helium to wavelengths shorter than 2. 4 nm (Eph > 0. 5 keV).

The characteristics of several femtosecond solid-state laser systems are described illustrating the diversity of the operational parameters of these lasers. The systems include Pr:YLF, Cr:LiSAF, Cr:Forsterite and Cr:YAG, with wavelength of operation from the visible to the near infra-red. Particular emphasis is placed upon compact, efficient pumping schemes, all-solid-state diode-pumped femtosecond oscillator configurations and newly configured, highly-efficient, tunable, femtosecond lasers pumped by high power fibre lasers.

In this paper, a design concept that offers ATM-VP connections with different protection levels is presented. The users have the choice to select the protection level they wish, the network transport service they need, and the worst cell loss they can tolerate at call set up time, and pay accordingly. Besides, an advanced adaptive traffic control scheme that simplifies call and cell processing is also presented. Many important functions such as call admission, VC-bandwidth reservation, cell-level congestion control, etc. are efficiently performed at the boundary of the backbone network. In this way is given a suitable answer to the important question: "How can future telecommunication networks based on ATM provide services with customized availability ?" A platform that outlines the potential interaction between restoration methods and congestion avoidance schemes is also obtained.

This paper proposes a secure electronic sealed-bid auction protocol (SEAP) that provides an auction service on the Internet by combining three providers: an auction service provider, a key service provider, and a time service provider. The SEAP uses public key cryptography and the concept of a time-key certificate. The most important property of this protocol is that time-dependent security requirements can be strictly satisfied. The SEAP satisfies the following nine security requirements: (a) no one can deny having made a bid; (b) the protocol should be secure against malicious acts; (c) no bidder can act for another bidder; (d) no one can know who else is bidding until the time comes for the bids to be opened; (e) no one can discover the contents of any of the bids until the time comes for the bids to be opened; (f) the successful bid must have been submitted before the bidding deadline; (g) all bidders can verify that the auction policy has been correctly implemented; (h) the successful bidder can be identified without being required to make himself or herself known; and (i) the bidding contents cannot be altered. The protocol consists of three subprotocols: the Registration Subprotocol, the Bidding Subprotocol, and the Auction Subprotocol. The protocol parameters and algorithm are described in detail.

This paper presents a method to examine the effect of introducing data application services on existing wireless CDMA networks where conventional voice communications service is being provided. Since the total number of channels used in a cell is limited in the interfering cellular environments, some voice-traffic channels should be sacrificed when an additional channel is introduced for data services. We investigate this trade-off by analyzing the interference the forward link channels generate. It is also an objective of this paper to examine the forward link capacity in terms of the numbers of paging and voice-/data-traffic channels so as to determine the impact of introducing data services via paging and traffic channels. Different capacity regions are plotted for various cellular environments.

This paper deals with a probabilistic formulation of the diffraction and scattering of a plane wave from a periodic surface randomly deformed by a binary sequence. The scattered wave is shown to have a stochastic Floquet's form, that is a product of a periodic stationary random function and an exponential phase factor. Such a periodic stationary random function is then represented in terms of a harmonic series representation similar to Fourier series, where `Fourier coefficients' are mutually correlated stationary processes rather than constants. The mutually correlated stationary processes are written by binary orthogonal functionals with unknown binary kernels. When the surface deformations are small compared with wavelength, an approximate solution is obtained for low-order binary kernels, from which the scattering cross section, coherently diffracted power and the optical theorem are numerically calculated and are illustrated in figures.

In this paper, we propose two mechanisms for the priority added automatic call gapping method under the fairness scheme and analyze the effect of those mechanisms. Both mechanisms provide good overload controllability and work well on the priority calls. We also define a measure of priority achievement. Both mechanisms show good performance on the pass probability and priority achievement.

In this paper a new class of single error-correcting fixed block-length (d, k) codes has been proposed. The correctable error types are peak-shift error, insertion or deletion error, symmetric error, etc. The basic technique to construct codes is a systematic construction algorithm of multilevel sequences with a constant Lee weight (TALG algorithm). The coding rate and efficiency are considerably good, and hence the proposed new codes will be very useful for improving the reliability of high density magnetic recording.

In this Letter, we investigate the loss performance of a discrete-time single-server queueing system with periodic vacations, with which we are often confronted in traffic control, such as cell scheduling or priority control schemes, at ATM nodes. Explicit expressions are derived for the cell loss ratio in terms of the distribution of the buffer contents in an infinite capacity queue.

In this paper, we illustrate the analysis of microstrip structures with a large number of unknowns using the sparse-matrix/canonical grid method. This fast Fourier thansform (FFT) based iterative method reduces both CPU time and computer storage memory requirements. We employ the Mixed-Potential Integral Equation (MPIE) formulation in conjunction with the RWG triangular discretization. The required spatial-domain Green's functions are obtained efficiently and accurately using the Complex Image Method (CIM). The impedance matrix is decomposed into a sparse matrix which corresponds to near interactions and its complementary matrix which corresponds to far interactions among the subsectional current elements on the microstrip structures. During the iterative process, the near-interaction portion of the matrix -vector multiplication is computed directly as the conventional MPIE formulation. The far-interaction portion of the matrix-vector multiplication is computed indirectly using fast Fourier transforms (FFTs). This is achieved by a Taylor series expansion of the Green's function about the grid points of a uniformly-spaced canonical grid overlaying the triangular discretization.

We present here the Controlling Value Boolean Matching based on fault analysis. The problem is to match a Boolean function with don't cares on library cells under arbitrary input permutations and/or input-output phase assignments. Most of the library cells can be represented by tree structure circuits. The approach presented here is suitable for these structures and computes the Boolean matching better than the structural matching used in SIS. It can handle library cells with a general topology and reconvergent paths. The benchmark test shows that the Controlling Value Boolean Matching can be as facter as the structural matching used in SIS.

In this paper, we will show some significant results of the routability analysis of bit-serial pipeline datapath designs based on Rent's rule and Donath's observation. Our results show that all of the tested bit-serial benchmarks have Rent exponent of below 0.4, indicating that the average wiring length of the circuit is expected to be independent of the circuit size. This study provides some important implications on the silicon utilization and time-area efficiency of bit-serial pipeline circuits on FPGAs and ASICs.

Service interaction resolution is an important study subject to realize a network supporting various advanced communication services. This paper proposes service interaction resolution by service node connected with the communication network via the user-network interface. By executing various advanced services on the service node, service interactions can be efficiently resolved without adding new functions to the existing network. In other words, the service node enables a unified execution control of all the services including those for the originating side and those for the terminating side. This prevents the signalling system and the signalling procedure from being expanded to resolve service interactions. Moreover, the interactions between the services initiated at the conversation active state can be resolved by the service node equipped with function of receiving plural types of in-band signals. This avoids functional expansion of the switching systems in the network. In this paper, feasibility of the proposed resolution scheme is proved by showing a structure of the service node and a detailed procedure to resolve interactions on that service node. In the proposed service node, the application part is divided into basic call processing part and service processing part, and the basic call processing part is represented by three kinds of basic call processing state models. The proposed method for resolving service interactions can control services execution with high flexibility by using feature interaction table.

A novel cryptographic key assignment scheme for dynamic access control in a user hierarchy is presented. Based on Rabin's public key system and Chinese remainder theorem, each security class SCi is assigned a secret key Ki and some public parameters. In our scheme, a secret key is generated in a bottom-up manner so as to reduce the computation time for key generation and the storage size for public parameters. We also show that our proposed scheme is not only secure but also efficient.

Recently, two new efficient server-aided RSA secret computation protocols were proposed. They are efficient and can guard against some active attacks. In this letter, we propose two multi-round active attacks which can effectively reduce their security level even break them.

Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

In this paper, we propose a scalable service networking architecture as a TINA-like environment for providing flexibly various mobility services. The proposed architecture provides an environment that enables the advent of service providers and rapidly introduces multimedia applications, considering networks scalability. For supporting customized mobility services, this architecture adopts a new service component, which we call Omnipresent Personal Environment Manager (OpeMgr). In order to support mobile users who move between heterogeneous networks, for instance, between the TINA-like environment and the Internet environment, we propose a structure of a gateway. In addition, the proposed architecture uses the fixed and mobile agent approaches for supporting the user's mobility, and we evaluated their performances with comparing those approaches.