A new fuzzy logic-based buffer management scheme (BMS) called fuzzy early detection (FED) is presented to improve transmission control protocol (TCP) performance over the unspecified bit rate (UBR) service of asynchronous transfer mode (ATM) networks. FED uses early congestion detection and selective packet discard (ECD/SPD) strategies to achieve its design goals, and adopts early packet discard (EPD) to prevent frequent buffer overflows. Two variants of FED are constructed for comparison purposes. FED performance is then evaluated against those of its variants, pure EPD and P-random early detection (P-RED) through various simulations. The effects of TCP implementation, TCP maximum segment size (MSS), network's propagation delay (PD) and switch buffer size (SBS) on their performances are studied. The overall result shows that FED is superior to the other BMSs when the criteria of efficiency, fairness, scalability and switch buffer requirement are considered collectively.

In this paper, we propose an algorithm that automatically generates the intermediate scenes using the bidirectional disparity morphing (BDM) from the parallel stereo images. The two-step search strategy is used for speeding up the computation of the bidirectional disparity map and three occluding patterns are used for smoothing the computed disparities more elaborately. Using the bidirectional disparity map, we interpolate the left and the right image to their intermediate scenes. Then we dissolve two interpolated images into the desired intermediate scene which the holes are removed and the effect of the disparity estimation errors is minimized. We implemented the proposed algorithm on TM1300 supported by TriMedia using pSOSytem which enables to do multiprocessing. As a result, we can interpolate the high-quality intermediate scenes with real-time process.

A simple configuration for millimeter-wave fiber-wireless transmission, with remote local-oscillator (LO) delivery from the central office, both for the uplink and for the downlink, and a simple, cost-effective, base-station solution is proposed. Under the assumption of using commercially available components and a conventional single-mode fiber (with dispersion of 17 ps/nm/km at 1.55 µm), our numerical results show that, with a laser linewidth of 150 MHz, a laser power of 0 dBm and an optical gain of only 6 dB, it is possible to transmit, without repeaters, data rates of 622 Mbit/s across about 18 km at a bit-error-rate of 10-9. By increasing the optical gain to 24 dB, the link length can be increased to approximately 67 km for a laser linewidth of 75 MHz and to 78 km for a laser linewidth 1 MHz.

This paper presents the analysis of the impedance characteristics of a sectoral cylindrical cavity-backed axial slot antenna excited by a probe. The integral equations are derived based on boundary conditions of the proposed structure and they are expressed in terms of dyadic Green functions and unknown current densities. The dyadic Green functions are obtained by using the eigenfunction expansion method together with application of scattering superposition techniques. The unknown current densities are solved by the Method of Moments. The input impedance is subsequently determined from the unknown electric current density at the probe. Numerical results of input impedance and return loss are demonstrated as functions of frequency for various parameters such as cavity length, cavity radius ratio, slot location in φ direction, slot length and probe length. Calculated results are validated by the measurements. At the operating frequency, it is found that the result is sufficiently accurate. The results from this study are very useful for the design of a sectoral cylindrical cavity-backed axial slot array antenna excited by a probe with omnidirectional beam radiation.

In this paper, we propose a new multistage (iterative) structure where Kalman channel estimation and parallel interference cancellation multiuser detection are conducted in every stage (iteration). The proposed scheme avoids the complexity of the decorrelator in front of Kalman channel estimator, and has better performance than the previous scheme.

This paper introduces a design for testability (DFT) scheme for delay faults of a controller-data path circuit. The scheme makes use of both scan and non-scan techniques. First, the data path is transformed into a hierarchically two-pattern testable (HTPT) data path based on a non-scan approach. Then an enhanced scan (ES) chain is inserted on the control lines and the status lines. The ES chain is extended via the state register of the controller. If necessary, the data path is further modified. Then a test controller is designed and integrated to the circuit. Our approach is mostly based on path delay fault model. However the multiplexer (MUX) select lines and register load lines are tested as register transfer level (RTL) segments. For a given circuit, the area overhead incurred by our scheme decreases substantially with the increase in bit-width of the data path of the circuit. The proposed scheme supports hierarchical test generation and can achieve fault coverage similar to that of the ES approach.

A linear-in-dB VGA of the current-divider type is fabricated in 0.25 µm CMOS technology. Two gain compensation techniques are proposed in order to compensate the gain deviations due to a MOSFET which has a square-law characteristic or an exponential-law characteristic determined by its current density. Temperature compensation techniques are also proposed. Measure results obtained at 380 MHz are a gain range of 80 dB, a gain error of 3 dB, and an NF of 11 dB.

