The Transduction Method is a powerful way to design logic circuits, utilizing already existing circuits. A set of permissible functions (SPF) plays an essential role in such circuit transformation/reduction, and is computed at each point (connection or gate output). Currently, two types of SPFs have been used: the maximum SPFs (MSPFs) and compatible SPFs (CSPFs). At each point, the MSPF is literally the set of all PF's, and CSPF is a subset of the MSPF. When CSPFs are calculated, priorities are first assigned to all gates in the circuit. Based on the priorities, it is decided which subset is to be selected as the CSPF. The quality of the results depends on the priorities. In this paper, the concept of super-sets of permissible functions (SSPFs) is introduced to reduce the effect of the priorities that CSPFs depend on. In order to loosen the dependency, each SSPF is computed to contain CSPFs which are candidates to be selected. The experimental results show that the SSPF-based Transduction Method has intermediate reduction capability and takes an intermediate computation time between the MSPF-based and CSPF-based ones. The capability and the time are considered as an acceptably good trade-off. In addition, without any transformations, since SSPFs are the maximum super-set, SSPFs are applicable for analyzing the maximum performance of the CSPF-based transformation, for comparison with the MSPF-based one. Theoretically, the number of connectable gate pairs detected by the MSPFs is 100%. According to the experimental results obtained using SSPFs, on average, 99% are detectable by SSPFs and 1% are detectable only by using the MSPFs. The results show that by using CSPFs, 72% of connectable gate pairs are detectable with any priority assignment and 99% (SSPFs capability) are detectable on average even when the best priorities are assigned. According to the experimental results of CSPF calculation with five priorities, 82% to 93% are practically detectable on average. This is the first quantitative analysis realized by SSPFs which compares the CSPF-based and MSPF-based Transduction Methods with respect to the coverage of PF's.

In wide-area wireless access systems such as satellite communications systems and stratospheric platform systems, electric power supplies for radio communications are realized using solar photovoltaic cells and/or fuel cells. However, the on-board weight limits restrict the number of cells that can be equipped. In addition, the transmission power of such systems is limited taking account of issues and regulations on sharing the same frequency band with other systems. Hence, both the frequency band and electric power is limited, which are crucial radio resources for those systems. Although radio channel allocation methods taking account of the frequency constraint only or the power constraint only have been proposed, radio channel allocation methods taking account of both constraints simultaneously have been insufficiently studied. This paper proposes a radio channel allocation method that provides global optimum allocation results by utilizing the linear programming method. The proposed method has features such that the method first allocates radio channels in proportion to the traffic demand distributed over the service coverage area and then maximizes the total radio channels allocated to systems. Numerical results are presented for a stratospheric platform system that covers an area of Japan, as an example, to demonstrate that the proposed method optimally allocates radio channels taking account of both constraints while efficiently allocating excess resources. In addition, whether a system reaches either the frequency or power limit can be estimated, by investigating the radio channel allocation results. Furthermore, enhanced linear programming models based on a method aiming at practical use of the radio channel allocation results in operation are also introduced. The enhanced model is demonstrated to work effectively to avoid unbalanced radio channel allocations over geographical areas. The proposed method and linear programming models are useful not only for making pre-plans but also for determining the amount of necessary frequency and power resources in designing systems.

A new moment computation technique for general lumped R(L)C interconnect circuits with multiple resistor loops is proposed. Using the concept of tearing, a lumped R(L)C network can be partitioned into a spanning tree and several resistor links. The contributions of network moments from each tree and the corresponding links can be determined independently. By combining the conventional moment computation algorithms and the reduced ordered binary decision diagram (ROBDD), the proposed method can compute system moments efficiently. Experimental results have demonstrate that the proposed method can indeed obtain accurate moments and is more efficient than the conventional approach.

