This paper proposes a new design method of a nonlinear filtering algorithm in continuous-time stochastic systems. The observed value consists of nonlinearly modulated signal and additive white Gaussian observation noise. The filtering algorithm is designed based on the same idea as the extended Kalman filter is obtained from the recursive least-squares Kalman filter in linear continuous-time stochastic systems. The proposed filter necessitates the information of the autocovariance function of the signal, the variance of the observation noise, the nonlinear observation function and its differentiated one with respect to the signal. The proposed filter is compared in estimation accuracy with the MAP filter both theoretically and numerically.

Quality of service requirements are satisfied conjointly by the service model, which determines how resources are shared and by network engineering, which determines how much capacity is provided. In this paper we consider the impact of the adopted charging scheme on the feasibility of fulfilling QoS requirements. We identify three categories of charging scheme based respectively on flat rate pricing, congestion pricing and transaction pricing.

This paper studies the ambiguity reduction ability of a probabilistic context-free grammar. We theoretically analyze a common behavior of any probabilistic context-free grammar. Moreover, we confirm by experiments that a probabilistic context-free grammar learnt from Japanese corpus has the ambiguity reduction ability as expected by the theoretical analysis.

Media processors have emerged so that a single LSI can realize multiple multimedia functions, such as graphics, video, audio and telecommunication with effectively shared hardware and flexible software. First, the difference between media processors and general-purpose microprocessors with multimedia extensions is clarified. Features for processes and data in the multimedia applications are summarized and are followed by the multimedia enhancements that the recent general-purpose microprocessors use. The architecture for media processors reflects the further optimized utilization of these features and realizes better price-performance ratio than the general-purpose microprocessors. Finally, the future directions of media processors are estimated, based on the performance, the power dissipation and the die size of the present microprocessors with multimedia extensions and the present media processors. The demand to improve the price-performance ratio for the whole system and to reduce the power consumption makes the media processor evolve into a system processor, which integrates not only the media processor but also the function of a general-purpose microprocessor, various interfaces and DRAMs.

A new approach for generating a system model from its input-output data is presented. The model is approximated as a linear combination of simple basis functions. The number of basis functions is kept as small as possible to prevent over-fitting and to make the model efficiently computable. Based on these conditions, genetic programming is employed for the generation and selection of the appropriate basis. Since the obtained model can be expressed in simple mathematical expressions, it is suitable for using the model as a macro or behavior model in system level simulation. Experimental results are shown.

In this letter, a design method of linear-phase paraunitary filter banks is proposed for an odd number of channels. In the proposed method, a non-linear unconstrained optimization process is assumed to be applied to a lattice structure which makes the starting guess of design parameters simple. In order to avoid insignificant local minimum solutions, a recursive initialization procedure is proposed. The significance of our proposed method is verified by some design examples.

This paper describes the design concept and characteristics of a power supply for optical network units in Fiber To The Home (FTTH) systems. Powering architectures of local powering, network powering and power hub powering are compared in terms of cost and maintainability. A local powering architecture is selected for an ONU power supply because it is the most cost-effective overall compared with the others. The local power supply is mainly composed of a rectifier, DC-DC converters, a ringer, and batteries. A battery deterioration test function is important for the local power supply because battery lifetime varies depending on ambient temperature, discharge history, and charging conditions, and it is shorter than other electrical components used in ONU. Supplying power using alternative batteries is also necessary because the capacity of batteries installed in the power supply is limited. These functions and electrical characteristics are checked using an experimental power supply with Ni-Cd batteries.

Physics principles of a new type of microwave input amplifiers are described. Cyclotron wave electrostatic amplifier (CWESA) has a low noise level, broad band, switchable gain, super high self-protection against microwave overloads, rapid recovery and small DC consumption. CWESAs are widely used in Russian pulse Doppler radars and other systems.