The interconnection problem of binary circuits becomes seriously as the exponential growth of the circuits complexity has been driven by a combination of down scaling of the device size and up scaling of the chip size. Motivated by the problem, there is much research of circuits based on multiple-valued logic. On the other hand, caused by the signal propagation delay, there exist hazards in binary logic circuits. To analyze hazards in binary logic circuits, many multiple-valued logics have been proposed, and studied on their mathematical properties. The paper will discuss on a multiple-valued logic which is suitable for treating static hazards in multiple-valued logic circuits. Then, the paper will show that the prime implicants expressions of r-valued logic functions realize static hazards free r-valued logic circuits.

A field trial, within a suburban macro-cell environment, of a space-time (ST) equalizer for TDMA mobile communication systems is described. The ST equalizer was a cascade connection of two array processors for a four-antenna array and a two-branch-metric-combining maximum-likelihood sequence estimation (MLSE) that was designed to obtain full space- and path-diversity gains from first-arrival and one-symbol-delayed signals while suppressing excessively long-delayed inter-symbol interference (ISI). The radio frequency was 3.35 GHz, the transmission rate was 4.096 Mb/s, and the modulation was QPSK. The long-delayed ISI reduction and the space-path diversity effect of the ST equalizer was validated by Eb/N0 vs. bit-error-rate (BER) curves with respect to delay spread and antenna spacing as compared with the case of an array processor alone being used.

An efficient performance enhancement scheme using the rotation of signal subspace (RSS) and Toeplitz matrix approximation (TMA) methods to enhance the performance of an adaptive antenna array in DS/CDMA systems is proposed. The basis of RSS is to find a transformation matrix in order to recover the desired complex array covariance matrix from a sampled complex array covariance matrix which is contaminated by an interference-plus-noise component. Also, the objective of TMA is to change the output matrix of RSS into a matrix having the theoretical properties such as Toeplitz structure matrix or a positive semidefinite matrix. Consequently, the proposed scheme using RSS and TMA methods can greatly improve the performance of an adaptive antenna array by reducing the interference-plus-noise effect from the sampled complex array covariance matrix of the pre-correlation received signal vector that is used to calculate a weight vector of an adaptive antenna array. Simulation results demonstrate the effectiveness of the proposed scheme.

The equidistortion principle[1] has recently been proposed as a basic principle for design of an optimal vector quantization (VQ) codebook. The equidistortion principle adjusts all codebook vectors such that they have the same contribution to quantization error. This paper introduces a novel VQ codebook design algorithm based on the equidistortion principle. The proposed algorithm is a variant of the law-of-the-jungle algorithm (LOJ), which duplicates useful codebook vectors and removes useless vectors. Due to the LOJ mechanism, the proposed algorithm can establish the equidistortion condition without wasting learning steps. This is significantly effective in preventing performance degradation caused when initial states of codebook vectors are improper to find an optimal codebook. Therefore, even in the case of improper initialization, the proposed algorithm can achieve minimization of quantization error based on the equidistortion principle. Performance of the proposed algorithm is discussed through experimental results.

In this paper, we present a novel approach for efficient search of high-dimensional databases, such as video shots. The idea is to map feature vectors from the high-dimensional feature space into a point in a low-dimensional distance space. Then, a spatial access method, such as an R-tree, is used to cluster these points based on their distances in the low-dimensional space. Our mapping method, called topological mapping, guarantees no false dismissals in the result of a query. However, the result of a query might contain some false alarms. Hence, two refinement steps are performed to remove these false alarms. Comparative experiments on a database of video shots show the superior efficiency of the topological mapping method over other known methods.

Load balancing among multiple mirror servers located at distributed positions in the network is a key technique for content delivery services. For bandwidth allocated services, we consider how to select a suitable server from several candidates containing the same content at the time of a request. We propose limiting the candidates in advance and selecting a server from the limited set of servers in a round-robin fashion. The server sets that minimize the variance of the link load are derived using a greedy method for a given network topology and service demand. Through numerical evaluation, we demonstrate that the proposed method is superior to previous methods.

