Hybrid image coding method is one of the most promising methods for efficient coding of moving images. The method makes use of jointly motion-compensated prediction and orthogonal transform like DCT. This type of coding scheme was adopted in several world standards such as H.261 and MPEG in ITU-T and ISO as a basic framework [1], [2]. Most of the work done in motion-compensated prediction has been based on a block matching method. However, when input moving images include complicated motion like rotation or enlargement, it often causes block distortion in decoded images, especially in the case of very low bit-rate image coding. Recently, as one way of solving this problem, some motion-compensated prediction methods based on an affine transform or bilinear transform were developed [3]-[8]. These methods, however, cannot always express the appearance of the motion in the image plane, which is projected plane form 3-D space to a 2-D plane, since the perspective transform is usually assumed. Also, a motion-compensation method using a perspective transform was discussed in Ref, [6]. Since the motion detection method is defined as an extension of the block matching method, it can not always detect motion parameters accurately when compared to gradient-based motion detection. In this paper, we propose a new motion-compensated prediction method for coding of moving images, especially for very low bit-rate image coding such as less than 64 kbit/s. The proposed method is based on a perspective transform and the constraint principle for the temporal and spatial gradients of pixel value, and complicated motion in the image plane including rotation and enlargement based on camera zooming can also be detected theoretically in addition to translational motion. A computer simulation was performed using moving test images, and the resulting predicted images were compared with conventional methods such as the block matching method using the criteria of SNR and entropy. The results showed that SNR and entropy of the proposed method are better than those of conventional methods. Also, the proposed method was applied to very low bit-rate image coding at 16 kbit/s, and was compared with a conventional method, H.261. The resulting SNR and decoded images in the proposed method were better than those of H.261. We conclude that the proposed method is effective as a motion-compensated prediction method.

The dipole-dipole interaction in the quantum mechanical treatment of the matter-radiation dynamics, is shown to give rise to split energy levels reminiscent of the nonlinear coupled spectral features as well as a self-sustained coherent modes. Wiener's theory of nonlinear random processes is applied to the second harmonic generation (SHG), leading also to coupled spectral pulling and dipping features, due to the dual noise sources in the fundamental and the harmonic polarizations. Furthermore, the nonlinear spectral features are suggested to be applied to implement quantum (qubit) gates for computation.

A new type of noncausal stochastic model is proposed to represent a random image with double peak spectrum. The model based on the assumption that the double peak spectrum is expressed by a product of two spectra located at two symmetric positions in the 2D spatial frequency space. Estimation of model parameters is made by means of minimizing the "whiteness" which was proposed in authors' previous work. In a simulation for model estimation we make use of computer-generated random images with double peak spectrum. Comparing this with the estimation by a causal model, we demonstrate that the present method can better estimate not only the spectral peak location but also the spectral shape. The proposed model can be extend to an image model with multl-peak spectrum. However, Increase of parameters makes the model estimation more difficult We try a model with triple peak spectra since a real texture image usually possesses a spectral peak at the origin besides the two peaks. A result shows that the estimation of three spectral positions are good enough, but their spectral shapes are not necessarily satisfactory. It is expected that the estimation of multi-peaked spectral model can be made better by improving the process of minimizing the "whiteness."

Spread-spectrum (SS) sharing with comb spectrum structure in a microcell/macrocell cellular architecture in order to increase spectral efficiency is proposed. Such method employs a filter in the code division multiple access (CDMA) transmitter to feature comb spectrum structure, and suppress interference with a narrowband time division multiple access (TDMA) system in using together in SS sharing. The relationship between microcellular capacity and macrocellular capacity of the system is explored and compared to those of conventional SS sharing and orthogonal sharing. To be concrete, we investigate two cases, i.e., using no power control and ideal power control in the TDMA system. In both cases, the proposed SS sharing gives better capacity results than the conventional SS sharing and in the comparison when ideal power control is used in th. TDMA system, it even has the property to oppose the orthogonal sharing in ideal condition without interference.

