It is well known that based on the structure of a transversal filter, the RLS equaliser provides the fastest convergence in stationary environments. This paper addresses an adaptive transversal equaliser which has the potential to provide more faster convergence than the RLS equaliser. A comparison is made with respect to computational complexity required for each update of equaliser coefficients, and computer simulations are demonstrated to show the superiority of the proposed equaliser.

In this paper, we discuss the performance and computational complexity of modulo-type Viterbi decoder (MVD) for high-speed digital transmission applications. It is shown that the MVD, which is a combination of modulo operation and Viterbi decoder at the receiver, has the same performance as a conventional Viterbi decoder (CVD) with extended constellations. We also show by complexity analysis that the MVD in conjunction with the Tomlinson-Harashima (TH) precoder at the transmitter reduces the system complexity significantly as compared to the CVD. The performance of the digital subscriber line (xDSL) system employing the MVD is investigated in the presence of near-end crosstalk (NEXT) and impulsive noise.

In this paper, we investigate the performance of Fast Reservation Protocols (FRP) for burst-level bandwidth allocation in ATM networks. FRP schemes can be classified into delayed transmission (DT) and immediate transmission (IT) methods according to reservation procedure. Moreover, according to the responsibility for negative acknowledgment (NAK) cell generations when burst blocking occurs, FRP schemes can be further classified into blocking node NAK (BNAK) and destination node NAK (DNAK) schemes. We analize the FRP schemes with different reservation and NAK methods for single node and multihop network models, respectively. We then discuss the dependence of performance for each FRP scheme on propagation delay, peak rate, and the number of hops.

A merged analog-digital circuit architecture is proposed for implementing intelligence in SoC systems. Pulse modulation signals are introduced for time-domain massively parallel analog signal processing, and also for interfacing analog and digital worlds naturally within the SoC VLSI chip. Principles and applications of pulse-domain linear arithmetic processing are explored, and the results are expanded to the nonlinear signal processing, including an arbitrary chaos generation and continuous-time dynamical systems with nonlinear oscillation. Silicon implementations of the circuits employing the proposed architecture are fully described.

The paper proposes a transmitter diversity scheme with a desired signal selection for the mobile communication systems in which the severe cochannel interference (CCI) is assumed to occur at the base station. The feature of the proposed scheme is that the criterion of the downlink branch selection is based on the desired signal power estimated by the correlation between the received signal and the unique word at the matched filter. Moreover, the unique word length control method according to the instantaneous SIR is applied to the proposed scheme, taking account of the uplink transmission efficiency. Computer simulation results show that the proposed scheme provides the better performance than the conventional transmitter diversity in the severe CCI environments, and that the unique word length control method applied to the proposed scheme decreases the unique word length without the degradation of the transmission quality, comparing with the fixed unique word length method.

In this paper, a new expression is derived for the bit error rate (BER) performance of Gray-encoded MDPSK for M=2 and 4 in orthogonal frequency division multiplexing (OFDM) systems over time-variant and frequency-selective Rayleigh fading channels. We assume that the guard time is sufficiently larger than the delay spread to solve the intersymbol interference (ISI) problem on the demodulated OFDM signal. In this case, the performance depends on the Doppler spread of fading channel. The closed form expression for the bit error probability of MDPSK/OFDM extended from the result in [5] shows that the BER performance of MDPSK is determined by (N + NG ) fD Ts where N is the number of subchannels, NG the length of the guard interval, fD the maximum Doppler frequency, and Ts the sampling period. The theoretical analysis results are confirmed by computer simulations for DPSK and QDPSK signals.

While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated. The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.

A direct conversion receiver IC including an on-chip balun, an I/Q mixer, a variable gain amplifier and a 90 phase-shifter is fabricated in a Bi-CMOS technology with 15 GHz transition frequency (fT). This paper demonstrates that cascaded connection of an on-chip balun and a double balanced mixer as the I/Q mixer is effective to achieve a low DC offset and a low second-order distortion, on the basis of both careful examination of the mixer behavior and measurement. Input-referred DC offset voltage of less than 300 µV and spurious free dynamic range (SFDR) of over 67 dB are obtained by measurement. The IC consumes 52 mA from 2.7 V power supply voltage. The die size is 3 mm 3 mm.

