A new low-power and high-speed CMOS interface circuit is proposed in which signals are transmitted by means of impulse voltage. This mode of transmission is called impulse transmission. Although a termination resistor is used for impedance matching, the current through the output transistors and the termination resistor flows only in transient states and no current flows in stable states. The output buffer and the termination resistor dissipate power only in transient states, so their power dissipation is reduced to 30% that of conventional low-voltage-swing CMOS interface circuits at 160 MHz. The circuit was fabricated by 0.5 µm CMOS technology and was evaluated at a supply voltage of 3.3 V. Experimental results confirm low power of 4.8 mW at 160 MHz and high-speed 870 Mb/s error free point-to-point transmission.

This paper describes our newly developed intelligent sensor system which comprises two eyes and four ears on a movable head. It can acquire its dynamical visual and auditory image of its surrouding 3-D environment while showing humanlike behavior naturally and autonomously. The most important feature of the sensor system is in an autonomous and optimum sensory architecture of it. This enables the sensor to achieve 1) repid (5 ms) and accurate (2 deg) auditory localization, 2) rapid (0.5 s/65536 pixel) extraction of visual motion in marginal view, 3) rapid (several TV frames' time) eye movement and binocular fixation to a suddenly appeared object, 3) rapid (0.1 s/4096 pixel) extraction of 3-D object profile and image features, which is activated by its own auditory localization and motion detection. We describe in this paper the several key items for realizing this sensor.

In this paper we describa a system for Off-line Recognition of Arabic characters and Numerals. This is based on expressing the machine printed Arabic alpha-numerical text in terms of strokes obtained by MCR (Minimum Covering Run) expression. The strokes are rendered meaningful by a labeling process. They are used to detect the baseline and to provide necessary features for recognition. The features selected proved to be effective to the extent that with simple right to left analysis we could achieve interesting results. The recognition is achieved by matching to reference prototypes designed for the 28 Arabic characters and 10 numerals. The recognition rate is 97%.

This paper describes a statistical integration algorithm for color, motion and stereo disparity, and introduces a real-time stereo system that can tell us where and what objects are moving. Regarding the integration algorithm, motion estimation and depth estimation are simultaneously performed by a clustering process based on motion, stereo disparity, color, and pixel position. As a result of the clustering, an image is decomposed into region fragments. Eath fragment is characterized by distribution parameters of spatiotemporal intensity gradients, stereo difference, color and pixel positions. Motion vectors and stereo disparities for each fragment are obtained from those distribution parameters. The real-time stereo system can view the objects with the distribution parameters over frames. The implementation and experiments show that we can utilize the proposed algorithm in real-time applications such as surveillance and human-computer interaction.

This paper proposes an efficient clustering algorithm for region merging. To speed up the search of the best pair of regions which is merged into one region, dissimilarity values of all possible pairs of regions are stored in a heap. Then the best pair can be found as the element of the root node of the binary tree corresponding to the heap. Since only adjacent pairs of regions are possible to be merged in image segmentation, this constraints of neighboring relations are represented by sorted linked lists. Then we can reduce the computation for updating the dissimilarity values and neighboring relations which are influenced by the merging of the best pair. The proposed algorithm is applied to the segmentations of a monochrome image and range images.

In this paper, we present a vision system for a depalletizing robot which recognizes carton objects. The algorithm consists of the extraction of object candidates and a labeling process to determine whether or not they actually exist. We consider this labeling a combinatorial optimization of labels, we propose a new labeling method applying Genetic Algorithm (GA). GA is an effective optimization method, but it has been inapplicable to real industrial systems because of its processing time and difficulty of finding the global optimum solution. We have solved these problems by using the following guidelines for designing GA: (1) encoding high-level information to chromosomes, such as the existence of object candidates; (2) proposing effective coding method and genetic operations based on the building block hypothesis; and (3) preparing a support procedure in the vision system for compensating for the mis-recognition caused by the pseudo optimum solution in labeling. Here, the hypothesis says that a better solution can be generated by combining parts of good solutions. In our problem, it is expected that a global desirable image interpretation can be obtained by combining subimages interpreted consistently. Through real image experiments, we have proven that the reliability of the vision system we have proposed is more than 98% and the recognition speed is 5 seconds/image, which is practical enough for the real-time robot task.

Three primary wiring capacitance components for multi-layer interconnect structure in sub-micron LSI were analyzed by using 2D/3D simulators, and an influence of neighboring wiring was investigated as a three-body problem. The investigated neighboring wiring are three kinds, and they are same-layer, upper-layer and under-layer wiring. An analytical model of each capacitance component was proposed for LPE (Layout Parameter Extraction) system, and its accuracy and application limit were discussed. This new model can estimate each capacitance component of complicated interconnect structure within 20% error.

CAMs (Content Addressable Memories) are functional memories which have functions such as word-parallel equivalence search, bilateral 1-bit data shifting between consecutive words, and word-parallel writing. Since CAMs can be integrated because of their regular structure, massively parallel CAM functions can be executed. Taking advantage of CAMs, Ishiura and Yajima have proposed a parallel fault simulation algorithm using a CAM. This algorithm, however, requires a large amount of CAM storage to simulate large-scale circuits. In this paper, we propose a new massively parallel fault simulation algorithm requiring less CAM storage, and compare it with Ishiura and Yajima's algorithm. Experimental results of the algorithm on CHARGE --the CAM-based hardware engine developed in our laboratory--are also reported.

This paper describes a new intelligent computer assisted instruction (ICAI) system for Japanese beginners to learn Korean composition. This system is supported by speech synthesis which is generated by a new method for arbitrary sentences of Japanese and Korean using the natural speech data-base.

This paper proposes and investigates a tap selectable Viterbi equalizer for mobile radio communications. When the multipath channel is modeled by a tapped delay line only, the taps which may seriously affect the data sequence estimation are selected and used to calculate the trellis metric in the Viterbi algorithm. The proposed equalization algorithm can reduce the number of path metric calculations and the number of path selections in the Viterbi algorithm. Moreover, we propose an extended equalizer which has antenna diversity. This equalizer calculates the path metric using the antenna outputs and results of channel estimators. Computer simulation is used to evaluate the BER performance of the proposed equalizer in a multipath radio channel.

In this paper, a pushdown automaton, with an infinite set of states as a partially ordered set (poset), is formulated, and its control problem of whether a given configuration can be transferred to another is discussed. For the controllability to be decidable, we take a condition the poset satisfies, that is, a condition that there are only finite number of states under the partial ordering between two given states. The control problem is decidable in polynomial time on condition the length of each pushed stack string is bounded by a constant in a given pushdown automaton. The motivation of considering the control problem comes up from the stack structure in implementing the SLD resolution deductions, in which the leftmost atom in each goal is selected and unified with some procedure name (that is, some head) of a definite clause, with the effect of the procedure name being replaced by the procedure bodies and unifications. Thus, the control problem is applied to describe the SLD resolution deductions of finite steps, by constructing a pushdown automaton model for a set of definite clauses, in which leftmost selection of atom in each goal forms a stack structure and substitutions affecting goals are interpreted as states. When constructing a pushdown automaton model for an SLD resolution deduction, algebraic properties of the idempotent substitution set, which are used in unifications, are examined and utilized. The quotient set of the idempotent substitution set per renamings is adopted to present the automaton model.

A typed, object-oriented database technology, equipped with appropriate declarative, temporal logic based executable constraints, is presented. The underlying object-oriented database type system is based on advanced features such as subtype, parametric and F-bounded polymorphism. A particularly distinctive feature of the type system is its associated type-safe reflection technology, which provides the flexibility required by database operators without sacrificing type safety. Strongly, and even statically typed, executable class specifications of a variety of standard database abstractions, both application-oriented and system-oriented, are presented in the paper, in order to demonstrate strate the applicability of the paradigm. The temporal logic basis of the constraint language has an execution model, as well as the minimal model semantics, and it allows complex, temporal behavioral patterns to be expressed. It is based on three tomporal operators: always, next time and some time, and rules that determine how these operators may be applied in temporal Horn clauses. Because of the object-oriented nature of the paradigm, the logic basis is also equipped with the equality predicate The proposed technology is intended to provide major advantages not only in managing appropriately complex application environments with temporal constraints, but also in providing more efficient (because of static type checking) and reliable database management systems. It offers the advantages of non-procedural data languages and the richness of a temporal object-oriented paradigm. It also leads to a powerful prototyping tool for structural and behavioral testing of complex, strongly typed object-oriented systems, prior to major procedural implementation efforts.

This paper addresses approaches to enhancement of performance of the CMA (Constant Modulus Algorithm) adaptive array antenna in multipath environments that characterize the mobile radio communications. The cost function of the CMA reveals that it has an AGC (Automatic Gain Control) procedure of holding the array output voltage at a constant value. Therefore, if the output voltage by the initial weights is different from the object value, then the CMA may suffer from slow convergence because suppression of the multipath waves is delayed by the AGC behavior. Our objective is to improve the convergence characteristics by adopting the differential CMA for the adaptive array algorithm. First, the basic performance of the differential CMA is clarified via computer simulation. Next, the differential CMA is incorporated into the eigen-beamspace system in which the eigenvectors of the correlation matrix of array inputs are used in the BFN (Beam Forming Network). This BFN creates the optimum orthogonal multibeams for radio environments and works helpfully as a preprocessor of the differential CMA. The computer simulation results have demonstrated that the differential CMA with the eigen-beamspace system has much better convergence characteristics than the conventional CMA with the element space system. Furthermore, a modified algorithm is introduced which gives the stable array output voltages after convergence, and it is confirmed that the algorithm can carry out more successful adaptation even if the radio environments are changed abruptly.

The ultraclean sputtering process (UC-process) was newly introduced in the fabrication of Co62.5Ni30Cr7.5 and Co85.5Cr10.5Ta4 thin film media to establish a new concept in controlling microstructure. UC-process enables the realization of high coercive force Hc up to 2.7-3 kOe in both CoNiCr and CoCrTa media (15/50 nm magnetic/Cr thicknesses) without the decrement of saturation magnetization. The purification of the atmosphere during sputtering and the removal of the adsorbed oxygen impurity on the substrate surface play important roles in obtaining high Hc by applying the UC-process. This high Hc is mainly due to the realization of large magnetocrystalline anisotropy field of grains Hkgrain and low intergranular exchange coupling. UC-process realizes the adequate separation of grains by segregated grain boundaries even in media with thin Cr thickness of 2.5 nm, and enables grain size reduction without the remarkable increment in intergranular exchange coupling. In these media, the reduction of the grain size is most effective for the improvement of readback signal to media noise ratio S/Nm. In the media with grains sufficiently separated by segregated grain boundaries fabricated by the UC-process, control of grain size reduction and further increase in Hc/Hkgrain value through the decrement in intergranular magnetostatic coupling are required to obtain higher S/Nm value.

The MUSIC algorithm has proven to be an effective means of estimating parameters of multiple incoherent signals. Furthermore, the forward-backward (FB) spatial smoothing technique has been considered the best preprocessing method to decorrelate coherent signals. In this paper, we propose a novel preprocessing technique based upon ideas associated with the FB and adaptive spatial smoothing techniques and report on its superiority in numerical simulations.

The tandem structure of a matched filter (MF) and a maximum likelihood sequence estimator (MLSE) using the Viterbi algorithm (VA) has been considered to be an optimal receiver for digital pulse-amplitude sequences in the presence of intersymbol interference (ISI) and additive white Gaussian noise (AWGN). An adaptive array antenna has the capability of filtering received signals in the spatial domain as well as in the temporal one. In this paper, we propose a receiver structure using an adaptive array antenna, a digital filter and the VA that is spatially and temporally optimal for multi-user detection in a direct sequence code division multiple access (DS/CDMA) environment. This receiver uses a tapped delay line (TDL) array antenna and the VA, which provides a maximum likelihood sequence estimate from the spatially and temporally whitened matched filter (ST-WMF) output. Performance of the proposed receiver is evaluated by theoretical analysis and computer simulations.

A particulate recording medium with an ultrathin magnetic layer is presented in this paper. This medium consists of a magnetic layer and a nonmagnetic underlayer composed of very fine titanium dioxide powder. When metal powder was employed, we observed the anticipated advantages of decreasing the thickness of the magnetic layer in tapes and diskettes. By reducing the layer thickness to below 0.3 µm we were able to increase the reproduced output at short wavelengths, and improve both the overwrite erasability and the D50. There was also a decrease in the half peak width of an isolated pulse and a peak shift. Tribological advantages were also observed with this medium. When barium ferrite was employed as the magnetic powder, we observed that the modulation noise of thin-layer barium ferrite medium was less than that of a thinlayer MP medium while it generated an output as high as that of the MP medium. The advantages of the barium ferrite medium lie in its two-layer construction. Particulate media will continue to develop as magnetic powder is improved mainly in terms of its size, saturation magnetization, and coercivity.

Simplification of the Viterbi algorithm and the error rate performance are presented for a partial response maximum-likelihood (PRML) system employing the PR(1, 1) system as a PR system for (1, 7) run-length limited (RLL) code. The minimum run-length of 1's or O's in the output sequence of the precoder for (1, 7) RLL code is limited to 2. Two kinds of simplified Viterbi algorithms using this run-length constraint are proposed. One algorithm requires the path memory length of only two in the Viterbi detector. The Viterbi detector based on the other algorithm is equivalent to the simple PR(1, 1) system followed by a threshold detector. The bit-error rates of PRML systems with Viterbi detectors based on these algorithms are obtained by computer simulation and their performance is compared with that of conventional PRML systems for (1, 7) RLL code. It is shown that the proposed PRML system exhibits better performance than conventional PRML systems at high recording density.

Conventional subband ADF's (adaptive digital filters) using filter banks have shown a degradation in performance because of the non-ideal nature of filters. To solve this problem, we propose a new type of subband ADF incorporating two types of analysis filter bank. In this paper, we show that we can design the optimum filter bank which minimizes the LMSE (least mean squared error). In other words, we can design a subband ADF with less MSE than that of conventional subband ADF's.

This paper discusses a coding-based selection approach to a communication aid for the severely motor disabled. Several approaches including row-column scanning are briefly described, then we propose a new selection scheme based on the theory of adaptive coding. They are compared each other with respect to average switch activations in generating some text samples.