The orthogonal function approach is developed in this paper to solve the Takagi-Sugeno (TS) fuzzy-model-based dynamic equations. The new method simplifies the procedure of solving the TS-fuzzy-model-based dynamic equations into the successive solution of a system of recursive formulae only involving matrix algebra. Based on the presented recursive formulae, an algorithm only involving straightforward algebraic computation is also proposed in this paper. The computational complexity can therefore be reduced remarkably. An illustrated example shows that the proposed method based on the orthogonal functions can obtain satisfactory results.

This paper treats the least-squares linear filtering and smoothing problems of discrete-time signals from uncertain observations when the random interruptions in the observation process are modelled by a sequence of independent Bernoulli random variables. Using an innovation approach we obtain the filtering algorithm and a general expression for the smoother which leads to fixed-point, fixed-interval and fixed-lag smoothing recursive algorithms. The proposed algorithms do not require the knowledge of the state-space model generating the signal, but only the covariance information of the signal and the observation noise, as well as the probability that the signal exists in the observed values.

This paper presents circuit techniques using pulse-width and pulse-phase modulation (PWM/PPM) approaches for VLSI implementation of nonlinear dynamical systems. The proposed circuits implement discrete-time continuous-state dynamics by means of analog processing in a time domain, and also approximately implement continuous-time dynamics. Arbitrary nonlinear transformation functions are generated by the process in which a PPM signal samples a voltage or current source whose waveform in the time domain has the same shape as the desired transformation function. Because a shared arbitrary nonlinear voltage or current waveform generator can be constructed by digital circuits and D/A converters, high flexibility and real-time controllability are achieved. By using one of these new techniques, we have designed and fabricated a CMOS chaos circuit with arbitrary 1-D maps using a 0.6 µm CMOS process, and demonstrate from the experimental results that the new chaos circuit successfully generated various chaos with 7.5-7.8 bit precision by using logistic, tent and chaotic-neuron maps.

This letter develops a practical sectorized antenna array using center-fed half-wavelength dipole antennas that are parallel to and a distance in front of a large ground plane reflector. Each element in the array is designed to provide coverage to isolate each 120sector from adjacent sectors. We derive a closed-form expression for spatial correlation function that can be used as guides in evaluating the effects of array spatial correlation on diversity performance in sectorized cellular communications.

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.

Propagation modeling and advanced channel characterization techniques represent integral parts of significant impact in advancing progress in enabling next generation wireless communication technology and realizing its much anticipated broader application and economic benefits. In this paper we describe advances in developing computationally efficient ray-tracing channel modeling procedures, and also describe recent results in characterizing challenging propagation environments including transmission through windows and propagation through walls of complex structures. The impact of these realistic propagation environments as well as the antenna mutual coupling effects on the estimation of channel capacity in a MIMO-based communication system is also evaluated. Significant difference between realistic and statistical channel models are identified and quantified for the special cases of the channels modeled in this study.

In this letter, we show the effects of the chip waveform selection on the detection performance of the energy detector in DS/SS communications. Three chip waveforms such as rectangular, half-sine and raised-cosine are examined as the DS/SS chip waveform. It is demonstrated that the partial-band detection can enhance the detection performance of the energy detector approximately 50-70% compared with the full-band detection. When the chip rate is identical, the raised-cosine waveform shows lower detection probability due to its wider spreading bandwidth. However, when the spreading bandwidth is identical, the rectangular waveform shows lower detection probability due to its lower partial-band energy factor.

We describe elements of a fast integral equation solver for large periodic and partly periodic finite array systems. A key element of the algorithm is utilization (in a rigorous way) of a block-Toeplitz structure of the impedance matrix in conjunction with either conventional Method of Moments (MoM), Fast Multipole Method (FMM), or Fast Fourier Transform (FFT)-based Adaptive Integral Method (AIM) compression techniques. We refer to the resulting algorithms as the (block-)Toeplitz-MoM, (block-)Toeplitz-AIM, or (block-)Toeplitz-FMM algorithms. While the computational complexity of the Toeplitz-AIM and Toeplitz-FMM algorithms is comparable to that of their non-Toeplitz counterparts, they offer a very significant (about two orders of magnitude for problems of the order of five million unknowns) storage reduction. In particular, our comparisons demonstrate, that the Toeplitz-AIM algorithm offers significant advantages in problems of practical interest involving arrays with complex antenna elements. This result follows from the more favorable scaling of the Toeplitz-AIM algorithm for arrays characterized by large number of unknowns in a single array element and applicability of the AIM algorithm to problems requiring strongly sub-wavelength resolution.

