An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.

The H.264 standard allows each macroblock to have up to sixteen motion vectors, four reference frames, and a macroblock mode. Exploiting this feature, we present an efficient temporal error concealment algorithm for H.264-coded video. The proposed method turns out to show good performance compared with conventional approaches.

This paper describes design optimization and performances of hybrid optical transmission lines consisting of effective-area-enlarged pure silica core fiber and dispersion compensating fiber. As a result of the design optimization, considering low nonlinearity and good bending characteristic, the developed fibers exhibit a span average loss of 0.208 dB/km, a span average dispersion slope of 0.02 ps/nm2/km and low nonlinearity with an equivalent effective area of 60 µm2. Further optimization of the relationship among the nonlinearity, the dispersion slope and the bending characteristic enables perfectly dispersion-flattened hybrid optical transmission lines exhibiting a low transmission loss of 0.211 dB/km, low nonlinearity with an equivalent effective area of 60 µm2 and small dispersion deviation of 0.03 ps/nm/km in a wavelength band wider than 40 nm.

The future third generation mobile communications system, named IMT-2000, is expected to provide mobile users with voice, high-rate data and their combined multi-media services with the same QoS as in the fixed networks. As a radio access standard for the IMT-2000, W-CDMA and cdma2000 have been selected in Europe and North America, respectively. In this paper, we present an analytic model of the cdma2000 data mobile servicing a connected data service. In order to do this, we first model the traffic generated at mobile by a discrete-time Batch Markovian Arrival Process (D-BMAP). Next, we model the Radio Link Protocol (RLP) Queue in the cdma2000 MAC protocol by a D-BMAP/D/1 queueing system with batch service and setup times. Finally, we analyze this queueing system and get the performance measures such as the mean delay and the loss probability. Analytic results are compared with simulation ones for accuracy.

In this paper, we present an image compression algorithm using two concepts, subdividing an image matrix and stratifying submatrices into FD-submatrices (feature distribution submatrices). According to the feature distribution and the view that an image can be decomposed into some feature layers, we generate a compression tree by setting up a logic process of decomposition and stratification. To get better compression ratios, the set of submatrices having one and zero as elements, including logic flag sequences is compressed by vector space theory.

The wavelength demultiplexer, using cascaded optical fiber gratings and circulators, was proposed and developed for application to optically amplified wavelength-division multiplexing (WDM) submarine cable systems with 100 GHz channel spacing. Our proposed demultiplexer cannot only achieve high wavelength selectivity, small excess loss and effective allocation of dispersion compensation fibers for each channel, but also be upgraded without affecting other existing channels. By using this demultiplexer, it has been successfully confirmed that 8 WDM channels were demultiplexed even after 6,000 km transmission including separate compensation of accumulated chromatic dispersion in each channel.

In this paper, a new hierarchical block matching algorithm using mean and difference pyramids is presented. The detection of motion vectors at each level of the pyramid is accomplished by selectively eliminating the candidate motion vectors that cannot provide the best match at the next lower level. The remaining motion vectors at each level are propagated and used as the initial motion vectors at the next lower level. Therefore, the possibility of falling into local minima can be significantly reduced. The simulation results show that the proposed method has excellent performance with reduced computational complexity.

From an information geometric viewpoint, we investigate a characteristic of the submanifold of a mixture or exponential family in the manifold of finite discrete distributions. Using the characteristic, we derive a direct calculation method for an em-geodesic in the submanifold. In this method, the value of the primal parameter on the geodesic can be obtained without iterations for a gradient system which represents the geodesic. We also derive the similar algorithms for both problems of parameter estimation and functional extension of the submanifold for a data in the ambient manifold. These theoretical approaches from geometric analysis will contribute to the development of an efficient algorithm in computational complexity.

The characteristics of a-Si bottom-gate TFT test devices with several kinds of inorganic "quasi-black matrix," such as metal, semiconductor, and insulator, on the top were investigated for various black matrix(BM) resistivities. In the Ia-Vg characteristics, for a BM sheet resistance of about1 1012 Ω/, a high off current and large Vth shift were observed due to the back-gating effects when the BM is charged up. Accrding to the ac dynamic characteristics, there was almost no leakage due to the capacitive coupling between source and drain after 16.6 msec(one frame) when the BM sheet resistance was above 7 1013 Ω/ . It was found that hydrogenated amorphous silicon germanium(a-SiGe:H) film, which has enough optical density, with the sheet resistance above the order of 1014 Ω/ is a promising candidate for an inorganic BM on TFT array.