This paper presents a method of determining a fitness function in a genetic algorithm for routing the shortest route via several designated points. We can search for the optimum route efficiently by using the proposed fitness function and its validity is verified by applying it to the actual map data.

This paper proposes two novel Multi-bit Delta-Sigma Modulator (Δ Σ M) architectures based on a Dual-Quantization architecture. By using multi-bit quantization with single-bit feedback, Both eliminate the need for a multi-bit digital-to-analog converter (DAC) in the feedback loop. The first is a Digital quantization-Error Canceling Multi-bit (DECM)-Δ Σ M architecture that is able to achieve high resolution at a low oversampling ratio (OSR) because, by adjusting the coefficients of both analog and digital circuits, it is able to cancel completely the quantization error injected into the single-bit quantizer. Simulation results show that a signal-to-quantization-noise ratio of 90 dB is obtained with 3rd order 5-bit quantization DECM-Δ Σ M at an OSR of 32. The second architecture, an analog-to-digital mixed (ADM)-Δ Σ M architecture, uses digital integrators in place of the analog integrator circuits used in the Δ Σ M. This architecture reduces both die area and power dissipation. We estimate that a (2+2)-th order ADM-Δ Σ M with two analog-integrators and two digital-integrators will reduce the area of a 4-th order Δ Σ M by 15%.

It is one of the difficulties in enterprise modeling that we must deal with many fragmented pieces of knowledge provided by various domain-experts, which are usually based on mutually different viewpoints of them. This paper presents a formal approach to integrate those pieces into enterprise-wide model units using Rough Set Theory (RST). We focus on business processes in order to recognize and identify the constituents or units of enterprise models, which would compose the model expressing the various aspects of the enterprise. We defined five model unit types of "resource," "organization," "task," "function," and "behavior. " The first three types represent the static aspect of the enterprise, whereas the last two types represent the dynamic aspect of it. Those units are initially elicited from each domain-expert as his/her own individual model units, then they are integrated into enterprise-wide units using RST. Our approach is methodology-free, and any methodologies can include it in their early stage to identify what composes the enterprise.

It is always difficult to monitor stringent cell loss ratio (CLR), e.g. 10-9, in asynchronous transfer mode (ATM) networks, because its measurement period is too long for real-time measurement. In this paper, we propose new performance monitoring mechanisms for stringent CLR. We consider virtual ATM switches whose resources are much smaller than the real system and thus much higher CLRs will be obtained within a relatively short measurement period. By applying some regression methods in the CLRs obtained from the virtual system, we can estimate the actual CLR of the real system quite accurately and our performance monitoring mechanisms will be operated based on the estimation. Through the numerical examples, our mechanisms are not only more accurate than the traditional methods, but also have shorter measurement periods compared with direct measurement.

The authors propose and experimentally demonstrate an all-optical exclusive OR (XOR) logic gate based on self-phase modulation (SPM) of a semiconductor optical amplifier (SOA). The scheme is insensitive to the polarization of the input signal and requires no additional synchronized clock. The output of the XOR gate showed the contrast ratio of more than 17 dB for the input signal at 2.5 GHz.

Loss analysis in bent graded-index optical slab waveguides is given using the modal-matching method. The conformal mapping replaces curved structure by an equivalent straight waveguide with a modified index profile. For this planar waveguide structure, the normal modes are calculated using a multilayer approximation method. The wave incident on the bend is expanded initially into a finite set of normal modes of the equivalent straight structure, and the transverse fields are matched across the junction. The numerical results show the loss formation in the graded-index waveguides and its dependence of the effective index of the corresponding straight waveguide.

In this paper, we examine an optimal reliability assignment/redundant allocation problem formulated as a nonlinear mixed integer programming (nMIP) model which should simultaneously determine continuous and discrete decision variables. This problem is more difficult than the redundant allocation problem represented by a nonlinear integer problem (nIP). Recently, several researchers have obtained acceptable and satisfactory results by using genetic algorithms (GAs) to solve optimal reliability assignment/redundant allocation problems. For large-scale problems, however, the GA has to enumerate a vast number of feasible solutions due to the broad continuous search space. To overcome this difficulty, we propose a hybridized GA combined with a neural-network technique (NN-hGA) which is suitable for approximating optimal continuous solutions. Combining a GA with the NN technique makes it easier for the GA to solve an optimal reliability assignment/redundant allocation problem by bounding the broad continuous search space by the NN technique. In addition, the NN-hGA leads to optimal robustness and steadiness and does not affect the various initial conditions of the problems. Numerical experiments and comparisons with previous results demonstrate the efficiency of our proposed method.