Finite-difference time-domain (FDTD) analysis is performed to evaluate the distributions of specific absorption rate (SAR) in a human head during use of a handheld portable telephone. A heterogeneous head model has been assumed which is comprised of 273 108 cubic cells 2.5 mm on a side, with the electrical properties of anatomical equivalents. A handset model has been assumed to be a metal box with either a quarter-wavelength monopole or a half-wavelength dipole operating at 900 MHz or 1.5 GHz. The maximum local SARs in the head are evaluated under various exposure conditions. The dependence of the maximum local SARs on the difference in the structures or parameters of the model, i.e. the distance between the antenna and the head, the heterogeneity of the head, the antenna type, the volume of the smoothing region of the local SAR value, skin electrical constants, and the presence or absence of auricles, are examined. It is shown that the heterogeneity of the head barely affect the maximum local SAR when the telephone is located sufficiently close to the head. It is also shown that the electrical constants of skin which has lower conductivity provide the lower maximum local SAR in the head while the maximum local SAR within the brain is not significantly affected. The auricle which lies in closest proximity to the antenna is shown to have significant effect on the maximum local SAR. It is suggested that the presence of the auricle enhances the maximum local SAR by a factor that is 1.7-2.4 larger than the model without auricles.

In this study, we analyze the system which simultaneously transmits spread-spectrum signals with different processing gains. The main purpose of this study is to give an analytical framework that describes the influence of the interfering signals with different processing gains. For this purpose, we define a crosscorrelation function between the spreading sequences with different code lengths, and discuss the effects of interaction between the signals. As the results, we show that the power of the interference component after despreading procedure, the power ratio of the desired to undesired components, and thus the bit error rate are not constant but vary symbol by symbol.

Recently, there have been intensive studies on protocol methods and applications of short range inter-vehicle communication network (SR-IVCN) and systems. The purpose of the studies is to improve the safety of road traffic systems and the smooth control of the traffic flow by providing information to vehicles. Spread spectrum (SS) communication systems are able to simultaneously communicate and measure the distance between the terminals, thus it is advantageous to apply the spread spectrum technique to inter-vehicle communications. This paper assumes that the vehicles incidentally close to each other, form and manage a locally autonomous decentralized dynamic network. An R-ALOHA (Reservation-ALOHA) protocol for the spread spectrum inter-vehicle communication network using head spacing information is proposed which improve the conventional slot reservation methods. Since the near-far problem in SS communication is one reason for the degradation of system performance, this proposed scheme is shown to improve the efficiency of communication. The performance of the proposed system in the environment where the vehicles are assumed to run freely on a highway is verified by computer simulation. It is shown that inter-vehicle communication can be smoothly carried out between one vehicle and the surrounding vehicles using the propose method.

This paper is concerned with the study of fast-frequency-hopped spread-spectrum multiple-access (FFH-SSMA) digital systems employing antenna diversity and noncoherent binary frequency-shift-keying (FSK) modulation operating through an indoor radio multipath Rayleigh channel. The diversity technique of equal gain combing (EGC) is considered in our study. It is assumed that the frequency-hopping rate is equal to the bit rate.

For direct sequence spread spectrum systems, the performance of PN sequence acquisition can be significantly affected if data modulation is present. However, the data modulation often exists during the reacquisition of a PCS radio channel. This study proposes and analyzes two shemes which are designed to improve acquisition process for PN sequence under data modulation. Both designs are based upon a PN acquisition receiver with parallel I-Q matched filters. The first scheme employs a serial search strategy with verification mode. The second scheme, which is still based upon the same parallel acquisition receiver, employs the parallel search strategy. We show that the second scheme is capable of providing faster acquisition under data modulation than the first serial search scheme using the same number of I-Q matched filter. We believe it should become a very good alternative for the acquisition of data modulated PN sequences in personal communications.

Either GMW sequence or m-sequence possesses a 2-valued auto-correlation function which helps to improve the performance of a RAKE receiver. However, their cross-correlation functions are less well controlled. Before they can be applied to a CDMA system, it is necessary to construct their sub-families (taking advantage of their large family size) which offer satisfactory cross-correlation functions. This paper studies several algorithms for constructing those quasi-optimum sub-families in terms of minimized bit error rate under co-channel interference. The study shows that the performance of resultant sub-families is sensitive to sub-family sizes and algorithms. A new criterion based on combined (even and odd) maximum cross-correlation for code selection is introduced, and highest-peak-deleting and most-peak-deleting algorithms are suggested for constructing quasi-optimum sub-families of GMW and m-sequences.

