A digital filter is one of the fundamental elements in the digital video transmission, and a multiplier acts as the key factor that determines the operation speed and silicon area of the filter. In terms of the digital video transmission, the required performance of a multiplier is to operate at the speed of 20-100 MHz but with the precision of 8-10 bits. In the case of implementing such an FIR filter with more than a certain number of taps, the same number of multipliers are necessary to realize the speed. Moreover, even though the coefficients to the filter are desired to be programmable, it is possible to change coefficients in the vertical fly-back interval of television receivers. This allows the preloadability of coefficients to the filter such that each coefficient can be treated as a constant during the filtering operation. Motivated by these requirements and functionalities, a novel multiplier and FIR filter architecture is described, which is to be synthesized with the use of a high level synthesis tool of COMPASS Design Navigator, partly with the aid of the manual design by means of a 0.8µm CMOS library.

The millimeter wave (MMW) radar has good compromise characteristics of both microwave radar and optical sensors. It has better angular and range resolving abilities than microwave radar, and a longer penetrating range than optical sensors. We used the MMW radar to detect targets located in the sea and among sea ice clutter based on fractals, wavelets, and neural networks. The wavelets were used as feature extractors to decompose the MMW radar images and to extract the feature vectors from approximation signals at different resolution levels. Unsupervised neural classifiers with parallel computational architecture were used to classify sea ice, sea water and targets based on the competitive learning algorithm. The fractal dimensions could provide a quantitative description of the roughness of the radar image. Using these techniques, we can detect targets quickly and clearly discriminate between sea ice, sea water, and targets.

The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.

New interference cancellation technique using time division reference signal is proposed for optical synchronous code-division multiple-access (CDMA) systems with modified prime sequence codes. In the proposed system one user in each group is not allowed to access the network at each time, and this unallowable user's channel is used as a reference signal for other users in the same group at the time. The performance of the proposed system using an avalanche photodiode (APD) is analyzed where the Gaussian approximation of the APD output is employed and the effects of APD noise, thermal noise, and interference for the receiver are included. The proposed cancellation techniqus is shown to be effective to improve the bit error probability performance and to alleviate the error floor when the number of users and the received optical power are not appreciably small.

Recently, various efficient algorithms for solving combinatorial optimization problems using BDD-based set manipulation techniques have been developed. Minato proposed O-suppressed BDDs (ZBDDs) which is suitable for set manipulation, and it is utilized for various search problems. In terms of practical limits of space, however, there are still many search problems which are solved much better by using conventional branch-and-bound techniques than by using BDDs or ZBDDs, while the ability of conventional branch-and-bound approaches is limited by computation time. In this paper, an extension of APPLY operation, named APPRUNE (APply + PRUNE) operation, is proposed, which performs APPLY operation (ZBDD construction) and pruning simultaneously in order to reduce the required space for intermediate ZBDDs. As a prototype, a specific algorithm of APPRUNE operation is shown by assuming that the given condition for pruning is a threshold function, although it is expected that APPRUNE operation will be more effective if more sophisticated condition are considered. To reduce size of ZBDDs in intermediate steps, this paper also pay attention to the number of cared variables. As an application, an exact-minimization algorithm for generalized Reed-Muller expressions (GRMs) is implemented. From experimental results, it is shown that time and memory usage improved 8.8 and 3.4 times, respectively, in the best case using APPRUNE operation. Results on generating GRMs of exact-minimum number of not only product terms but also literals is also shown.

Research and standardization activities on FPLMTS are under way throughout the world. This paper shows recent study results on radio transmission technologies in ARIB (Association of Radio Industries and Businesses), which in the standardization organization in Japan. On-going study shows two TDMA based and four CDMA based radio transmission technologies under study. These technologies need to be further studied in detail. The proposal from ARIB is expected to be summarized around the end of the year 1996.

In this paper we present an efficient method to solve reachability problems for Petri nets based on genetic algorithms and a kind of random search which is called postpone search. Genetic algorithm is one of algorithms developed for solving several problems of optimization. We apply GAs and postpone search to approximately solving reachability problems. This approach can not determine exact solutions, however, from applicability points of view, does not directly face state space explosion problems and can extend class of Petri nets to deal with very large state space in reasonable time. First we describe how to represent reachability problems on each of GAs and postpone search. We suppose the existence of a nonnegative parickh vector which satisfies the necessary reachability condition. Possible firing sequences of transitions induced by the parickh vector is encoded on GAs. We also define fitness function to solve reachability problems. Reachability problems can be interpreted as an optimization ones on GAs. Next we introduce random reachability problems which are capable of handling state space and the number of firing sequences which enable to reach a target marking from an initial marking. State space and the number of firing sequences are considered as factors which effect on the hardness of reachability problems to solve with stochastic methods. Furthermore, by using those random reachability problems and well known dining philosophers problems as benchmark problems, we compare GAs' performance with the performance of postpone search. Finally we present empirical results that GAa is more useful method than postpone search for solving more harder reachability problems from the both points of view; reliability and efficiency.

