This paper introduces a generalized cyclic convolution which can be implemented via the conventional cyclic convolution system by the discrete Fourier transform (DFT) with pre-multiplication for the input and post-multiplication for the output. The generalized cyclic convolution is applied for computing a negacyclic convolution. Comparison shows that the proposed implementation is more efficient and simpler in structure than other methods. The modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.

A two-dimensional algorithm, which combines the well-known Synthetic Aperture Radar (SAR) imaging and the recently developed effective inversion method, is presented and applied to a three-dimensional configuration. During the first stage a two-dimensional image of a realistic three-dimensional buried object is obtained. In the second stage the average permittivity of the object is estimated using a two-dimensional effective inversion scheme where the geometrical information retrieved from the SAR image is employed. The algorithm is applicable in real time.

To make clear numerically the scattering characteristics for a body embedded in a random medium, we need to analyze the bistatic cross-section (BCS). The scattering problem can be analyzed as a boundary value problem by using current generator method. The fourth moment of Green's functions in the random medium, which is necessary for the analysis, is obtained approximately by two-scale method. We analyze numerically the BCS of conducting circular cylinders in continuous random media, which are assumed to fluctuate about the dielectric constant of free space. The numerical results agree well with the law of energy conservation. The effects of random media on the BCS are also clarified numerically.

Binary Decision Diagrams (BDDs) are graph representation of Boolean functions. In particular, Ordered BDDs (OBDDs) are useful in many situations, because they provide canonical representation and they are manipulated efficiently. BDD packages which automatically generate OBDDs have been developed, and they are now widely used in logic design area, including formal verification and logic synthesis. Synthesis of pass-transistor circuits is one of successful applications of such BDD packages. Pass-transistor circuits are generated from BDDs by mapping each node to a selector which consists of two or four pass transistors. If circuits are generated from smaller BDDs, generated circuits have smaller number of transistors and hence save chip area and power consumption. In this paper, more generic BDDs which have no restrictions in variable ordering and variable appearance count on its paths are called Generic BDDs (GBDDs), and an algorithm for generating GBDDs is proposed for the purpose of synthesis of pass-transistor circuits. The proposed algorithm consists of two steps. At the first step, parse trees (PTs) for given Boolean formulas are generated, where a PT is a directed tree representation of Boolean formula(s) and it consists of literal nodes and operation nodes. In this step, our algorithm attempts to reduce the number of literal nodes of PTs. At the second step, a GBDD is generated for the PTs using Concatenation Method, where Concatenation Method generates a GBDD by connecting GBDDs vertically. In this step, our algorithm attempts to share isomorphic subgraphs. In experiments on ISCAS'89 and MCNC benchmark circuits, our program successfully generated 32 GBDDs out of 680 single-output functions and 4 GBDDs out of 49 multi-output functions whose sizes are smaller than OBDDs. GBDD size is reduced by 23.1% in the best case compared with OBDD.

An inverse scattering problem in three dimensional two layered media is investigated. The shape and the location of the acoustic scatterer buried in one half-space are determined. With some a priori information, it becomes possible to solve this problem in three dimensions. Using the moment method, the scattered field is obtained for the estimated scatterer. An iterative procedure based on the Newton's method for the nonlinear least square problem is able to solve the inverse scattering problem. Some numerical results are presented.

In this paper we report the results of a study regarding the backscattering from wind-roughened water surfaces. The reference profile data has been deducted by an experiment held at the University of Heidelberg circular wave tank facility. The scattering theory is based on a fractal description of the surface and a combined use of the Kirchhoff approximation and the small perturbation method (SPM). The scattering results are tested versus the ones obtained via the periodic-surface moment method. The study shows the reliability of the novel approach.

This paper deals with the scattering problem of a layer where many spherical lossy particles of high dielectric constant are randomly distributed. A radiative transfer equation is used to calculate the scattering cross section of the layer. Four different multiple scattering methods are applied to determine the coefficients of the equation. The scattering cross sections of the four methods are compared by changing the incident angle and polarization of incident waves and the layer thickness. The comparison shows that the scattering cross section fairly depends on the multiple scattering methods and that we need to use an appropriate multiple scattering method for a scattering problem when using a radiative transfer equation.