Adaptive Battery Conservation Management (ABCM), an effective form of power conservation for mobile terminals in an always-connected environment, was proposed and evaluated in a previous published work. The ABCM method employs three states: active, dormant, and the Battery Saving Mode (BSM). The BSM is defined as a battery-saving state; in the BSM, the mobile terminal saves power by intermittently receiving paging notifications via a paging channel between the packet bursts of a session. Two control parameters, the sleep-timer and paging interval, are set up according to packet class and are the keys to the performance of a system with this method. In real-time communications, a long sleep-timer and short paging interval are selected to minimize buffering delay. In non-real-time communications, on the other hand, a short sleep-timer and long paging interval are chosen to reduce power consumption by the mobile terminal. Our previous evaluation showed that the method is effective as a means for power conservation in non-real-time communications. In real-time communications, on the other hand, the ABCM method provides shorter buffering delays and the same battery-conservation performance as the conventional method. To further improve the ABCM method's performance, we now propose an enhanced ABCM method that employs multiple BSM sub-modes, each of which has a different paging interval. As dormant periods become longer, the mobile terminal makes transition to successive sub-modes, each of which has a longer interval than the previous one. In this paper, we evaluate the battery conservation effect of the ABCM method through theoretical analysis and computer simulation. Numerical evaluation indicates that the ABCM method will be suitable for the broadband multimedia packet-radio systems of the future.

In this paper, to enhance the power efficiency a new simple space-time coding scheme is devised with application to the OFDM based Wireless LAN system. The basic idea is from the receiver's point of view and is referred to as Virtual Constellation Mapping (VCM). We designed a new combination of the channel coding (Turbo Code) along with multiple transmit antennas (Two antennas) to achieve transmit diversity and space division multiplexing transmission. Computer simulation results showed that with the same transmission data rate, our proposed scheme can achieve better bit error rate (BER) compared with the conventional space-time trellis coded OFDM scheme in high Doppler fading channels.

This paper describes an analysis of the electromagnetic interference (EMI) aspects of electrostatic discharge (ESD), which sometimes causes serious damage to electrical systems. To classify EMI-related properties resulting from ESD events, we used a self-organizing neural network, which can map high-dimensional data into simple geometric relationships on a low-dimensional display. Also, to clarify the effect of a high-speed moving discharge, we generated one-shot discharges repeatedly and measured the ESD current in the time domain to obtain its EMI-related characteristics of this phenomenon. Based on the measured data, we examined several differential properties of ESD waveforms including the maximum amplitude and energy level, and analyzed these multi-dimensional data using the self-organizing neural network scheme. The results showed that the high-speed moving discharges can increase the maximum amplitude, relative energy, and entropy of ESD events, and that the positioning of the EMI level of each ESD event can be effectively visualized in a two-dimensional space.

It is well known that Orthogonal Frequency Division Multiplexing (OFDM) scheme is robust to frequency selective fading in wireless channels. However, once delayed signals beyond a guard interval of an OFDM symbol are introduced in a channel with large delay spread, inter-symbol interference causes a severe degradation in the transmission performance. In this paper, we propose a novel pre-Fast Fourier Transform (FFT) OFDM adaptive antenna array, which requires only one FFT processor at a receiver, for suppressing such delayed signals. We analytically derive the optimum weights for the beamformer based on the Maximum Signal-to-Noise-and-Interference power Ratio (SNIR) and the Minimum Mean Square Error (MMSE) criteria, respectively. Computer simulation results show its good performance even in a channel where Directions of Arrival (DoAs) of arriving waves are randomly determined.

We investigate the design of an interpolation filter of a multi-frequency time division multiple access (MF-TDMA) demodulator which is applied to digital video broadcasting-return channel system via satellite (DVB-RCS). We propose two interpolation filters for symbol timing recovery in a digital receiver where the input analog to digital conversion sampling clock is not synchronized to the transmitter symbol clock. The two proposed interpolation filters are designed by the least mean-square-error at the output of the receiver. Simulation results show that a performance improvement is achieved by employing the proposed interpolation filter.

This letter introduces a chaotic circuit consisting of one linear 2-port VCCS, one hysteresis 2-port VCCS, and two capacitors. The circuit has double screw attractors, quad screw attractors and co-existence states of them. Since the system is piecewise linear, attractors existence condition can be described using exact piecewise solutions. Using a simple test circuit, typical phenomena are verified in the laboratory.

Gnutella's service announcement in March 2000 stirred worldwide interest by referring to P2P model. Basically, the P2P model needs not the broker "the centralized management server" that until now has figured so importantly in prevailing business models, and offers a new approach that enables peers such as end terminals to discover out and locate other suitable peers on their own without going through an intermediary server. It seems clear that the wealth of content made available by peer-to-peer systems like Gnutella and Freenet have spurred many authors into considering how meta-data might be used to support more effective search in a distributed environment. This paper has reviewed a number of these systems and attempted to identify some common themes. At this time the major division between the different approaches is the use of a hash-based routing scheme.