In this paper, we propose a camera calibration method that estimates both intrinsic parameters (perspective and distortion) and extrinsic parameters (rotational and translational). All camera parameters can be determined from one or more images of planar pattern consists of parallelogramatic grid points. As far as the pattern can be visible, the relative relations between camera and patterns are arbitrary. So, we have only to prepare a pattern, and take one or more images changing the relative relation between camera and the pattern, arbitrarily; neither solid object of ground truth nor precise z-stage are required. Moreover, constraint conditions that are imposed on rotational parameters are explicitly satisfied; no intermediate parameter that connected several actual camera parameters are used. Taking account of the conflicting fact that the amount of distortion is small in the neighborhood of the image center, and that small image has poor clues of 3-D information, we adopt iterative procedure. The best parameters are searched changing the size and number of parallelograms selected from grid points. The procedure of the iteration is as follows: The perspective parameters are estimated from the shape of parallelogram by nonlinear optimizations. The rotational parameters are calculated from the shape of parallelogram. The translational parameters are estimated from the size of parallelogram by least squares method. Then, the distortion parameters are estimated using all grid points by least squares method. The computer simulation demonstrates the efficiency of the proposed method. And the results of the implementation using real images are also shown.

This paper suggests modified LZSS which is suitable for compressing Hangul data by Hangul character token and the string token with small size based on Hangul properties. The Hangul properties can be described in 2 ways. 1) The structure of a Hangul character consists of 3 letters: The first sound letter, the middle sound letter, and the last sound letter which are called Cho-seong, Jung-seong, and Jong-seong, respectively. 2) The code of Hangul is represented by 2 bytes. The first property is used for making the character token processing Hangul characters which occupies most of the unmatched characters. That is, the unmatched Hangul characters are replaced with one Hangul character token represented by Huffman codes of Cho-seong, Jung-seong, and Jong-seong in regular sequence, instead of 2 character tokens. The second property is used to shorten the size of the string token processing matched string. In other words, since more than 75% of Hangul data are Hangul and Hangul codes are constructed in 2 bytes, the addresses of the window of LZSS can be assigned in 2-byte unit. As a result, the distance field and the length field of the string token can be lessened by one bit each. After compressing Hangul data through these tokens, about 3% of improvement could be made in compression ratio.

We propose a method to fuse auditory information and visual information for accurate speech recognition. This method fuses two kinds of information by using Iinear combination after calculating two kinds of probabilities by HMM for each word. In addition, we use full-frame color image as visual information in order to improve the accuracy of the proposed speech recognition system. We have performed experiments comparing the proposed method with the method using either auditory information or visual information, and confirmed the validity of the proposed method.

We report on the formation technique and the first observation of visible light emission from silicon nanoparticles (<10nm) embedded in CaF22 Iayers grown on Si(111) substrates by using codeposition of Si and CaF2. It is shown that the size and density of silicon particles embedded in the CaF2 layer can be controlled by varying the substrate temperature and the evaporation rates of CaF2 and Si. The photoluminescence (PL) spectra of Si nanoparticles embedded in CaF2 thin films were investigated. The blue or green light emissions obtained using a He-Cd laser (λ=325nm) could be seen with the naked eye even at room temperature for the first time. It is shown that the PL intensity strongly depends on growth conditions such as the Si:CaF2 flux ratio and the growth temperature. The PL spectra were also changed by in situ annealing process. These phenomena can be explained qualitatively by the quantum size effect of Si nanoparticles embedded in CaF2 barriers.

A hardware algorithm for modular division is proposed. It is based on the extended Euclidean algorithm (EEA). The procedure for finding the multiplicative inverse in EEA is modified so that it calculates the quotient. Modular division is carried out through iteration of simple operations, such as shifts and additions. A redundant binary representation is employed so that additions are performed without carry propagation. An n-bit modular division is carried out in O(n) clock cycles. The length of each clock cycle is constant independent of n. A modular divider based on the algorithm has a bit-slice structure and is suitable for VLSI implementation.

We investigate bifurcations of the periodic solution observed in a phase converter circuit. The system equations can be considered as a nonlinear coupled system with Duffing's equation and an equation describing a parametric excitation circuit. In this system there are two types of solutions. One is with x = y = 0 which is the same as the solution of Duffing's equation (correspond to uncoupled case), another solution is with xy0. We obtain bifurcation sets of both solutions and discuss how does the coupling change the bifurcation structure. From numerical analysis we obtain a codimension two bifurcation which is intersection of double period-doubling bifurcations. Pericdic solutions generated by these bifurcations become chaotic states through a cascade of codimension three bifurcations which are intersections of D-type of branchings and period-doubling bifurcations.

