G. Huet (1980) showed that a left-linear term-rewriting system (TRS) is Church-Rosser (CR) if P Q for every critical pair < P, Q > where P Q is a parallel reduction from P to Q. This paper shows that Huet's result can be generalized under the assumption that a subsystem K of TRS R (i.e., KR) is CR. That is, we show that R is CR if P K Q for every < P, Q > CP(K,R-K) and P R-K *K*K Q for every < P, Q > CP(R-K,R). Here, CP(R1,R2) is the set of critical pairs obtained from some rule of R1 and one of R2.

Due to saturable nature of gain or absorption of Er doped fiber, a dynamic grating is formed by standing wave produced by interference between two laser beams traveling in opposite directions in the fiber. In this letter, we propose a variable optical filter using the dynamic grating in Er doped fiber controlled by synthesis of optical coherence function. Simulations and experimental verifications are also shown.

We describe a new automated method for detecting embedded objects in the ultrasonic non-destructive testing (NDT) system. A-scan waves collected by our developed system are converted into a B-scan image. The sensor system has the noise signals independent from targets to be detected. In the ultrasonic NDT system, the signals are due to disturbing of echoes produced by the transducers and multiple reflections. These signals are called inherent wave. This paper first proposes the estimation method of the inherent wave from the B-scan image. After this method subtracts the inherent wave, the resultant image (suppression image) is considered as the image consisting of only echoes from the embedded objects. Second, analysis of the intensity histogram of the suppression image leads the candidate points of embedded objects. Finally, fuzzy if-then rules can represent information on distribution of the intensity histogram and the homogeneous intensity levels of the objects. Evaluated degrees from the inference results can demonstrate the embedded objects. The method was applied to concrete members with reinforcing bars, resin tubes and steel pipes. The experimental results showed that this method was able to automatically detect the embedded objects with high accuracy and to display the location of embedded objects.

We have designed a 44 Banyan switch using SFQ logic circuits. The switch is composed of three parts; one is an input buffer, the second is a contention solver which checks packet contention in a distribution network, and the third is a packet distribution network which distributes contention-free packets to their destination address. The packet distribution network is composed of Batcher-Banyan switch with the input buffer. The contention solver decides to send a data packet to the distribution network, using only internal routing tags which are added to packets in the switch. As the circuit is composed of two parts, the contention solver and the packet distribution network, the transfer rate is raised because it doesn't need to wait any more while a data packet passes through the distribution network. Simulation results using JSIM show that the switch circuit can operate at a clock frequency of 40 GHz.

In this paper, we analyze the convergence and steady-state behavior of the least mean-square (LMS) adaptive filtering algorithm for a finite-length phase-splitting hybrid-type decision feedback equalizer (H-DFE). With some approximations, we derive an iterative expression for the excess mean-square error (MSE) of the H-DFE, which is composed of three statistically dependent excess MSEs; that is, the excess MSEs of the feedforward filter (FFF), intersymbol interference predictive feedback filter (ISI-FBF), and noise predictive feedback filter (NP-FBF) taps. Computer simulation and analytical results show that the average eigenvalue of the input signal for the NP-FBF taps of the H-DFE is time-varying, whereas those for the FFF and ISI-FBF taps are fixed. Nevertheless, the H-DFE can be implemented with fixed step sizes that ensure the convergence of the LMS algorithm without performance degradation from the standpoint of convergence speed, as well as steady-state performance for digital subscriber line (xDSL) applications.

We clarify the effectiveness of receiver-side compensation in offsetting fiber Bragg grating (FBG) dispersion induced-electrical signal-to-noise ratio (SNR) degradation in a 10 Gb/s 8-channel wavelength-division multiplexing (WDM) 6,400 km transmission system. The receiver-side compensation greatly improves the SNR degradation. The allowable accumulated FBG dispersion is -400 1000ps/nm for the worst arrangement, a single FBG at the transmitter, which is about half the accumulated fiber dispersion permissible with receiver-side compensation.

