In this study, a modeling method of the intermittency chaos using the Markov chain is proposed. The performances of the intermittency chaos and the Markov chain model are investigated when they are injected to the Hopfield Neural Network for a quadratic assignment problem or an associative memory. Computer simulated results show that the proposed modeling is good enough to gain similar performance of the intermittency chaos.

This paper describes the design and implementation of a testbed for predicting master/slave (M/S) programs written using Message Passing Interface (MPI) programs. The testbed, named M/S Emulator (MSE), aims at assisting developers in evaluating the performance of M/S programs and dynamic load-balancing strategies on clusters of PCs. In order to realize this, MSE predicts the communication time by using a realistic parallel computational model, an extension of the LogGPS model. This extended model improves the prediction accuracy on a large number of processors, because it captures the master's bottleneck: the overhead required for retrieving arrival messages from the slaves. Current MSE also employs a best effort emulation method for predicting the calculation time. In our experiments, MSE demonstrated an accurate prediction on clusters, especially on a larger number of nodes. Therefore, we believe that our extended model enables us to analyze the scalability of the M/S program performance.

The cable length in wired serial data communication is limited because the limited bandwidth of a long cable introduces ISI (Inter Symbol Interference). A line equalizer can be used at the receiver to extend the channel bandwidth. This paper proposes a low-power and small-area analog adaptive line equalizer for 100-Mb/s operation on UTP (Unshielded Twisted Pair) cable up to 100 m. The proposed adaptive line equalizer is fabricated with 0.35-µm CMOS process, consumes 19 mW and occupies only 0.07 mm2 Measurement results show that the prototype can operate at data rate of 100 Mb/s on a 100-m cable and 155 Mb/s on a 50-m cable.

We present a single-chip MPEG-4 audiovisual LSI in a 0.13 µm CMOS, 5-layer metal technology with 16 Mbit embedded DRAM, which integrates four 16 bit RISC and dedicated hardware accelerators including a 5 GOPS post filtering unit. It consumes 160 mW at 125 MHz and dissipates 80 nA in the standby mode. The chip is the world first LSI handling MPEG-4 CIF video encoding at 15 frames/sec and audio/speech encoding simultaneously.

Speech quality of VoIP (Voice over Internet Protocol) may potentially be degraded by transmission errors such as packet loss and delay which are basically inevitable in best-effort communications. This study investigates an error concealment technique for such degradation by using a receiver-based technique called pitch waveform replication. For enhancing the conventional technique, this study proposes a waveform reconstruction technique that also takes account of the pitch variation between the backward and forward frames of gap frames. From experimental results of objective evaluation, it is indicated that the proposed technique may potentially be useful for improving the speech quality, compared with the conventional technique.

It is a critical design process to estimate the fractional errors of the Synthetic Aperture Radar (SAR) processor before implementation. The contribution of this paper is to identify the chief sources and types and to suggest an estimation technique for overall fractional errors of the space-based SAR processor using Range-Doppler Algorithm (RDA). Also, simulation is performed to the Experimental-SAR (E-SAR) processor to examine the practicability and efficiency of the technique, the results are discussed, and the solutions for problems are recommended. Therefore, this technique can be used to estimate the fractional errors of the space-based SAR processor using RDA.

Classical studies of Asynchronous Transfer Mode (ATM) switching elements and in particular the buffer behavior of the Shared Buffer Memory (SBM), assume that all read and write operations of cells to, respectively from, the SBM are executed simultaneously. However, in a real switching element, the inlets (outlets) are scanned sequentially for arriving (departing) cells during the so-called input (output) cycle. Furthermore, the input and output cycles are intermingled, each read operation being followed by a write operation. This is referred to as the Timeslot Interchange Mechanism (TIM). In this paper, we present the analysis of a queueing model that includes the TIM. We model the cell arrival processes on the inlets of the switching element as independent Bernoulli arrival processes. Moreover, we assume that cells are routed from the inlets to the outlets of the switching element according to an independent and uniform process, i.e., the destinations of consecutive cell arrivals on any given inlet are independent and for a given cell all destinations are equiprobable. Under these assumptions, we will derive expressions for the probability generating functions of the queue length in an individual routing group (a logical queue that contains all cells scheduled for the same destination), the (total) queue length in the SBM, and the cell waiting time. From these results, expressions for the mean values and the tail distributions of these quantities are calculated, and the influence of the TIM on the buffer behavior is studied through comparison with a model where all read and write operations occur simultaneously.