Nonlinear characteristics of a DBR (Distributed Bragg Reflector) Cherenkov laser are investigated with the aid of particle simulation, allowing for the nonlinear properties of the electron beam. Numerical results show that the EM power extracted from the cavity is considerably suppressed by the nonlinear effect of the electron beam. Additionally, the extracted EM power is found to be critically dependent on the reflection coefficient of the DBR at the output end. Thus the DBRs at both ends of the cavity should be carefully designed in order to extract the EM power from the cavity efficiently.

A method for determination of the location, shape, and material properties of a 3D object from measurements of the scattered field, when the object is successively illuminated by a number of incident fields is presented. This work extends the method previously developed for reconstructions of 2D permittivity and conductivity from electromagnetic measurements to the more complicated full-vector 3D electromagnetic inversion. Furthermore, a frequency hopping strategy to improve the resolution of the unknown objects when the frequency is raised, is underlined. Results of numerical experiments are presented to illustrate both strengths and weaknesses of the method.

Precise simulation of non-quasi-static (NQS) characteristics is crucial for the analog application of MOS transistors. This paper presents the small signal admittance model of four-terminal NQS MOS transistors by solving the differential equation derived from the primary principle. The model contains the bulk-charge effect, the mobility reduction, and the velocity saturation. The results are compared with those for the conventional quasi-static model, the BSIM3v3 NQS model, and the 2-D device simulation.

Aged people who live alone are in particular need of a daily health check, medication, and of warm communication with family and friends. The authors have been developing a life-support computer system with such functions. Among them, a daily health check function with the capability of measuring blood pressure, detecting diseases from coughing, and so on would in particular be very powerful for primary care. As a first step to achieving quick services for a daily health check with a personal computer, utilization of cough information is considered. Features of cough data are analyzed aiming at developing an automatic cough data detection method. This paper proposes a novel method for extracting cough signals from other types of signals. The differential coefficient of a low-pass filtered waveform is first shown to be an effective parameter for discriminating between vowel and cough signals, and the relationship between cut-off frequency and cough detection rate is clarified. This parameter is then applied to cough signals mixed with vowel signals or white noises to evaluate robustness. The evaluation tests show that the cough feature can be perfectly detected for a 20 dB S/N ratio when the cut-off frequency is set to 24 [Hz]. The experimental results suggest that the proposed cough detection method can be a useful tool as a primary care for aged people with a bronchitis like an asthmatic bronchitis and a bronchopneumonia.

CAM (Content Addressable Memory) units are generally designed so that they can be applied to variety of application programs. However, if a particular application runs on CAM units, some functions in CAM units may be often used and other functions may never be used. We consider that appropriate design for CAM units is required depending on the requirements for a given application program. This paper proposes a CAM processor synthesis system based on behavioral descriptions. The input of the system is an application program written in C including CAM functions, and its output is hardware descriptions of a synthesized processor and a binary code executed on it. Since the system determines functions in CAM units and synthesizes a CAM processor depending on the requirements of an application program, we expect that a synthesized CAM processor can execute the application program with small processor area and delay. Experimental results demonstrate its efficiency and effectiveness.

This paper presents a new method that efficiently generates all of the kernels of a sum-of-products expression. Its main feature is the memorization of the kernel generation process by using a graph structure and implicit cube set representations. We also show its applications for common logic extraction. Our extraction method produces smaller circuits through several extensions than the extraction method based on two-cube divisors known as best ever.

In this paper, we propose a method to minimize multiple-valued decision diagrams (MDDs) for multiple-output functions. We consider the following: (1) a heuristic for encoding the 2-valued inputs; and (2) a heuristic for ordering the multiple-valued input variables based on sampling, where each sample is a group of outputs. We first generate a 4-valued input 2-valued multiple-output function from the given 2-valued input 2-valued functions. Then, we construct an MDD for each sample and find a good variable ordering. Finally, we generate a variable ordering from the orderings of MDDs representing the samples, and minimize the entire MDDs. Experimental results show that the proposed method is much faster, and for many benchmark functions, it produces MDDs with fewer nodes than sifting. Especially, the proposed method generates much smaller MDDs in a short time for benchmark functions when several 2-valued input variables are grouped to form multiple-valued variables.