This paper proposes a method of improving demodulation performance for chaotic synchronization based multiplex communications systems. In a conventional system, the number of data demodulated correctly is limited because transmitted chaotic signals interfere with each other. The proposed system uses a generalized inverse of a matrix formed from chaotic signals at the transmitter. Since this completely cancels the interference between chaotic signals, demodulation performance is greatly improved. The proposed system has the following features: A simple correlation receiver suitable for small terminals can be used; The magnitude of the correlator output is constant for binary data transmission; Analog information data can also be transmitted. Two methods to reduce the peak-to-average power ratio of the transmitted signal are presented.

This paper presents a novel design procedure for class E oscillator. It is the characteristic of the proposed design procedure that a free-running oscillator is considered as a forced oscillator and the feedback waveform is tuned to the timing of the switching. By using the proposed design procedure, it is possible to design class E oscillator that cannot be designed by the conventional one. By carrying out two circuit experiments, we find that the experimental results agree with the calculated ones quantitatively, and show the validity of the proposed design procedure. One experimental measured power conversion efficiency is 90.7% under 6.8 W output power at an operating frequency 2.02 MHz, the other is 89.7% under 2.8 W output power at an operating frequency 1.97 MHz.

The scattering problem by metallic gratings has become one of fundamental problems in electromagnetics. In this paper, a thin metallic grating placed in conical mounting is treated as a lossy dielectric grating expressed by complex permittivity and thickness. The solution of the metallic grating by using the matrix eigenvalue calculations is compared with that of the plane grating by using the resistive boundary condition and the spectral Galerkin procedure, and the availability of the resistive boundary condition for thin metallic gratings in conical mounting is investigated. In order to improve the convergence of the solutions of thin metallic gratings, the spatial harmonics of flux densities which are continuous function instead of electromagnetic fields are used.

Recently, dielectric lens antennas are paid attentions in ITS applications. Many lens shape designing methods were already developed. And electrical performances were estimated through a ray tracing method. Here, arbitral lens shapes were expressed by a system of power series. In the case of ray tracing, time-consuming three-coordinate root-finder programs were needed to find intersection points of rays on the lens surfaces. In order to calculate complicated structures such as zoned lenses and complicated rays such as multiple reflections between lens surfaces, simple ray tracing methods are requested. In this paper, a simple ray tracing method that utilizes directly designed discrete points of lens surfaces is developed. In this method, a refracted ray is automatically determined for a given incident ray. As for an intersecting point of a lens surface for an outgoing ray, the nearest point to the refracted vector is found out by employing a simple searching procedure. This method is time-saving compared to the previous three-coordinate root-finding program. Through calculated results of focal points and radiation patterns in wide angle beam steering, effectiveness of a developed method is ensured. Application of the developed ray tracing method of complicated multiple reflections are studied. Reflecting points are found out speedily by the same searching procedure. A calculated example of doubly reflected rays is obtained. Through comparing calculated and measured results of wide angle radiation patterns, effectiveness of a developed method is ensured.

In this study, a CG animation tool was designed that allows interpolation and extrapolation of two types of repeated motions including finger actions, for quantitative analyses of the relationship between features of human motions and subjective impressions. Three-dimensional human motions are measured with a magnetic motion capture and a pair of data gloves, and then relatively accurate time-series joint data are generated utilizing statistical characteristics. Based on the data thus obtained, time-series angular data of each joint for two dancing motions is transformed into frequency domain by Fourier transform, and spectral shape of each dancing action is interpolated. The interpolation and extrapolation of two motions can be synthesized with simple manner by changing an weight parameter while keeping good harmony of actions. Using this CG animation tool as a motion synthesizer, repeated human motions such as a dancing action that gives particular impressions on the observers can be quantitatively measured and analyzed by the synthesis of actions.