In the urban area, buildings are the main scatterer which dominate the mobile propagation characteristics. However, reflection, diffraction, and scattering on the building surfaces in the radio environment induce undesirable multipath propagation. Multipath prediction with respect to a building surface has been conventionally based on an assumption that reflection from the surface has a substantial specular direction. However non-specular scattering from the building surface can affect the channel characteristics as well as specular scattering. This paper presents multipath characteristics of non-specular wave scattering from building surface roughness based on the experimental results. Superresolution method was applied as an approach to handle the signal parameters (DoA, ToA) of the individual incoming waves reflected from building surface roughness. The results show that the multipaths can be detected at many scatterers, such as ground, window's glass, window's frames and bricks surface, as well as directly from the transmitter. Most of the scattered waves are arriving closely from specular directions. The measured reflection coefficients were well bounded by reflection coefficients of the theoretically smooth and random rough surface. The Fresnel reflection coefficient formula, considering the finite thickness of the building surface and Gaussian scattering correction, give better prediction for glass and bricks reflection coefficient measurement.

The classification time required by conventional multi-class SVMs greatly increases as the number of pattern classes increases. This is due to the fact that the needed set of binary class SVMs gets quite large. In this paper, we propose a method to reduce the number of classes by using nearest neighbor rule (NNR) in the principle component analysis and linear discriminant analysis (PCA+LDA) feature subspace. The proposed method reduces the number of face classes by selecting a few classes closest to the test data projected in the PCA+LDA feature subspace. Results of experiment show that our proposed method has a lower error rate than nearest neighbor classification (NNC) method. Though our error rate is comparable to the conventional multi-class SVMs, the classification process of our method is much faster.

In this paper, the space time transmit diversity (STTD) decoding combined with minimum mean square error (MMSE) equalization is presented for MC-CDMA downlink and uplink in the presence of multiple receive antennas. The equalization weights that minimize the MSE for each subcarrier are derived. From computer simulation, it was found that the BER performance of STTD decoding combined with MMSE equalization and Mr-antenna diversity reception using the weights derived in this paper provides the same diversity order as 2Mr-antenna receive diversity with MMSE equalization but with 3 dB performance penalty and is always better than that with no diversity. The uplink BER performance can also be improved with STTD, but the error floor still exists. However, with 2-receive antennas in addition to 2-antenna STTD, the BER floor can be reduced to around 10-5 even for the uplink.

In texture mapping, anisotropic filtering methods, which require more texels, have been proposed for high-quality images. Memory bandwidth, however, is still limited by a bottleneck in the texture-filtering hardware. In this paper, we propose anisotropic texture filtering based on edge function. In generating the weight that plays a key role in filtering texels loaded from memory, the edge function gives accurate contribution of texels to the pixel intensity. The quality of images is superior to other methods. For images of the same quality, our method requires less than half the texels of other methods. In other words, the improvement in performance is more than twice that of other methods.

Flexible Resource Allocation (FRA) strategies selectively control the transmission rates of users allowing them to specify maximum and minimum bandwidth requirements for the service type requested ensuring a minimum quality of service (QoS) is met. Complete, Partial, and Non Resource Sharing are the three types of resource sharing policies that can be used in systems with integrated services (voice, video and data) with different QoS and elasticities requirements. In this paper, an FRA strategy with Partial Resource Sharing, called Primary Unavailable Secondary Minimum (PUSMin), is presented. An analytical method is developed to assess its performance in an environment where several service types (with different bandwidth and elasticities requirements) exist. Results show that PUSMin decreases the resource reassignment rate as the offered traffic increases. This decreases the signalling overhead and computational complexity in the Base Station Controller (BSC) or Base Transceiver Station (BTS).

We developed a compact, 16-channel integrated optical subscriber module for one-fiber bi-directional optical access systems. They can support more subscribers in a limited mounting space. For ultimate compactness, we created 8-channel integrated super-compact optical modules, 4-channel integrated limiting amplifiers, and 4-channel integrated LD drivers for Fast Ethernet. We introduce a new simulation method to analyze the electrical crosstalk that degrades sensitivity of the optical module. A new IC architecture is applied to reduce electrical crosstalk. We manufactured the optical subscriber module with these optical modules and ICs. Experiments confirm that the module offers a sensitivity of -27.3 dBm under 16-channel 125 Mbit/s simultaneous operation.

The issue of scalable Differentiated Services (DiffServ) admission control now is still an open research problem. We propose a new admission control model that can not only provide coarse grain Quality of Services (QoS), but also guarantee end-to-end QoS for assured service without per-flow state management at core routers within DiffServ domain. Associated with flow aggregation model, a hybrid signaling protocol is proposed to select the route satisfying the end-to-end QoS requirements. Simulation result shows that the proposed model can accurately manage resource, leading to much better performance when compared to other schemes.

