A nonlinear Volterra-series analysis of multiple ion-implanted GaAs FETs is given that relates carrier profile parameters of ion-implantation to nonlinear rf characteristics of a FET. Expressions for nonlinear coefficients of transconductance are derived from drain current-voltage characteristics of a multiple ion-implanted FET. Nonlinear transfer functions (NLTFs) are then obtained using Volterra series approach. Using these NLTFs third-order intermodulation distortion and power gain are explicitly given. A good agreement has been found between the calculation and the measurement for a medium power GaAs FET with a total gate width of 800 µm operated at 10-dB back off, verifying the usefulness of the present analysis.

Magnetoplumbite type Ba ferrite (BaM) disks were prepared on Pt and Pt-Ta underlayers using facing targets sputtering apparatus. Pt underlayers are more effective than ZnO underlayers to promote c-axis orientation of BaM layers, especially for extremely thin BaM films. Pt-Ta underlayer was used to decrease the grain size of BaM layers. BaM/Pt-Ta disks revealed larger S/N ratio than BaM/Pt disks because of their larger signal output and lower media noise level. BaM disks with 50 nm thick BaM layers revealed lower noise level and larger S/N ratio than that with 100 nm thick BaM layers due to smaller grain size.

Analysis of electromagnetic wave propagation and scattering in a random medium is a field of great interest. This research field becomes more important if we consider the study of phsyical effects on wave propagation and scattering from targets in random media. Curvature of the targets' cross-sections plays an important parameter in the radar detection problem. In previous study, analysis of scattering data from nonconvex conducting targets has pointed out to the effect of target configuration together with both effects of the spatial coherence length of incident waves around the target and the double passage on the backscattering enhancement. Here, we make sure this fact by considering targets with relatively large sizes in continuous random media for H-wave incidence. We assume the cross-section of targets to be smoothly deformed contour comprising concave and convex portions.

In this paper we consider a tensor-based approach to the analytical computation of higher-order expectations of quantized trajectories generated by Piecewise Affine Markov (PWAM) maps. We formally derive closed-form expressions for expectations of trajectories generated by three families of maps, referred to as (n,t)-tailed shifts, (n,t)-broken identities and (n,t,π)-mixing permutations. These families produce expectations with asymptotic exponential decay whose detailed profile is controlled by map design. In the (n,t)-tailed shift case expectations are alternating in sign, in the (n,t)-broken identity case they are constant in sign, and the (n,t,π)-mixing permutation case they follow a dumped periodic trend.

This paper proposes a receding horizon control scheme for a set of uncertain discrete-time linear systems with randomly jumping parameters described by a finite-state Markov process whose jumping transition probabilities are assumed to belong to some convex sets. The control scheme for the underlying systems is based on the minimization of an upper bound on the worst-case infinite horizon cost function at each time instant. It is shown that the mean square stability of the proposed control system is guaranteed under some matrix inequality conditions on the terminal weighting matrices. The proposed controller is obtained using semidefinite programming.

This paper proposes new recursive fixed-point smoother and filter using covariance information in linear continuous-time stochastic systems. To be able to treat the stochastic signal estimation problem, a performance criterion, extended from the criterion in the H filtering problem by introducing the stochastic expectation, is newly introduced in this paper. The criterion is transformed equivalently into a min-max principle in game theory, and an observation equation in the Krein spaces is obtained as a result. For γ2<, the estimation accuracies of the fixed-point smoother and the filter are superior to the recursive least-squares (RLS) Wiener estimators previously designed in the transient estimation state. Here, γ represents a parameter in the proposed criterion. This paper also presents the fixed-point smoother and the filter using the state-space parameters from the devised estimators using the covariance information.

