This paper proposes a group demodulator that employs multi-symbol chirp Fourier transform to demodulate pulse shaped and time asynchronous signals without degradation; this is not possible with conventional group demodulators based on chirp Fourier transform. Computer simulation results show that the bit error rate degradation of the proposed group demodulator at BER=10-3 is less than 0.3dB even when a root Nyquist (α=0.5) filter is used as the transmission pulse shaping filter and the symbol timing offset between the desired channel and the chirp sweep is half the symbol period.

This paper proposes a new fully-digitalized π/4-shift QPSK modulator consisting of a digital pulse shaping filter and a baseband quadrature modulator. By employing a novel digital filter configuration, the required filter memory is reduced to just 6.25% of the conventional one. Moreover, since the proposed baseband modulation scheme does not employ analog mixers or an analog 90 divider, a very accurate, high-stable and compact modulator is realized. It is shown that the proposed scheme achieves excellent low power consumption characteristics and is more suitable for digital LSIC implementation of personal communication terminals than a direct RF modulation scheme and an analog IF modulation scheme.

We propose a new structure of antenna system to enhance the horizontal plane gain and control the antenna pattern, using passive loading. Our proposed structure can be applied to various kinds of antennas on a handset. We discuss the case of a λ/4 monopole antenna on a handset in this paper. In a new structure of λ/4 monopole antenna system, we show that, 1) the increase of the average gain about 5dB in the horizontal plane can be realized by an optimum load, 2) the antenna pattern can be controlled by changing the value of the passive load so as to have some desirable shapes, and 3) the antenna size can be made smaller by about 6% than the one with no loading because the optimum loading makes the resonant frequency lower. These results were confirmed by the calculations using the method of moments for the EFIE and the measurements.

Stored channel simulation for mobile radio channel can be the common base of the development of future world wide personal radio communication systems, especially for high bit-rate digital system. This paper proposes a mobile radio channel database which is suitable for the laboratory channel simulation using a simple stored channel simulator, also proposed by the author. The database enables the establishment of a mobile radio channel database containing worldwide channel data in a few discs of compact disc.

A method for extracting and recognizing character strings from unformed document images, which have inclined character strings and have no structure at all, is described. To process such kinds of unformed documents, previous schemes, which are intended only to deal with documents containing nothing but horizontal or vertical strings of characters, do not work well. Our method is based on the idea that the processes of recognition and extraction of character patterns should operate together, and on the characteristic that the character patterns are located close to each other when they belong to the same string. The method has been implemented and applied to several images. The experimental results show the robustness of our method.

This paper presents a new line extraction method to capture vectors based on contours and skeletons from line drawing raster images in which the lines are touched by characters or other lines. Conventionally, two line extraction methods have generally been used. One is a thinning method. The other is a medial line extraction method based on parallel pairs of contours. The thinning method tends to distort the extracted lines, especially at intersections and corners. On the other hand, the medial line extraction method has a poor capability as regards capturing correct lines at intersections. Contours are able to maintain edge shapes well, while skeletons preserve topological features; thus, a combination of these features effectively leads to the best fitting line. In the proposed method, the line which best fits the original image is selected from among various candidate lines. The candidates are created from several merged short skeleton fragments located between pairs of short contour fragments. The method is also extended to circular arc fitting. Experimental results show that the proposed line fitting method is effective.

In this paper, authors discuss on a lexicon directed algorithm for recognition of unconstrained handwritten words (cursive, discrete, or mixed) such as those encountered in mail pieces. The procedure consists of binarization, presegmentation, intermediate feature extraction, segmentation recognition, and post-processing. The segmentation recognition and the post-processing are repeated for all lexicon words while the binarization to the intermediate feature extraction are applied once for an input word. This algorithm is essentially non hierarchical in character segmentation and recognition which are performed in a single segmentation recognition process. The result of performance evaluation using large handwritten address block database, and algorithm improvements are described and discussed to achieve higher recognition accuracy and speed. Experimental studies with about 3000 word images indicate that overall accuracy in the range of 91% to 98% depending on the size of the lexicon (assumed to contain correct word) are achievable with the processing speed of 20 to 30 word per minute on typical work station.