Let us introduce n ( 2) nonlinear mappings fi (i = 1,2,,n) defined on complete linear metric spaces (Xi-1,ρ) (i = 1,2,,n), respectively, and let fi:Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1, (i = 1,2,,n 0), such that fi() . Moreover, let us introduce n fuzzy-set-valued nonlinear mappings Fi:Xi-1Xi {a family of all non-empty closed compact fuzzy subsets of Xi}. Here, by introducing arbitrary constant βi (0,1], for every integer i (i = 1,2,,n 0), separately, we have a fixed point theorem on the recurrent system of βi -level fuzzy-set-valued mapping equations: xi Fiβi(xi-1, fi(xi-1)), (i = 1,2,,n 0), where the fuzzy set Fi is characterized by a membership function µFi(xi):Xi [0,1], and the βi -level set Fiβi of the fuzzy set Fi is defined as Fiβi {ξi Xi |µFi (ξi) βi}, for any constant βi (0,1]. This theorem can be applied immediately to discussion for characteristics of ring nonlinear network systems disturbed by undesirable uncertain fluctuations and to extremely fine estimation of available behaviors of those disturbed systems. In this paper, its mathematical situation and proof are discussed, in detail.

A new indirect approach for designing low-order linear-phase IIR filters is presented in this paper. Given an FIR filter, we utilize a new Krylov subspace projection method, called the rational Arnoldi method with adaptive orders, to synthesize an approximated IIR filter with small orders. The synthesized IIR filter can truly reflect essential dynamical features of the original FIR filter and indeed satisfies the design specifications. Also, from simulation results, it can be observed that the linear-phase property in the passband is stilled retained. This indirect approach is accomplished using the state-space realization of FIR filters, multi-point Pade approximations, the Arnoldi algorithm, and an intelligent scheme to select expansion points in the frequency domain. Such methods are quite efficient in terms of computational complexity. Fundamental developments of the proposed method will be discussed in details. Numerical results will demonstrate the accuracy and the efficiency of this two-step indirect method.

Computer simulation of cellular process is one of the most important applications in bioinformatics. Since such simulators need huge computational resources, many biologists must use expensive PC/WS clusters. ReCSiP is an FPGA-based, reconfigurable accelerator which aims to realize economical high-performance simulation environment on desktop computers. It can exploit fine-grain parallelism in the target applications by small hardware modules in the FPGA which work in parallel manner. As the first step to implement a simulator of cellular process on ReCSiP, a solver to perform a basic simulation of metabolism was implemented. The throughput of the solver was about 29 times faster than the software on Intel's PentiumIII operating at 1.13 GHz.

A round-ended wide straight slot cut in the broad wall of a rectangular waveguide is analyzed by the Method of Moments (MoM) using numerical eigenmode basis functions derived by the edge-based finite element method (FEM), referred to as MoM/FEM. The frequency characteristics of the calculated transmission coefficients are compared with the measured ones, and good agreement is observed for a wide variety of antenna parameters. For simpler analysis that does not use MoM/FEM, an equivalent rectangular slot approximation for a round-ended slot is discussed. The resonant frequencies of empirically introduced "equal-area" and "equal-perimeter" slots are compared with those of round-ended slots for a wide variety of parameters such as slot width, wall thickness and dielectric constant inside the waveguide. Based upon MoM/FEM, which can be a reliable reference, it is found that the equal-area slot always gives a better approximation of the order of 1% over that of the equal-perimeter one which is of the order of 5%. For higher accuracy, a new rectangular slot approximation of a round-ended slot is proposed to be a linear combination of equal-area and equal perimeter approximation. The error is around 0.25% for a wide variety of parameters such as slot width-to-length ratio, wall thickness and dielectric constant of the filling material inside the waveguide.