In this article, a new analogic CNN algorithm to extract features of postage stamps in gray-scale images Is introduced. The Gradient Controlled Diffusion method plays an important role in the approach. In our algorithm, it is used for smoothing and separating Arabic figures drawn with a color which is similar to the background color. We extract Arabic figures in postage stamps by combining Gradient Controlled Diffusion with nearest neighbor linear CNN template and logic operations. Applying the feature extraction algorithm to different test images it has been verified that it is also effective in complex segmentation problems

In order to apply formal design verification, it is necessary to describe formally and correctly the specification of the circuit under verification. Especially when we apply conventional OBDD-based logic comparison method for verifying combinational circuits, another correct" logic circuits or Boolean formulae must be given as the specification. It is desired to develop an efficient automatic design verification method which interprets specification that can be described easier. This paper provides a new verification method which is useful for combinational circuits such as arithmetic circuits. The proposed method efficiently verifies whether a designed circuit satisfies a specification given by recurrence equations. This enables us to describe easily an error-free specification for arithmetic circuits. To perform verification efficiently using an ordinary OBDD package, an efficient truth-value rotation algorithm is developed. The truthvalue rotation algorithm efficiently generates an OBDD representing f(x + 1 (mod 2n)) from a given OBDD representing f(x). By experiments on SPARC station 10 model 51, it takes 180 secs to generate an OBDD for designed circuit of 23-bit square function, and additional 60 secs is sufficient to finish verifying that it satisfies the specification given by recurrence equations.

This paper describes a waveform relaxationbased coupled lossy transmission line circuit simulator DESIRE3T+. First, the generalized method of characteristics (GMC) is reviewed, which replaces a lossy transmission line with an equivalent disjoint network. Next, the generalized line delay window (GLDW) partitioning technique is proposed, which accelerates the transient analysis of the circuits including transmission lines replaced by GMC model. Finally GMC model and GLDW technique are implemented in hte relaxation-based circuit simulator DESIRE3T+ which can analyze bipolar transistor circuits by using the dynamic decomposition technique, and the performance is estimated.

A mathematical model based on an optimization formulation is presented for perceptual clustering of dot patterns. The features in the present model are its nonlinearity enabling the model to reveal hysteresis phenomena and its scale invariance. The clustering of dots is given by the mutual linking of dots by virtual lines. Every dot is assumed to be perceived at locations displaced from their original places. It is exemplified with simulations that the model can produce a hierarchical clustering of dots by variation in thresholds for the wiring of virtual lines and also the model can additionally reproduce some geometrical illusions semiquantitatively. This model is further extended for perceptual grouping in line segment patterns and geometrical illusions obsrved in those patterns are reproduced by the extended model.

Gray scale images are represented by recurrent neural subnetworks which together with a competition layer create an associative memory. The single recurrent subnetwork Ni implements a stochastic nonlinear fractal operator Fi, constructed for the given image fi. We show that under realstic assumptions F has a unique attractor which is located in the vicinity of the original image. Therefore one subnetwork represents one original image. The associative recall is implemented in two stages. Firstly, the competition layer finds the most invariant subnetwork for the given input noisy image g. Next, the selected recurrent subnetwork in few (5-10) global iterations produces high quality approximation of the original image. The degree of invariance for the subnetwork Ni on the inprt g is measured by a norm ||g-Fi(g)||. We have experimentally verified that associative recall for images of natural scenes with pixel values in [0, 255] is successful even when Gaussian noise has the standard deviation σ as large as 500. Moreover, the norm, computed only on 10% of pixels chosen randomly from images still successfuly recalls a close approximation of original image. Comparing to Amari-Hopfield associative memory, our solution has no spurious states, is less sensitive to noise, and its network complexity is significantly lower. However, for each new stored image a new subnetwork must be added.

A method is presented for reconstructing the surface profile of a two dimensional rough surface boundary from the scattered far field data. The proposed inversion algorithm is based on the Kirchhoff approximation and in order to determine the surface profile, the numerical results illustrating the method are presented.

This paper proposes linear predictive transmission diversity for TDMA/TDD personal communication systems and evaluates the effects of fading correlation and unequal average signal power Rayleigh fading on these system. The average bit error rate (BER) performance is calculated by computer simulation and the BER of zero order prediction is theoretically analyzed. The performance degradation caused by the error from prediction, fading correlation, and unequal average signal power is found to be almost independent of each other.