We propose a beam tracing frame which shifts together with either the guiding structure or the beam propagation in optical circuits. This frame is adaptive to the beam propagation analysis based on the finite-element method and can reduce the computational window size.

This paper discusses the potential benefits of H0-based ISDN. By providing widespread H0 (384kb/s) call services, much like today's telephone systems, it should be possible to bring multimedia public communication services to the general public. Small distributed switching systems and reuse of existing metallic loops will contribute to its economical construction and rapid expansion into general use. System-on-a-chip technology, expected to appear soon, will make the necessary small switching systems cost-effective. The short loops resulting from the distribution will allow Hl-band (1.5/2.0Mb/s) metallic loops to be used. In terms of function, the distributed switching nodes will permit node-by-node customization, which will make switching systems simple and flexible. The proposed node-by-node customization will allow subscribers in each different node to choose they prefer. H0-based ISDN will provide various type of nodes, supporting various types of subscriber loops, whereas present public networks enforce standardized subscriber loops. Furthermore, when customized subscriber switching systems accommodate star-LAN interfaces as subscriber loops, the public network will be able to provide LAN services in a closed area as part of the public network services. The LAN users will be able to converse with ordinary residential subscribers through H0-calls. This will lead to the integration of LANs and public networks.

Let S(n) be a space constructible function such that S(n) log n. In this paper, we show that AuxSpTu (S(n),T(n)) NSPACE (S(n)log T(n)), where AuxSpTu (S(n),T(n)) is the class of languages accepted by nondeterministic auxiliary pushdown automata operating simultaneously in O(S(n)) space and O(T(n)) turns of the auxiliary tape head.

Pitch frequency is a basic characteristic of human voice, and pitch extraction is one of the most important studies for speech recognition. This paper describes a simple but effective technique to obtain correct pitch frequency from candidates (pitch candidates) extracted by the short-range autocorrelation function. The correction is performed by a neural network in consideration of the time coutinuation that is realized by referring to pitch candidates at previous frames. Since the neural network is trained by the back-propagation algorithm with training data, it adapts to any speaker and obtains good correction without sensitive adjustment and tuning. The pitch extraction was performed for 3 male and 3 female announcers, and the proposed method improves the percentage of correct pitch from 58.65% to 89.19%.

Electromagnetic power absorption in multilayered tissue media including anisotropic muscle regions whose principal dielectric axes (that is, muscle fibers) have various directions are analyzed by using 44 matrix method. Numerical calculations in 10kHz-10MHz show the effects of orientation of muscle fibers and polarization of incident wave on absorbed power density in tissues.

The frequency characteristics of whole-body averaged specific absorption rates (SARs) in a human model exposed to a near field of an electric dipole or a magnetic dipole are calculated, using a finite-difference time-domain method. The dependences of the characteristics on the orientation of the dipole and on the distance from the source to the model are investigated. It is shown that the resonant peak of the SAR that appears in the E-polarized far-field exposure is observed only when the source is E-polarized and is located at 80cm, while the peak vanishes or is not noted when the source is located at 40cm and 20cm nor when it is H-polarized. The relationships between the whole-body averaged SARs and the incident electromagnetic field strengths are also investigated. It is suggested that the spatially-averaged value of the dominating component between the electric field and the magnetic field over the space where a human body would occupy provides a relevant measure to estimate the whole-body averaged SAR of a body in the vicinity of a small radiation source.

The effects of finite ground plane upon the patterns of the GPS patch antennas are analyzed by EEC with modified edge representation (MER). The comparison with UTD and measurements shows that low elevation patterns including axial ratios are successfully predicted.