In ATM networks, call processing on switches can be greatly simplified by using the concept of virtual path (VP); and good resource management strategies ensure that virtual channel connections (VCC) can be rapidly and efficiently established. In order to have good system performance, several methods of constructing virtual paths and strategies of allocating and managing resources should be considered. In this paper, several multicast strategies with dynamic routing are used and applied to the metropolitan LATA network. For the VP-based network, dynamic routing is also applied, and those strategies are discussed and investigated to show the versatility of the approach. Some results using dynamic multicast routing, such as call blocking rate, VP utilization, and VP adjustment rate, are obtained for the different strategies by simulation experiments.

The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-constrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E_MCOP, which first constructs an aggregate weight and then uses a K-shortest-path algorithm to find the optimal solution. By means of E_MCOP, the performance of the heuristic algorithm H_MCOP proposed by Korkmaz et al. in a recent work is evaluated. H_MCOP only runs Dijkstra's algorithm (with slight modifications) twice, but it can find feasible paths with a success ratio very close to that of the exact algorithm. However, we notice that in certain cases its feasible solution has an unsatisfactorily high average cost deviation from the corresponding optimal solution. For this reason, we propose some modified algorithms based on H_MCOP that can significantly improve the performance by running Dijkstra's algorithm a few more times. The performance of the exact algorithm and heuristics is investigated through computer simulations on networks of various sizes.

A new approach to build up a real-time multiprocessing system that is configuration flexible for evaluating space-time (ST) equalizers is described. The core of the system consists of fully programmable devices such as digital signal processors (DSPs), field-programmable gate arrays (FPGAs), and reduced instruction set computers (RISCs) with a real-time operating system (RTOS). The RTOS facilitates flexibility in the multi-processor configuration for the system conforming with ST processing algorithms. Timing jitter synchronization caused by use of the RTOS-embedded system is shown, and an adjustable frame format for a transmission system is described as a measure to avoid the jitter problem. Bit error rate (BER) performances measured in uncorrelated frequency-selective fading channels show that an ST equalizer provides a significantly lower BER than an array processor does.

The optimization of path bandwidth allocation in large-scale telecommunication networks is studied. By introducing a decomposition-coordination scheme to global optimization of the path bandwidth allocation which aims at minimizing the worst case call blocking probabilities in the network, the spatial and time complexities are both reduced, while the accuracy is almost the same as that given by direct optimization.

In this paper, an associative memory model with a forgetting process proposed by Mezard et al. is investigated as a means of storing sparsely encoded patterns by the SCSNA proposed by Shiino and Fukai. Similar to the case of storing non-sparse (non-biased) patterns as analyzed by Mezard et al., this sparsely encoded associative memory model is also free from a catastrophic deterioration of the memory caused by memory pattern overloading. We theoretically obtain a relationship between the storage capacity and the forgetting rate, and find that there is an optimal forgetting rate leading to the maximum storage capacity. We call this the optimal storage capacity rate. As the memory pattern firing rate decreases, the optimal storage capacity increases and the optimal forgetting rate decreases. Furthermore, we shown that the capacity rate (i.e. the ratio of the storage capacity for the conventional correlation learning rule to the optimal storage capacity) is almost constant with respect to the memory pattern firing rate.

We apply newly developed rigorous modal transmission-line theory (MTLT) to evaluate optimal design conditions on optical power coupling in grating-assisted directional couplers (GADCs) with two or three guiding channels. By defining a power distribution ratio (PDR) and coupling efficiency (CE) amenable to the rigorous analytical solutions of MTLT, we explicitly analyze the power coupling characteristics of TE modes propagating in GADCs. The numerical results reveal that the incident power is optimally coupled into the desired guiding channel if the powers of rigorous modes excited at the input boundary of grating-assisted coupler are equally partitioned.