In future mobile radio, high-speed transmission and efficient spectrum utilization will be important. However, multipath propagation with large delay difference and cochannel interference are obstacles to the advanced mobile communication system. An adaptive antenna can suppress multipath signals and cochannel interference signals. This paper reviews basic performance of multipath fading reduction and cochannel interference suppression using the adaptive antenna. After a brief explanation of adaptive antenna concepts, we show simulation and experimental results of the fading reduction. It is pointed out that the adaptive antenna cancels multipath signals with large delay difference strongly. This feature is very important for high-speed TDMA systems. Moreover, it is shown from simulation results that the adaptive antenna improves the spectrum efficiency by suppressing the cochannel interference signals.

A protocol completion method is proposed to transform protocols synthesized from service specifications into error-free protocols. Communication service specifications described by message sequence charts can be synthesized into protocols. The synthesized protocols may include latent exceptional behaviors that are beyond the given service specifications. Therefore, even if the service specifications themselves are verified, these exceptional behaviors may produce protocol errors such as deadlock states or unspecified reception. Error-free protocols can be obtained from error-free service specifications by synthesizing and then completing the synthesized protocols. By taking account of each service specification through protocol completion, every exceptional behavior can be detected in the protocol entities including erroneous exceptional behaviors. This function can also be applied to resolution of feature interactions. The proposed method is applied to the synthesis of the X.227 protocol from its partial service specifications.

The objective of this paper is to provide an effective approach to infrared spectrum recognition. Traditionally, recognizing infrared spectra is a quantitative analysis problem. However, only using quantitative analysis has met two difficulties in practice: (1) quantitative analysis generally very complex, and in some cases it may even become intractable; and (2) when spectral data are inaccurate, it is hard to give concrete solutions. Our approach performs qualitative reasoning before complex quantitative analysis starts so that the above difficulties can be efficiently overcome. We present a novel model for qualitatively decomposing and analyzing infrared spectra. A list of candidates can be obtained based on the solutions of the model, then quantitative analysis will only be applied to the limited candidates. We also present a novel model for handling inaccuracy of spectral data. The model can capture qualitative features of infrared spectra, and can consider qualitative correlations among spectral data as evidence when spectral data are inaccurate. We have tested the approach against about 300 real infrared spectra. This paper also introduces the implementation of the approach.

This paper discusses how to derive message sequence charts (MSCs) from a set of state transition descriptions. Recently, MSC notation has received much attention in the communications software field because it graphically shows system global behavior, So MSC handling techniques are being widely studied. These studies have recommended the design a system by a set of formal MSCs in the early stages of development and then to convert them into state transition descriptions. However, it is difficult to apply those results to existing communications software products. This is because these systems are designed based on state transition descriptions and there are no formal MSCs for them. In this paper, we propose a method of deriving MSCs based on optimized reachability analysis. This method generates MCSs that avoid state explosion. A case study using Q.931 protocol shows the feasibility of this method.

The most troublesome problem in automated X-ray mask inspection is how to exactly determine the threshold level for extracting the pattern portions of each scanning electron microscopic (SEM) image. An exact determination is difficult because the histogram shows, in most cases, a complicated multi-modal pattern and the true threshold level often varies with each successive image. This paper presents a novel thresholding approach for segmenting SEM images of X-ray masks. In this approach, the shape of the histogram of each image is iteratively analyzed until a threshold value minimizing the cost of the correspondence with a reference histogram and satisfying criteria for determining thresholds is obtained. This new approach is used in an automated inspection system. When the input image resolution is set to 0.05µm/pixel, experiments confirm 0.1µm defects are unfailingly detected.