In recent years, there has been a rapid growth in applications such as World Wide Web browsing, which are characterized by fairly short sessions that transfer substantial amounts of data. Conventional connection-oriented and datagram services are not ideally engineered to handle this kind of traffic. We present a new ATM service, called Dynaflow service, in which virtual circuits are created on a burst-by-burst basis and we evaluate key aspects of its performance. We compare Dynaflow to the Fast reservation protocol (FRP) and show that Dynaflow can achieve higher overall throughput due to the elimination of reservation delays, and through the use of shared "burst-stores. " We study the queueing performance of the dynaflow switch and quantify the relationship between the loss ratio and the buffer size.

This paper addresses the optimum routing problem of multipoint connection in large-scale networks. A number of algorithms for routing of multipoint connection have been studied so far, most of them, however, assume the availability of complete network information. Herein, we study the problem under the condition that only partial information is available to routing nodes and that routing decision is carried out in a distributed cooperative manner. We consider the network being partitioned into clusters and propose a cluster-based routing approach for multipoint connection. Some basic principles for network clustering are discussed first. Next, the original multipoint routing problem is defined and is divided into two types of subproblems. The global optimum multicast tree then can be obtained asymptotically by solving the subproblems one after another iteratively. We propose an algorithm and evaluate it with computer simulations. By measuring the running time of the algorithm and the optimality of resultant multicast tree, we show analysis on the convergent property with varying network cluster sizes, multicast group sizes and network sizes. The presented approach has two main characteristics, 1) it can yield asymptotical optimum solutions for the routing of multipoint connection, and 2) the routing decisions can be made in the environment where only partial information is available to routing nodes.

We have developed a half-duplex spread spectrum-direct sequence (SS-DS) 2. 4 GHz band transceiver (T/R) unit having a smaller size and lower power consumption. A highly efficient elastic SAW convolver with chirp interdigital transducers (IDTs) has been used in the correlation circuit of receiver unit. The code shift keying (CSK) modulation is used in the T/R unit. The size of T/R unit is 90 50 11 mm and the weight is 75 grams. The power consumption of T/R unit is 1. 4 watts. We found that the bit error rate (BER) was less than 10-6 over the range of 0-150 m outdoors and 0-80 m indoors without a digital error detection and correction method. In this case, the data rate was 102 kbps and the transmit RF power was 2. 5 mW/MHz. The electrical characteristics, anti-interference and anti-multipath fading were also evaluated.

This paper proposes a new methodology for diagnosing transistor leakage faults with information on IDDQ and logic values at primary output lines. A hierarchical approach is proposed to identify the faults that do not exist in the circuit through comparing their IDDQ and logic behaviors predicted by simulation with observed responses. Several techniques for handling intermediate faulty voltages in fault simulation are also proposed. Further, an approach is proposed to generate diagnostic vectors based on IDDQ information. In addition, a method for identifying IDDQ equivalent faults is proposed to reduce the time needed for diagnostic vector generation and to improve diagnostic resolution. Experimental results show that the proposed methodology often confines diagnosed faults to only a few gates.

This paper presents a routing methodology and a routing algorithm used in designing Gb/s LSIs with deep-submicron technology. A routing method for controlling wire width and spacing is adopted for net groups classified according to wire length and maximum-allowable-delay constraints. A high-performance router using this method has been developed and can handle variable wire widths, variable spacing, wire shape control, and low-delay routing. For multi-terminal net routing, a modification of variable-cost maze routing (GVMR) is effective for reducing wire capacitance (net length) and decreasing net delay. The methodology described here has been used to design an ATM-switch LSI using 0. 25-µm CMOS/SIMOX technology. The LSI has a throughput of 40 Gb/s (2. 5 Gbps/pin) and an internal clock frequency of 312 MHz.

Silva et al. has suggested a criterion based on incidence matrix to verify if a given extended free choice net has a live and bounded marking. This paper shows that this criterion is a necessary and sufficient condition that a given net is a state machine allocatable (SMA) net. This result gives a polynomial algorithm to verify SMA net.