This paper describes high power density and low distortion characteristics of a novel InGaP channel field-modulating plate FET (InGaP FP-FET) under high voltage operation of over 50 V. The developed InGaP FP-FET exhibited an extremely high breakdown voltage of 100 V with an impact ionization coefficient about 103 times smaller than that of GaAs. These superior breakdown characteristics indicate that the InGaP FP-FET is one of the most desirable device structures for high-voltage high-power operation. The InGaP FP-FET delivered an output power density of 1.6 W/mm at 1.95 GHz operated at a drain bias voltage of 55 V. As power operation moves from class A to class AB, both 3rd-order intermodulation distortion (IM3) and power-added efficiency (PAE) at higher output-power region were improved, resulting from a suppressed gate leakage current near the power saturation point. These results promise that the developed InGaP FP-FET is suited for applications in which both high efficiency and low distortion are required.

2-Factor covering designs, a type of combinatorial designs, have recently received attention since they have industrial applications including software testing. For these applications, even a small reduction on the size of a design is significant, because it directly leads to the reduction of testing cost. In this letter, we report ten new designs that we constructed, which improve on the previously best known results.

In this paper, a VLSI architecture for lifting-based discrete wavelet transform (LDWT) is presented. Our architecture folds the computations of all resolution levels into the same low-pass and high-pass units to achieve higher hardware utilization. Due to the regular and flexible structure of the design, its area is independent of the length of the 1-D input sequence, and its latency is independent of the number of resolution levels. For the computations of analysis process of N-sample 1-D 3-level LDWT, our design takes about N clock cycles and requires 2 multipliers, 4 adders, and 22 registers. It is fabricated with TSMC 0.35-µm cell library and has a die size of 1.21.2 mm2. The power dissipation of the chip is about 0.4 W at the clock rate of 80 MHz.

We investigate dispersion compensation using dispersion-compensating fibers (DCFs) for ultrashort light pulse code division multiple access (CDMA) communication systems in a multi-user environment. We employ fiber link that consists of a standard single-mode fiber (SMF) connected with two different types of DCFs. Fiber dispersion can be effectively decreased by adjusting the length ratios of DCFs to SMF appropriately. Some criteria for dispersion compensation are proposed and their performances are compared. We theoretically derive a bit error rate (BER) of ultrashort light pulse CDMA systems including the effects of the dispersion and multiple access interference (MAI). Moreover, we reveal the mutual relations among BER performance, fiber dispersion, MAI, the number of chips, a bandwidth of a signal, and a transmission distance for the first time. As a result, we show that our compensation strategy improves system performance drastically.

Using eigenstructure approach to form interference canceler is very sensitive to pointing error, especially when the interference number is overestimated. This Letter presents an effective technique to correct the pointing error by the projection matrix of noise subspace. Based on the corrected steering angle, a proper blocking matrix of the eigenstructure interference canceler can be obtained to suppress the leakage of desired signal. Therefore, signal cancellation does not occur, even the interference number is overestimated in constructing the interference subspace.

This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.

The development of efficient quality of service (QoS) routing algorithms in a high-speed network environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently heuristic algorithms based on Lagrange relaxation techniques have been proposed to resolve the contradiction between the time complexity and the quality of solution. In this paper, we investigate the performance of two heuristic algorithms, LR_DCLC and NR_DCLC, for the delay-constrained least-cost (DCLC) routing problem. Algorithm LR_DCLC is based on linear relaxation, while algorithm NR_DCLC, which is proposed in this paper, is based on nonlinear relaxation. A large number of simulations demonstrate that even though both algorithms have very good performance, NR_DCLC can obtain much better solutions than LR_DCLC by running Dijkstra's algorithm on average a few more times, especially in the case when the optimal solutions are hard to find.

In this paper, we propose a new channel allocation scheme, which is designed to efficiently carry out handoffs in wireless networks. Our scheme is based on conventional handoff methods, which include the channel reservation, carrying and sub-rating methods to assign channels for handoffs. First, we reserve a number of channels only for handoffs. Second, if there is no available channel in the next cell during handoff, the mobile station is allowed to carry a movable channel into the next cell. Finally, in order to avoid co-channel interference due to channel mobility, we adopt the sub-rating method for its carried channel. We evaluated our scheme using both Markov analysis and computer simulation. The analytical and simulation results indicate that our scheme may offer better performance than conventional handoff schemes in terms of handoff blocking probability and channel utilization.