This paper presents a multimedia architecture extension design for a 200-MHz, 1.6-GOPS embedded RISC processor. The datapath architecture of the processor which realizes parallel execution of data transfer and SIMD (single instruction stream multiple data stream) parallel arithmetic operations is designed. Four SIMD parallel 16-bit MAC (multiply-accumulation) instructions are introduced with a symmetric rounding scheme which maximizes the accuracy of the 16-bit accumulation. This parallel 16-bit MAC on a 64-bit datapath is shown to be efficiently utilized for DSP applications such as the correlation and the matrix-vector multiplications in the multimedia RISC processor. By using the parallel MAC instruction with the symmetric rounding scheme, a 2D-IDCT which satisfies the IEEE1180 can be implemented in 202 cycles.

This paper presents a novel image coding scheme based on separate coding of region and residue sources. In a subband image coding scheme, quantization errors in each subimage spread over the reconstructed image and result in a blurring or a boundary artifact. To obtain high compression ratio without considerable degradation, an input image, in our scheme, is separated into region and residue sources which are coded using different coding schemes. The region source is coded by adaptive arithmetic coder. The residue source is coded using multiresolution subimages generated by applying a subband filter. Each block in the subimages is predicted by an affine transformation of blocks in lower resolution subimages. Experimental results show that a high coding efficiency is achieved using the proposed scheme, especially in terms of the subjective visual quality and PSNR at low bit-rate compression.

We study a class of nonlinear dynamical systems to develop efficient algorithms. As an efficient algorithm, interior point method based on Newton's method is well-known for solving convex programming problems which include linear, quadratic, semidefinite and lp-programming problems. On the other hand, the geodesic of information geometry is represented by a continuous Newton's method for minimizing a convex function called divergence. Thus, we discuss a relation between information geometry and convex programming in a related family of continuous Newton's method. In particular, we consider the α-projection problem from a given data onto an information geometric submanifold spanned with power-functions. In general, an information geometric structure can be induced from a standard convex programming problem. In contrast, the correspondence from information geometry to convex programming is slightly complicated. We first present there exists a same structure between the α-projection and semidefinite programming problems. The structure is based on the linearities or autoparallelisms in the function space and the space of matrices, respectively. However, the α-projection problem is not a form of convex programming. Thus, we reformulate it to a lp-programming and the related ones. For the reformulated problems, we derive self-concordant barrier functions according to the values of α. The existence of a polynomial time algorithm is theoretically confirmed for the problem. Furthermore, we present the coincidence with the gradient vectors for the divergence and a modified barrier function. These results connect a part of nonlinear and algorithm theories by the discreteness of variables.

In this paper, we present a numerical method with guaranteed accuracy to solve initial value problems (IVPs) of normal form simultaneous first order ordinary differential equations (ODEs) which have wide domain. Our method is based on the algorithm proposed by Kashiwagi, by which we can obtain inclusions of exact values at several discrete points of the solution curve of ODEs. The method can be regarded as an extension of the Lohner's method. But the algorithm is not efficient for equations which have wide domain, because the error bounds become too wide from a practical point of view. Our purpose is to produce tight bounds even for such equations. We realize it by combining Kashiwagi's algorithm with the mean value form. We also consider the wrapping effects to obtain tighter bounds.

We consider a network consisting of phase locked loops coupled one another through frequency dividers. When the network structure is rotationally symmetric, spatially periodic simple patterns in terms of the phase of the PLLs are formed. The patterns determine the lock-in frequency of the network. The stability of the pattern is determined by the spatially distributed simple coupling weight patterns. Therefore, a signal with which the network synchronizes is indirectly selected by the weight patterns when several signals are simultaneously applied to the network. The selectivity plays an important role in an intelligent network model.

This paper describes the implementation of a proposed image filter into a Discrete-Time Cellular Neural Network (DT-CNN). The three stages that compose the filter are described, showing that the resultant filter is capable of (1) erasing or detecting several concentric shapes simultaneously, (2) thresholding and (3) thinning of gray-scale images. Because the DT-CNN has to fill certain conditions for this filter to be implemented, it becomes a modified version of a DT-CNN. Those conditions are described and also experimental results are clearly shown.

