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.

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.

This paper deals with the improvement of performance in the transform and subband image coding systems with negatively-correlated input signal. Using a more general source model than the AR(1) model as an input, the coding performance for the transform and subband coding schemes is evaluated in terms of the coding gain over PCM. The source model used here has such resonant band characteristics that its power spectrum has a peak at some frequency between 0 and π/2 for positive autocorrelation and between π/2 and π for negative autocorrelation. It is shown that coding schemes are classified into two classes; one has the pairwise mirror-image property in their filter banks and performs symmetrically regardless of the sign of the autocorrelation, and the other has no that property and performs asymmetrically with inferior performance for negative autocorrelation. Among the well-known transform and subband coding schemes, the DHT and QMF coding systems belong to the former class and the DCT and SSKF coding systems to the latter. In order to remedy the inferior performance, we propose the method in which one modulates the negatively-correlated signal sequences by the alternating sign signal with unity magnitude (-1)n to convert them into positively-correlated sequences. The algorithms are presented for the DCT and SSKF image coding systems with the adaptive signal modulation. In the DCT coding systems, we are particularly concerned with the DCT-based hierarchical progressive coding mode of operation, since the signal modulation works well for that coding mode. The SSKF image coding system has the regular quad-tree structure with three stages. The simulation results for test images show that our method can successfully be applied to the images with a considerable amount of energy in the frequency range higher than π/2 in horizontal or vertical direction, such as fingerprints and textile patterns sampled at a rate close to the Nyquist rate. The paper closes with a brief introduction to the modification of our DCT-based method.

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.

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.

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.

In this paper, we discuss an abstraction method for Petri nets based on an equivalence of firing sequences of a specified subnet or a specified subset of transitions. Specifically, a method is presented to generate an equivalent net which preserves firing sequences of a specified subnet or a specified subset of transitions. The abstraction can be applied to an efficient behavioral analysis of concurrent systems constructed by composition of modules such as communication networks and Flexible Manufacturing Systems (FMS).

Extremely narrow track width of deep submicron range is examined in perpendicular magnetic recording. Head field distribution of a single-pole head analyzed by 3-dimensional computer simulation results in a sharp gradient, but relatively large cross-sectional area is required to maintain head field strength. Based on this design concept, a lateral single-pole head is described and proved to attain track width of 0.4 µm. In addition, multilevel partial response appropriate to the new multitrack recording system is proposed.

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.

Genetic Algorithm (GA) is the method of approaching optimization problem by modeling and simulating the biological evolution. As the genetic algorithm is rather time consuming, the use of a parallel genetic algorithm can be advantage. This paper describes new methods for fine-grained parallel genetic algorithm using a multiprocessor system FIN. FIN has a VLSI-oriented interconnection network, and is constructed from a viewpoint of fractal geometry so that self-similarity is considered in its configuration. The performance of the proposed methods on the Traveling Salesman Problem (TSP), which is an NP-hard problem in the field of combinatorial optimization, is compared to that of the simple genetic algorithm and the traditional fine-grained parallel genetic algorithm. The results indicate that the proposed methods yield improvement to find better solutions of the TSP.

Recently, some speech recognition methods using fusion of visual and auditory information have been researched. In this paper, a study on the mouth shape image suitable for fusion of visual and auditory information has been described. Features of mouth shape which are extracted from gray level image and binary image are adopted, and speech recognition using linear combination method has been performed. From results of speech recognition, the studies on the mouth shape features which are effective in fusion of visual and auditory information have been performed. And the effectiveness of using two kinds of mouth shape features also has been confirmed.

Single-reference and multi-reference noise canceller (SRNC and MRNC) performances are investigated based on correlation between signal and noise. Exact relations between these noise canceller performances and signal-noise correlation have not been well discussed yet. In this paper, the above relations are investigated based on theoretical, analysis and computer simulation. The normalized LMS (NLMS) algorithm is employed. Uncorrelate, partially correlated, and correlated signal and noise combinations are taken into account. Computer simulation is carried out, using real speech, white noise, real noise sound, sine wave signals, and their combinations. In the SRNC problem, spectral analysis is applied to derive the canceller output power spectrum. From the simulation results, it is proven that the SRNC performance is inversely proportional to the signal-noise correlation as expected by the theoretical analysis. From the simulation results, the MRNC performance is more sensitive to the signal-noise correlation than that of SRNC. When the signal-noise correlation is high, by using a larger number of adaptive filter taps, the noise is reduced more, and, the signal distortion is increased. This means the signal components included in the noise are canceled exactly.