This paper presents an evolutionary technique to build and maintain fault-recoverable digital circuits. As the synthesis of a circuit by genetic algorithm is progressed according to the circuit behavioral objectives and interactions with the environments, the knowledge regarding the architecture as well as the placement and routing processes is not the major concern of the proposed method. The evolutionary behavior of the circuit also prevents the circuit from stuck-at faults by continuously modifying the neighboring circuit blocks accordingly. This is done without the prior knowledge of where and how the faults occur because of the evolutionary nature. Thus, the overhead circuit blocks for fault diagnosis and redundancy are minimized with this design. The fault-recoverable evolvable hardware circuits are synthesized to build a few combinational logics by evolution and the fault recovery capabilities are shown with the reconfigurable FPGA.

In DS-CDMA (including W-CDMA), a received signal can be resolved into multiple paths to be Rake combined. An important design problem of the Rake receiver is how to accurately search the paths with a sufficiently large signal-to-interference plus background noise power ratio (SIR). This paper investigates the performance of a coherent Rake receiver using pilot symbol-assisted channel estimation with fast transmit power control, and thereby optimizes three key parameters: the total averaging period, Tavg, consisting of a combination of coherent summation and power summation; each period of the summations for measuring the average power delay profile; and path-selection threshold M from the generated power delay profile. We used a path search algorithm, which searches the paths that have M times greater average signal power than the interference plus background noise power measured in the average power delay profile generated using time-multiplexed pilot symbols. It was clarified by both simulation and laboratory experiments that when M = 4, Tavg = 50-100 msec, and the number of slots for coherent accumulation R = 2, the required average transmit Eb/N0 for obtaining the average BER of 10-3 is almost minimized with and without antenna diversity for both ITU-R Vehicular-B and average equal power L-path delay profile model, in which each path suffered independent Rayleigh fading. The paper also shows that based on the field experiments, the path search algorithm with optimized path-selection parameters is robust against actual dynamic changes in the power delay profile shape.

A distributed system is said to be self-stabilizing if it converges to some legitimate state from an arbitrary state in a finite number of steps. The number of steps required for convergence is usually referred to as the stabilization time, and its reduction is one of the main performance issues in the design of self-stabilizing systems. In this paper, we propose an automated method for computing the stabilization time. The method uses Boolean functions to represent the state space in order to assuage the state explosion problem, and computes the stabilization time by manipulating the Boolean functions. To demonstrate the usefulness of the method, we apply it to the analysis of existing self-stabilizing algorithms. The results show that the method can perform stabilization time analysis very fast, even when an underlying state space is very huge.

A new method of sequential control has been developed in order to increase the productivity and flexibility of production systems. This advanced sequential control (ASC) method is proposed for sequential control systems based on the autonomous decentralized system (ADS) architecture. The ADS defines the system software and message formats and makes it easy to expand the number of devices and software modules. The ASC method increases productivity because it minimizes the processing and adjustment times of production lines by adjusting the starting times of production processes automatically. Experimental evaluation results of the ASC method showed that it increases the productivity of production systems. It is also applied to an actual production system and the results are reported.

In computer science, concepts of resource such as data consumption and of time such as execution time are very important. Logical systems which can treat them have been applied in that field. Linear logic has been called a resource conscious logic. The expressive power is enough to describe a dynamic change in process environments. However, linear logic is not enough to treat a dynamic change in environments with the passage of time since it does not include a concept of time directly. A typical example is the relation between linear logic and Petri nets. It is well known that the reachability problem for Petri nets is equivalent to the provability for the corresponding sequent of linear logic. But linear logic cannot naturally represent timed Petri nets which are extensions of ordinary Petri nets with respect to time concept. So we extend linear logic with respect to time concept in order to introduce a resource-conscious and time-dependent logical system, that is, temporal linear logic. This system has some temporal operators "" which means a resource usable only once at the next time, "" which means a resource usable only once at anytime, and a modal storage operator "!" which means a resource usable any times at anytime. We can show that the reachability problem for timed Petri nets is equivalent to the provability for the corresponding sequent of temporal linear logic. In this paper, we also represent the description of synchronous communication model by temporal linear logic. The expressive power of temporal linear logic will be applicable to various fields of computer science.

Generating state spaces is one of important and general methods in the analysis of Petri nets. There are two reasons why state spaces of Petri nets become so large. One is concurrent occurring of transitions, and the other is periodic occurring of firing sequences. This paper focuses on the second problem, and proposes a new algorithm for exploring state spaces of finite capacity Petri nets with large capacities. In the proposed algorithm, the state space is represented in the form of a tree such that a set of markings generated by periodic occurrences of firing sequences is associated with each node, and it is much smaller than the reachability graph.