A timer-based scheme is proposed to manage information within terminal and service profiles for both incall registration/deregistration of UPT users and incall registration resets of terminal owners. In the timer-based scheme, information related to incall registration for a UPT user in a terminal profile is deleted due to a timer expiration without accessing the terminal profile. The performance of the timer-based scheme is compared with the previously proposed request-based scheme in terms of; 1) total cost and, 2) the number of terminal profile accesses per unit time for a terminal. Even though provision of the timer-based scheme requires the modification of incoming call delivery procedure, the timer-based scheme can reduce both the total cost and the number of terminal profile accesses compared to the previously proposed request-based scheme.

Using decision trees to fill the missing values in data has been shown experimentally to be useful in some domains. However, this is not the general case. In other domains, using decision trees for imputing missing attribute values does not outperform other methods. Trying to identify the reasons behind the success or failure of the various methods for filling missing values on different domains can be useful for deciding the technique to be used when learning concepts from a new domain with missing values. This paper presents a technique by which to approach to previous goal and presents the results of applying the technique on predicting the success or failure of a method that uses decision trees to fill the missing values in an ordered manner. Results are encouraging because the obtained decision tree is simple and it can even provide hints for further improvement on the use of decision trees to impute missing attribute values.

We consider a dynamically reconfigureable network where dynamically changing traffic is offered. Rearrangement and adjustment of network capacity can be performed to maintain Quality of Service (QoS) requirements for different traffic classes in the dynamic traffic environment. In this work, we consider the case of a single, dynamic traffic class scenario in a loss mode environment. We have developed a numerical, analytical tool which models the dynamically changing network traffic environment using a time-varying, fluid-flow, differential equation; of which we can use to study the impact of adaptive capacity adjustment control schemes. We present several capacity adjustment control schemes including schemes which use blocking and system utilization as means to calculate when and how much adjustment should be made. Through numerical studies, we show that a purely blocking-based capacity adjustment control scheme with a preset adjustment value can be very sensitive to capacity changes and can lead to network instability. We also show that schemes, that uses system utilization as a means to calculate the amount of capacity adjustment needed, is consistently stable for the load scenarios considered. Finally, we introduce a minimum time interval threshold between adjustments, which can avoid network instability, in the cases where the results showed that capacity adjustment had been performed too often.

One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In this paper, we propose an efficient algorithm with O(nr) message complexity where O(nr) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an ntotal_h*n cell_h dependency matrix, where O(ntotal_h) is the total number of MHs in the system and ncell_h is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.

This paper proposes a method of supporting behavioral decision-making with a rule-based system to be used for the design stage of service specifications or service scenarios based on a state transition model. We consider telecommunication services as service scenarios of state transitions. A state transition can be described as a transition rule that is represented as the notation of an IF-THEN rule : "if < condition > then < action >. " Thus, behaviors or service scenarios are assumed to be treated as a set of IF-THEN rules in this paper. In general, an "if < condition > then < action >" rule is called a production rule, and production rules are often used to represent knowledge in expert systems. Thus, rules treated in this paper are a kind of production rule. It is still difficult to decide if behaviors are concurrent, cooperative, or exclusive as a whole system when many service scenarios are combined, even if each rule is clearly described and easy to understand. When several service scenarios are combined, it is necessary for the sub-elements of each state transition to cooperate. The method proposed in this paper consists of the following techniques: (1) decompositions of a state transition to sub-elements, (2) rule descriptions for the decomposed sub-elements and the application of rules, (3) use of conflict and cooperation strategies, and (4) support for behavioral decision-making by showing recommendations for cooperative, exclusive, or concurrent behavior. We provide examples of telecommunication services to show the effectiveness of the proposed method in an easy-to-understand manner. We also show cooperative resolution in the interactions among several services.