We have experimentally observed chaotic oscillation of outputs in a diode-pumped Nd:YAG microchip laser array with an external Talbot mirror. The oscillation of chaotic output is observed at frequencies of sub MHz corresponding to the relaxation oscillation frequencies when the Talbot mirror is slightly tilted from the perfect alignment position with the internal cavity. Chaotic intermittent bursts also appear at frequencies of sub kHz due to longitudinal mode hopping. Synchronization of chaos is observed at these two different time scales. The generation of chaotic oscillations at sub MHz is confirmed by using numerical simulations. It is found that synchronized chaotic oscillations can be observed in the vicinity of the boundary of the injection locking range.

A self-similar behavior characterizes the traffic in many real-world communication networks. This traffic is traditionally modeled as an ON/OFF discrete-time second-order self-similar random process. The self-similar processes are identified by means of a polynomially decaying trend of the autocovariance function. In this work we concentrate on two criteria to build a chaotic system able to generate self-similar trajectories. The first criterion relates self-similarity with the polynomially decaying trend of the autocovariance function. The second one relates self-similarity with the heavy-tailedness of the distributions of the sojourn times in the ON and/or OFF states. A family of discrete-time chaotic systems is then devised among the countable piecewise affine Pseudo-Markov maps. These maps can be constructed so that the quantization of their trajectories emulates traffic processes with different Hurst parameters and average load. Some simulations are reported showing how, according to the theory, the map design is able to fit those specifications.

This short paper is a written version of one part of the plenary address given at the November 1999 NOLTA symposium held at the Hilton Waikoloa Village in Hawaii. I was invited by Professor Shin'ichi Oishi, a general vice-chairman of the symposium, to give a survey of some of my own research. I was happy to do that--in the context of a description of what Bell Labs.' research environment was like in its math center in the 1960's, and why I feel that today's young researchers are often too constrained in that they are typically not encouraged to try to do really interesting work. Here the emphasis is on only the origins of input-output stability theory.

This paper introduces a switched-voltage delay cell with differential inputs. It can be used as a building block for a range of analogue functions such as voltage-to-frenquency converter, A/D converter, etc. Applications incorporating the delay cell are presented. The performances are verified by simulations on PSpice.

A general tracking control problem for mobile robots is proposed and solved using the backstepping technique. A global result is given for the kinematic steering system to make the tracking error approaching to zero asymptotically. Based on our efforts, the proposed controller can solve both the tracking problem and the regulation problem of mobile robots. In particular, mobile robots can now globally follow any differentiable with bounded velocities path such as a straight line, a circle and the path approaching to the origin using the proposed controller. Moreover, the problem of back-into-garage parking is also solved by our approach. Some interesting simulation results are given to illustrate the effectiveness of the proposed tracking control laws.

In this paper, we explore the possibility of applying associative memories for locating frontal views of human faces in complex scenes. An appealing property of the associative-memory-based face detection system is that learning of the associative memory may be achieved by using a simple Hebbian learning rule. In addition, a simple heuristic rule is used to quickly filter a certain amount of nonface images at the very beginning of the whole detection procedure. By using the rule, we won't waste unnecessary computational resources on those nonface images. A database consisting of 74 images was used to test the performance of our associative-memory-based human face detection system.

The authors have been in charge of the operation of one of the root DNS servers for more than three years. In this paper, the overview of our system to provide high availability is introduced. In the following sections, a traffic analysis system to analyze the characteristics of the DNS queries and the brief summary which may help future DNS system deployment is described.

CRL (Communications Research Laboratory, Independent Administrative Institution Japan) is developing a road to vehicle multiple-service communication system based on RoF (Radio over Fiber) technology in a millimeter-wave frequency region of 36-37 GHz. In the experimental system, vehicle can receive three wireless services such as PHS (Personal Handy-phone System), ETC (Electronic Toll Collection system), SB (Satellite Broadcasting). In this paper, the system concept and experimental system configuration are introduced. Furthermore, SDR (Software Defined Radio) mobile terminal technology is mentioned and a new concept for a next generation mobile communication network system based on RoF is proposed.