In this paper, we propose a new structure of the frequency domain adaptive filter (FDAF). The proposed structure is based on the modified DFT pair which consists of the FIR filters, so that un-delayed output signal can be obtained with stable convergence and without accumulated error which are problems for the conventional FDAFs. The convergence performance of the proposed FDAF is examined through the computer simulations in the adaptive line enhancer (ALE) comparing with the conventional FDAF and the DCT domain adaptive filter. Furthermore, in order to improve the error performance of the FDAF, we propose a composite algorithm which consists of the normalized step size algorithm for fast convergence and the variable step size one for small estimation error. The advantage of the proposed algorithm is also confirmed through simulations in the ALE. Finally, we propose a reduction method of the computational complexity of the proposed FDAF. The proposed method is to utilize a part of the FFT flow-graph, so that the computational complexity is reduced to O(N log N).

Co-channel interference is a major deteriorating factor limiting the capacity of mobile communication systems. To mitigate the effect of the interference, a kind of nonlinear interference canceller named trellis-coded co-channel interference canceller (TCC) has been proposed. In TCC the trellis-coded modulation (TCM) is introduced to both the desired signal and the interference signal in order to enhance the cancelling performance. In this paper, the bit error rate (BER) performance of TCC in static channel is theoretically evaluated for the first time. An equivalent TCM (E-TCM) model is firstly established, and a BER asymptotic estimate (AE) and a BER upper bound (UB) of TCC are then evaluated respectively by analyzing E-TCM. In the evaluation of AE, the BER performance is calculated as a function of phase difference between the desired signal and the interference signal (φ), subsequently the average BER performance over φ can be evaluated. The UB of BER is calculated using a transfer function based on the matrix representation. This paper also demonstrates that AE gives higher accuracy and less calculation complexity than UB. Performance comparisons reveal the consistency of these theoretical results with that of computer simulations.

A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet Nw. This result is based on the decomposition of a given net (N, Mo) with Md and the concepts of "no immature siphon at the reduced initial marking Mwo" and "no immature trap at the reduced end marking Mwd" on Nw which are both extended from "no token-free siphon at the initial marking Mo" and "no token-free trap at the end marking Md" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.

In this work, a new algorithm for tracking the directions-of-arrival (DOA's) of moving targets by introducing a linear approximation is proposed. The targets are assumed to move with constant angular velocities within a short time and emitting continuously narrow-band signals that impinge on an array of sensors. Therefore the trajectories of targets can be approximated by linear functions of time, which consist of the DOA's and the angular velocities, within the short time. In the condition that the number of targets is known and the outputs vector of the sensors including the additive white complex Gaussian noises is observed continuously, a cost function which consists of the squared residual error vectors is defined. The estimation of the DOA's and the angular velocities of targets is performed by minimizing this cost function. By estimating both the DOA's and the angular velocities at the same time, the proposed algorithm is able to improve the tracking performance for rapidly moving targets. In computer simulations, the performance of the proposed algorithm is compared with the ESPRIT method, which is one of the typical subspace methods with super resolution.

The metal/ferroelectric material/metal/oxide insulating material/Si substrates (MFMIS) structure was realized by using Pb(Zr0. 4Ti0. 6)O3 (PZT) thin film. PZT(330 nm thick) thin film was sandwiched between the upper electrode of Ti/Pt-Rh (about 380 nm thick and 123 microns in diameter) and the lower electrode of Pt-Rh/Ti (about 380 nm thick and 378 microns in diameter). The MFM structures mentioned above were prepared on metal oxide semiconductor (MOS structures). Pt-Rh and Ti lower electrodes were directly deposited on a poly-Si MOS electrode with sputtering, and PZT layer was prepared using the sol-gel method. In order to maximize induced charge density in the MOS gate, diameters of the upper and the lower electrodes were adjusted, and the MFM area-to-MOS area ratio was optimized. By using the area ratio of 0. 11 a memory window of 2. 4 V was obtained.

Despite the fact that the necessity of FDT (formal description techniques) had been emphasized, many approaches to verifying feature interactions were insufficient. This paper proposes formal definitions for feature interactions which can occur when telecommunication services specified independently are operated in parallel. Seven types of feature interactions are defined formally.