This paper discusses a new image resolution conversion method which converts not only spatial resolution but also amplitude resolution. This method involves considering impulse responses of image devices and human visual characteristics, and can preserve high image quality. This paper considers a system that digitizes the multilevel input image with high spatial resolution and low amplitude resolution using an image scanner, and outputs the image with low spatial resolution and high amplitude resolution on a CRT display. The algorithm thus reduces the number of pixels while increasing the number of brightness levels. Since a CRT display is chosen as the output device, the distribution of each spot in the display, which is modeled as a Gaussian function, is taken as the impulse response. The output image is then expressed as the summation of various amplitudes of the impulse response. Furthermore, human visual perception, which bears a nonlinear relationship to the spatial frequency component, is simplified and modeled with a cascade combination of low-pass and high-pass filters. The output amplitude is determined so that the error between the output image and the input image, after passing through the visual perception filter, is minimized. According to the results of a simulation, it is shown that image quality can be largely preserved by the proposed method, while significant image information is lost by conventional methods.

A method is presented to perform image segmentation by accumulatively observing apparent motion in a long image sequence of a dynamic scene. In each image in the sequence, locations are grouped into small patches of approximately uniform optical flow. To reduce the noise in computed flow vectors, a local image motion vector of each patch is computed by averaging flow vectors in the corresponding patches in several images. A segment contains patches belonging to the same 3-D plane in the scene. Initial segments are obtained in the image, and then an attempt to merge or split segments is iterated to update the segments. In order to remove inherent ambiguities in motion-based segmentation, temporal coherence between the local image motion of a patch and the apprent motion of every plane is investigated over long time. In each image, a patch is grouped into the segment of the plane whose apparent motion is temporally most coherent with the local image motion of the patch. When apparent motions of two planes are temporally incoherent, segments of the planes are retained as individual ones.

ADTs (Abstract Data Types) have been known as a promising feature for extending the database applications to CAD/CAM and other engineering areas. This extension has brought a new dimension to query optimization. Conventional query optimization methods, which considers only joins as the dominant cost factor, are based on the belief that the executions of selections and projections basically take no time. However, in databases that support ADTs, this may not be true since the execution of a selection involving ADT functions may be very time-cosuming. Thus selections with ADT functions should not be considered as inexpensive operations in queries, and the conventional optimization heuristics should be enhanced to correspond to the appearance of the queries of this kind. In this paper, we show the possibility that semijoins can be used as an effective means to reduce the number of evaluations of an ADT function and consequently optimize queries containing expensive ADT selections. We suggest the enhancement of an conventional optimization heuristics by adding a semijoins pre-stage which is an additional component corresponding to expensive ADT selections. By this way, the applicable range of the conventional heuristics are extended to hold the ability of handling queries with ADT functions. Several optimization algorithms are given and some simulation results show the effectiveness of our methods.

There have been several interesting investigations on the space functions constructed by one-dimensional or two-dimensional Turing machines. On the other hand, as far as we know, there is no investigation about the space functions constructed by three-dimensional Turing machines. In this paper, we investigate about space constructibility by three-dimensional deterministic Turing machines with cubic inputs, and show that the functions log*n and log(k)n, k1, are fully space constructible by these machines.

We present outside-in conditional narrowing for orthogonal conditional term rewriting systems, and show the completeness of leftmost-outside-in conditional narrowing with respect to normalizable solutions. We consider orthogonal conditional term rewriting systems whose conditions consist of strict equality only. Completeness results are obtained for systems both with and without extra variables. The result bears practical significance since orthogonal conditional term rewriting systems can be viewed as a computation model for functional-logic programming languages and leftmost-outside-in conditional narrowing is the computing mechanism for the model.

An Ordered Binary Decision Diagram (BDD) is a graph representation of a Boolean function. According to its good properties, BDD's are widely used in various applications. In this paper, we investigate the computational complexity of basic operations on BDD's. We consider two important operations: reduction of a BDD and binary Boolean operations based on BDD's. This paper shows that both the reduction of a BDD and the binary Boolean operations based on BDD's are NC1-reducible to REACHABILITY. That is, both of the problems belong to NC2. In order to extend the results to the BDD's with output inverters, we also considered the transformations between BDD's and BDD's with output inverters. We show that both of the transformations are also NC1-reducible to REACHBILITY.