When a natural language specification is translated into a formal one, it is important for objects and operations appearing in the natural language specification to be appropriately classified according to the framework of data types in the formal specification. In this paper, we propose a semi-automatic method of constructing a context-free grammar (cfg) representing an assignment of data types to words in a given natural language specification. In our method, a cfg is mechanically constructed from sample sentences in a natural language specification, where the cfg represents type declarations of expressions and type hierarchy. Then, the cfg is appropriately modified by adding nonterminals/production rules that represent type inclusion relations. In this modification process, candidates for the productions to be added are presented to the user. Finally, the cfg is simplified based on structural equivalence. The result of applying this method to a part of the OSI session protocol specification (39 sentences) is also presented. There was an example in which ambiguity of anaphoric bindings was solved by type checking based on the resulting cfg.

In this paper, we show that by suitably selecting a notation to construct synchronization requirement specifications (SRS) for multimedia presentation we can express the timing characteristics at an abstract level, verify the specification, and obtain a hardware implementation through a sequence of transformations of the specification. First, we introduce the notion of a well-formed SRS and its hardware model. Second, we model an SRS as a timed Petri net and interpret the transitions of the net as hardware signals. To obtain logic functions from the SRS, we simplify the net and obtain a signal transition graph satisfying the unique state coding property. Finally, we show how to obtain a logic-level design of synchronizers.

This paper discusses the fixed-point smoothing and filtering problems given lumped covariance function of a scalar signal process observed with additive white Gaussian noise. The recursive Wiener smoother and filter are derived by applying an invariant imbedding method to the Volterra-type integral equation of the second kind in linear least-squares estimation problems. The resultant estimators in Theorem 2 require the information of the crossvariance function of the state variable with the observed value, the system matrix, the observation vector, the variance of the observation noise and the observed value. Here, it is assumed that the signal process is generated by the state-space model. The spectral factorization problem is also considered in Sects. 1 and 2.

A new adaptive AR spectral estimation method is proposed. While conventional least-squares methods use a single windowing function to analyze the linear prediction error, the proposed method uses a different window for each frequency band of the linear prediction error to define a cost function to be meinemized. With this approach, since time and frequency resolutions can be traded off throughout the frequency spectrum, an improvement on the precision of the estimates is achieved. In this paper, a wavelet-like time-frequency resolution grid is used so that low-frequency components of the linear prediction error are analyzed through long windows and high-frequency components are analyzed through short ones. To solve the optimization problem for the new cost function, special properties of the correlation matrix are used to derive an RLS algorithm on the order of M2, where M is the number of parameters of the AR model. Computer simulations comparing the performance of conventional RLS and the proposed methods are shown. In particular, it can be observed that the wavelet-based spectral estimation method gives fine frequency resolution at low frequencies and sharp time resolution at high frequencies, while with conventional methods it is possible to obtain only one of these characteristics.

Rate-based congestion control is a promising scheme as data transfer service in ATM networks, and has been standardized in the ATM Forum. To migrate the existing upper layer protocols to ATM networks, however, further investigation is necessary. In particular, when ABR service class is applied to TCP (Transmission Control Protocol), duality of congestion control schemes in different protocol layers, i.e., conventional window-based congestion control in the Transport layer and ratebased congestion control in the ATM layer, may have a unexpected influence on performance. As an alternative approach for supporting TCP protocol, EPD (Early Packet Discard) has been recently proposed, which adds the function to the UBR (Unspecified Bit Rate) service. It does not have a "duality problem" since EPD only discards cells selectively to improve packet-level performance. In this paper, we exhibit performance of TCP protocol over ATM networks by using a simulation technique. We first compare rate-based control of ABR service and EPD applied to UBR service, and show that rate-control achieves better fairness and higher throughput in most circumstances. However, rate-based control requires careful tuning of control parameters to obtain its effectiveness and a duality problem leads to unexpected degradation of TCP-level performance. By the rate-based congestion control, temporal congestion at the switch is quickly relieved by the rate down of the source terminals. However, our simulation explores that if the parameter set of the rate-based congestion control is not appropriately used, the congestion is also recognized at TCP due to packet drops and TCP unnecessarily throttles its window size. To avoid this sort of the problem, we develop the appropriate parameter set suitable to TCP on ABR service, and point out that some modification of TCP may be necessary for further performance improvement.