A new method is developed to generate fuzzy rules from numerical data. This method consists of two algorithms: Algorithm 1 is used to identify structures of the given data set, that is, the optimal number of rules of system; Algorithm 2 is used to identify parameter of the used model. The former is belonged to unsupervised learning, and the latter is belonged to supervised learning. To identify parameters of fuzzy model, we developed a neural network which is referred to as Unsymmetrical Gaussian Function Network (UGFN). Unlike traditional fuzzy modelling methods, in the present method, a) the optimal number of rules (clusters) is determinde by input-output data pairs rather than by only output data as in sugeno's method, b) parameter identification of ghe present model is based on a like-RBF network rather than backpropagation algorithm. Our method is simple and effective because it integrates fuzzy logic with neural networks from basic network principles to neural architecture, thereby establishing an unifying framework for different fuzzy modelling methods such as one with cluster analysis or neural networks and so on.

This papaer presents a data model and the database system architecture to handle multimedia data, especially video (or image sequence) data. A new scheme AIS diagram" is introduced, by which all informations about entities and relationships among bitmap frames or textual informations are described in a uniform way. We focus on the integration of engineering data. The most important problem to be solved is how to capture the objects" in each frame and to represent them in the data model. For this purpose we propose physical cut" and logical cut" as a unit of information in image sequences and, using those concepts, we developed a prototype system for multimedia data processing on a conventional database system.

A real-time read/write motion picture has been demonstrated by hole-burning holography using cryogenic Eu3+: Y2SiO5 crystal. In a holographic configuration the laser frequency was continuously scanned within the 7F0-5D0 absorption line while the object was in motion. This movie has no picture frames, and therefore is temporally continuous. This feature allows realization of high-speed and high-time-resolution motion recording.

In this paper, we analyze the convergence behavior of the CMA (Constant Modulus Algorithm) adaptive array working under the steepest decent method, and investigate how to achieve the highest possible output SINR (Signal to Interference plus Noise Ratio). In multipath radio environments, CMA sometimes suppresses the desired signal (stronger one) and selects to receive the interference (the weaker one) resulting in the low output SINR. This is one of the problems met in an optimization system under a nonlinear control equation where there are two or more local minima of the cost function and the final state depends on the initial condition. The study can be done only numerically by starting from various initial values. In our analysis of the CMA adaptive array in multipath radio environments, we will assume that there are two waves which are radiated from the same source and try to find out what conditions may affect the convergence behavior. In this process, we discover the effect of the neglected factor by the previous papers and revise the initial condition to guarantee the reception of the desirable wave. In conclusion, we propose the prescription of the initial weights of the array elements as well as the choice of preferable arrays.

Signal processing antennas have been studied not only for interference suppression but also for high-resolution estimation of radio environment such as directions-of-arrival of incident signals. These two applications are based on the common technique, that is, null steering. This tutorial paper reviews the MUSIC algorithm which is one of the typical high-resolution techniques. Examining the eigenvector beam patterns, we demonstrate that the high-resolution capability is realized by steering nulls. The considerations will be useful for understanding the high-resolution techniques in the signal processing antennas. We then describe a modified version of MUSIC (Root MUSIC). We show the performance and robustness of the method. Furthermore, we introduce radar target identification and two-dimensional radar target imaging. These study fields are new applications of the signal processing antennas, to which a great deal of attention has been devoted recently.

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.

Tilt margins for disk and lens for a magneto-optical (MO) head were studied for designing a disk system for use with objective lenses having numerical apertures (NA) of 0.55, 0.60, and 0.65. The tilt margins were examined to determine the aberration characteristics of objective lenses and bit error rate (BER) by recording and reproducing signal. In preparing the optical head for testing disk and lens tilt margins, the aberrations were measured by image processing from the CCD area sensor for the spot image of the focused beam, and BER dependencies on the tilting of lens and disk were obtained at the velocity of the outer diameter of the MO disk at the bit rate of 80-Mbps (1, 7 code modulation) recording. According to the aberration and BER characteristics, the limitation for effective wavefront aberration would be 0.05λ rms, the tilt margins corresponded to BER limitation at the level of 3*10-5. The disk margins for NA=0.55, 0.6, and 0.65 were 0.4, 0.2, and 0.1 degrees. The lens tilt margins for NA=0.55, 0.6, and 0.65 were 0.2, 0.1, and 0.05 degrees.

Tremendous progress has been made in magnetic data storage by applying theoretical considerations to technologies accumulated empirically through a great deal of research and development. In Japan, the recording demagnetization phenomenon was eagerly analyzed by many researchers because it was a serious problem in analogue signal recording such as video tape recording using a relatively thick magnetic recording medium. Consequently, perpendicular magnetic recording was proposed as a method for extremely high-bit-density recording. This paper describes the theoretical background which has resulted in the idea of perpendicular magnetic recording. Furthermore, the possibility of magnetic recording is discussed on the basis of the results obtained theoretically by magnetic recording simulators. Magnetic storage has the potential for extremely high-bit-density recording exceeding 1 Tb/cm2. We propose the idea of 'spinic data storage' in which binary digital data could be stored into each ferromagnetic single-domain columnar particle when the perpendicular magnetizing method is used.