A reliable and automatic parameter extraction technique for DFB lasers is developed. The parameter extraction program which is named "LAPAREX" is able to determine many device parameters from a measured sub-threshold spectrum only, including gain- and index-coupling coefficients, and spatial phases of the grating at front and rear facets. Injection current dependence of coupling coefficients in a gain-coupled DFBlaser is observed, for the first time, by making use of it.

Compact intra-cavity spectroscopic measurements may be obtained with any material that has an absorption signature under the gain bandwidth of a fiber laser. Experiments have demonstrated that compared with a regular absorption scheme, an increase in sensitivity is achieved when using the intra-cavity configuration. The practical limit for this enhancement is given by the fiber laser noise. Since intra-cavity spectroscopy is essentially a single beam technique, the application of dual-beam noise reduction techniques is not possible. However, considering that a single-mode fiber can support two modes of polarization, we have used a polarization beam splitter to create two independent cavities (x and y polarization) with the same noise, one cavity of which contains the absorber. For the first time, this permits the convenient use of Balanced Ratiometric Detection in conjunction with an intra-cavity absorption arrangement.

We proposed a new model for non-stationary time series analysis based on an inhomogeneous AR (autoregressive) equation. Time series data is regarded as white noise plus output of an AR system excited by non-stationary input sequence represented in terms of a set of basis. A method of model parameter estimation was presented when the set of basis and the AR order are given. In order to extend the method, we present a method of parameter estimation when the AR order is unknown: we set two new criteria 1) minimize the root mean square error of the output sequence, and 2) minimize scattering of estimated frequencies. Then, we derive a procedure for the estimation of the AR order and the other unknown parameters.

This letter proposes a congestion control scheme for the ABR service of ATM networks which have non-responding connections. The control scheme is robust with respect to both the round trip delay and the loss of control information caused by non-responding connections. Thus, it is shown that the proposed control scheme guarantees the QoS of the network.

Increasing traffic on the Internet and intranets has raised demands for high-speed, large-scale and cost-effective computer networking techniques. ATM connectionless service provides high-speed, highly scalable, and flexible services because connectionless networks are constructed logically over high-speed ATM networks. This paper described the self-sizing operation for high-speed, large-scale connectionless service over an ATM network. Self-sizing is an autonomous adjustment mechanism for virtual path (VP) bandwidths based on traffic conditions observed in real time. We confirmed its feasibility on a test-bed network. The self-sizing operation caused the VP bandwidth to approach the necessary value while satisfying the target cell loss ratio (CLR). We developed an operations system (OpS) that achieves self-sizing in an ATM connectionless network. The OpS suggests necessary bandwidth for VP that may exceed the target CLR. The algorithm utilized in the OpS does not require observation or logical processes, which would be a heavy load on each node. Self-sizing operation will provide easy and cost-effective management because it adjusts VP bandwidth flexibly depending on the current traffic demand.

Combined input output queued (CIOQ) architecture such as crossbar with speedup has recently been proposed to build a large capacity switch for broadband integrated services networks. It was shown that, for a speedup factor of 2, a CIOQ switch can achieve 100% throughput with a simple maximal matching algorithm. Achieving 100% throughput, however, is not sufficient for per-connection quality of service (QoS) guarantee. In [2],[3], it is proved that a CIOQ switch with a speedup factor of 2 can exactly emulate an output queued (OQ) switch if stable matching is adopted. Unfortunately, the complexity of currently known algorithms makes stable matching impractical for high-speed switches. In this paper, we propose a new matching algorithm called the least cushion first/most urgent first (LCF/MUF) algorithm and formally prove that a CIOQ switch with a speedup factor of 2 can exactly emulate an OQ switch which adopts any service discipline for cell transmission. A potential implementation of our proposed matching algorithm for strict priority service discipline is also presented.