Although watermarking techniques have been extensively developed for natural videos, little progress is made in the area of graphics animation. Following the former successful MPEG-1 and MPEG-2 coding standards that provide efficient representations of natural videos, the emerging MPEG-4 standard incorporates new coding tools for 2D mesh animation. Graphics animation information is crucial for many applications and may need proper protection. In this paper, we develop a watermarking technique suitable for MPEG-4 2D mesh animation. The proposed method is based on the multiresolution analysis of 2D dynamic mesh. We perform wavelet transform on the temporal sequence of the node points to extract the significant spectral components of mesh movement, which we term the "feature motions. " A binary watermark invisibly resides in the feature motions based on the spread-spectrum principle. Before watermark detection, a spatial-domain least-squares registration technique is used to restore the possibly geometrically distorted mesh data. Each watermark bit is then detected by hard decision with cryptographically secure keys. We have tested the proposed method with a variety of attacks, including affine transformations, temporal smoothing, spectral enhancement and attenuation, additive random noise, and a combination of the above. Experimental results show that the proposed watermarks can withstand the aforementioned attacks.

An IIR digital low pass filter with flat monotonic passband, equiripple stopband and narrower transition bandwidth than that of Inverse Chebyshev digital filters of the same order is designed. The requisite equiripple stopband is realized by designing the filter in Deczkeys' w-plane. The characteristic functions are designed so as to have a root of multiplicity n at ω = 0 to ensure the n degree of flatness of the passband, and to have a pair of complex conjugate roots with coordinates constrained such that the magnitude response of the passband attenuates monotonically. The freedom in the coordinate of the complex conjugate roots is exploited to minimize the transition bandwidth. The equations are derived that give the minimum transition bandwidth of the proposed filter, which is considerably narrower than that of Inverse Chebyshev filters. It is showen through practical numerical examples that the order of the proposed filter is as low as half that of the Inverse Chebyshev filter satisfying the same specification.

The paper discusses the spatio-temporal phenomena in autonomous two-layer Cellular Neural Networks (CNNs) with mutually coupled templates between two layers. By computer calculations, we show how pattern formations, autowaves and classical waves can be regenerated in the networks, and describe the properties of these phenomena in detail. In particular, we focus our discussion on the necessary conditions for generating these spatio-temporal phenomena. In addition, the influences of the template parameters and initial state conditions of CNNs on the spatio-temporal phenomena are investigated.

Finding DC operating points of transistor circuits is an important and difficult task. The Newton-Raphson method adopted in SPICE-like simulators often fails to converge to a solution. To overcome this convergence problem, homotopy methods have been studied from various viewpoints. For efficiency of globally convergent homotopy methods, it is important to give an appropriate initial solution as a starting point. However, there are few studies concerning such initial solution algorithms. In this paper, initial solution problems in homotopy methods are discussed, and an effective initial solution algorithm is proposed for globally convergent homotopy methods, which finds DC operating points of transistor circuits efficiently. Numerical examples using practical transistor circuits show the effectiveness of the proposed algorithm.

In this paper, a novel Wold decomposition algorithm is proposed to address the issue of deterministic component extraction for texture images. This algorithm exploits the wavelet-based singularity detection theory to process both harmonic a nd evanescent features from frequency domain. This exploitation is based on the 2D Lebesgue decomposition theory. When applying multiresolution analysis techniq ue to the power spectrum density (PSD) of a regular homogeneous random field, its indeterministic component will be effectively smoothed, and its deterministic component will remain dominant at coarse scale. By means of propagating these positions to the finest scale, the deterministic component can be properly extracted. From experiment, the proposed algorithm can obtain results that satisfactorily ensure its robustness and efficiency.

In order to benefit from the advantages of soft handoff (SHO), it is important that the SHO parameters (the SHO thresholds; T_ADD and T_DROP are well assigned. T_ADD is the threshold used for triggering a pilot with high strength to be added to the Active Set (AS) list. The AS means the pilots associated with the forward traffic channels assigned to mobile station. In contrast, T_DROP is the threshold used for triggering a pilot with low strength to be dropped from the AS list. This paper analyzes the effects of varying SHO thresholds in a cellular code division multiple access (CDMA) system on the blocking probability based on traffic load and geometrical distances in hexagonal layout of base stations (BSs). In addition, the previously proposed traffic load equation is applied to the proposed SHO model for balancing the numbers of new and handoff calls on the forward link capacity in case of uniform traffic load. The results show that the blocking probability is more sensitive to T_DROP than to T_ADD variations.