The proliferation and development of cellular voice systems over the past several years has exposed the capabilities and the effectiveness of wireless communications and, thus, has paved the way for wide-area wireless data applications as well. The demand for such applications is currently experiencing a significant increase and, therefore, there is a strong call for advanced and efficient mobile data technologies. This article deals with these mobile data technologies and aims to exhibit their potential. It provides a thorough survey of the most important mobile packet data services and technologies, including MOBITEX, CDPD, ARDIS, and the emerging GPRS. For each technology, the article outlines its main technical characteristics, discusses its architectural aspects, and explains the medium access protocol, the services provided, and the mobile routing scheme.

This paper presents a new distributed scheduling architecture for wireless ATM networks. Usually, in WATM scheduling architectures, a fixed order is defined among the different connections through their ATM service category (CBR VBR ABR UBR). We argue that although this static priority is easier to implement, this type of precedence is not necessarily a good choice for the MAC layer. The MAC layer scheduling should define an order such that it uses efficiently the resources while providing quality of service (QoS) guarantees. In this spirit, our architecture delays (without violating their QoS) the real time connections in order to improve the performance of non real time connections.

Future high-speed switches and routers will be expected to support a large number of ports at high line rates carrying traffic with diverse statistical properties. Accordingly, scheduling mechanisms will be required to handle Tbit/sec aggregated capacity while providing quality of service (QoS) guarantees. In this paper a novel high-capacity switching scheme for ATM/WDM networks is presented. The proposed architecture is contention-free, scalable, easy to implement and requires no internal "speedup. " Non-uniform destination distribution and bursty cell arrivals are examined when studying the switching performance. Simulation results show that at an aggregated throughput of 1 Tbit/sec, low latency is achieved, yielding a powerful solution for high-performance packet-switch networks.

It is now known that a seemingly random irregular time series can be deterministic chaos (hereafter, chaos). However, there can be various kind of noise superimposed into signals from real systems. Other factors affecting a signal include sampling intervals and finite length of observation. Perhaps, there may be cases in which a chaotic time series is considered as noise. J. Theiler proposed a method of surrogating data to address these problems. The proposed method is one of a number of approaches for testing a statistical hypothesis. The method can identify the deterministic characteristics of a time series. In this approach, a surrogate data is formed to have stochastic characteristics with the statistic value associated with the original data. When the characteristics of the original data differs from that of a surrogate data, the null hypothesis is no longer valid. In other words, the original data is deterministic. In comparing the characteristics of an original time series data and that of a surrogate data, the maximum Lyapunov exponents, correlation dimensions and prediction accuracy are utilized. These techniques, however, can not calculate the structure in local subspaces on the attractor and the flow of trajectories. In deal with these issues, we propose the trajectory parallel measure (TPM) method to determine whether the null hypothesis should be rejected. In this paper, we apply the TPM method and the method of surrogate data to test a chaotic time series and a random time series. We also examine whether a practical time series has a deterministic property or not. The results demonstrate that the TPM method is useful for judging whether the original and the surrogate data sets are different. For illustration, the TPM method is applied to a practical time series, tap water demand data.

Broadband subscriber loop system and ATM switching system are the key equipment for construction of Broadband networks. In this paper, we describe the architecture of access network and the implementation of ATM switching system with multi-service interface for construction of broadband access network. We also represent the design of MAIN-AN (Multi-service Access Integrated Network--Access Node) system as integrated access network platform which enables to accommodate ATM/SDH-based and ATM/PON-based FTTx (Fiber-To-The-x) access architecture simultaneously. The system has a Cross-point ATM Switch Fabric with 10 Gbits/sec throughput and it has been implemented using 0.5 µm CMOS technology. For performance evaluation of it, we simulate it under burst traffic conditions. In addition, we show the implementation of prototype of ASIC (Application Specific Integrated Circuit), MAIN system and its core PBA (Printed circuit Board Assembly) and so on.

The General Packet Radio Service (GPRS) is a new bearer service for GSM that greatly improves and simplifies wireless access to packet data networks, e.g., to the Internet. It applies a packet radio principle to transfer user data packets in an efficient way between mobile stations and external packet data networks. This tutorial gives an introduction to GPRS. The article discusses the system architecture and its basic functionality. It explains the offered services, the session and mobility management, the routing, the GPRS air interface including channel coding, and the GPRS protocol architecture. Finally, an interworking example between GPRS and IP networks is shown.

The purpose of this paper is to deal with the problem of recovering a signal from its noisy version. One example is to restore old images degraded by noise. The recovery solution is given within the framework of series expansion and we shall show that for the general case the recovery functions have to be elements of an extended pseudo biorthogonal basis (EPBOB) in order to suppress efficiently the corruption noise. After we discuss the different situations of noise, we provide some methods to construct the optimal EPBOB in order to deal with these situations.

A multi-server system with trunk reservation is studied. The system is offered by two types of customers (class-1 and class-2). They arrive in independent batch Poisson streams and have an exponentially distributed service time. Class-1 customers will be lost or rejected if they find all S servers busy on their arrivals. Class-2 customers will use at most S'=S-R servers and enter a queue with N capacity if they find the number of idle servers less than or equal to R on their arrivals. Here, R is the number of reserved servers for class-1 customers. An example of the system is realized in NTT's facsimile communications network F-NET.

A support system for hepatectomy that allows segmentation of the liver interactively and directly on 3D images was developed. Intuitive 3D images of the liver and its vessels and tumors were drawn with an improved volume-rendering method. Regions supplied with blood by each branch were interactively identified. 3D segments were defined directly on the images using a mouse and excisions were estimated from these interactive inputs.

A hierarchical structure of the statistical models involving the parametric, state space, generalized state space, and self-organizing state space models is explained. It is shown that by considering higher level modeling, it is possible to develop models quite freely and then to extract essential information from data which has been difficult to obtain due to the use of restricted models. It is also shown that by rising the level of the model, the model selection procedure which has been realized with human expertise can be performed automatically and thus the automatic processing of huge time series data becomes realistic. In other words, the hierarchical statistical modeling facilitates both automatic processing of massive time series data and a new method for knowledge discovery.

In this study, we propose a branch-point scheme for multicast ABR service in ATM networks. The performance of the proposed scheme is obtained to show that the consolidation noise and delay can be reduced more effectively than those of the existing schemes.

The explicit formula for the coefficients of maximally linear digital differentiators is derived by the use of Taylor series. A modification in the formula is proposed to extend the effective passband of the differentiator with the same number of coefficients.

This paper examines fairness of service in the up-link of CDMA cellular slotted-ALOHA packet communication systems with site diversity reception. Site diversity rescues the packets originating mainly from near the edge of the cells, whereas packets originating near the base stations can not obtain the benefits of diversity reception. This situation causes an unfairness in packet reception that depends on location of the mobile station. Two transmission control schemes for reducing this unfairness are proposed. In the first scheme, mobile stations control the target received power for the open-loop power control based on the reception level of the pilot signals of the surrounding base stations. In the second, mobile stations control transmit permission probability. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that both schemes improve service fairness for all mobile stations and throughput performances. A performance comparison between the two schemes concludes that transmission power control outperforms transmit permission probability control as a simple technique for maintaining fairness of services.

Image coding with vector quantization (VQ) reveals several defects which include edge degradation and high encoding complexity. This paper presents an edge-preserving coding system based on VQ to overcome these defects. A signal processing unit first classifies image blocks into low-activity or high-activity class. A high-activity block is then decomposed into a smoothing factor, a bit-plane and a smoother (lower variance) block. These outputs can be more efficiently encoded by VQ with lower distortion. A set of visual patterns is used to encode the bit-planes by binary vector quantization. We also develop a modified search-order coding to further reduce the redundancy of quantization indexes. Simulation results show that the proposed algorithm achieves much better perceptual quality with higher compression ratio and significant lower computational complexity, as compared to the direct VQ.