Because of the fact that mobile communication channel changes by time, it is necessary to employ adaptive channel equalizers in order to combat the distorting effects of the channel. Least Mean Squares (LMS) algorithm is one of the most popular channel equalization algorithms and is preferred over other algorithms such as the Recursive Least Squares (RLS) and Maximum Likelihood Sequence Estimation (MLSE) when simplicity is the dominant decision factor. However, LMS algorithm suffers from poor performance and convergence speed within the training period specified by most of the standards. The aim of this study is to improve the convergence speed and performance of the LMS algorithm by adjusting the step size using fuzzy logic. The proposed method is compared with the Channel Matched Filter-Decision Feedback Equalizer (CMF-DFE) [1] which provides multi path propagation diversity by collecting the energy in the channel, Minimum Mean Square Error-Decision Feedback Equalizer (MMSE-DFE) [2] which is one of the most successful equalizers for the data packet transmission, normalized LMS-DFE (N-LMS-DFE) [3] , variable step size (VSS) LMS-DFE [4] , fuzzy LMS-DFE [5],[6] and RLS-DFE [7] . The obtained simulation results using HIPERLAN/1 standards have demonstrated that the proposed LMS-DFE algorithm based on fuzzy logic has considerably better performance than others.

A class of zero-correlation zone (ZCZ) sequences constructed by the recursive procedure from a perfect sequence and a unitary matrix was proposed by Torii, Nakamura, and Suehiro [1] . In the reference [1] , three parameters, s.t., the sequence length, the family size and the length of the ZCZ, were evaluated for a general estimate of the performance of the ZCZ sequences. In this letter, we give more detailed distributions of that correlation values are zero on their ZCZ sequence sets.

We propose an architecture of Intrusion Detection System (IDS) for VoIP using a protocol specification-based detection method to monitor the network traffics and alert administrator for further analysis of and response to suspicious activities. The protocol behaviors and their interactions are described by state machines. Traffic that behaves differently from the standard specifications are considered to be suspicious. The IDS has been implemented and simulated using OPNET Modeler, and verified to detect attacks. It was found that our system can detect typical attacks within a reasonable amount of delay time.

An alternative polynomial expansion for electromagnetic field estimation inside three-dimensional dielectric scatterers is presented in this article. In a continuation with the previous work of authors, the Tensor-Volume Integral Equation (TVIE) is solved by using the Galerkin-based moment method (MoM) consisting of a combination of entire-domain and sub-domain basis functions including three-dimensional polynomials. Instead of using trivial power polynomials, Legendre polynomials are adopted for electromagnetic fields expansion in this study. They have the advantage of being a set of orthogonal functions, which allows the use of high-order basis functions without introducing an ill-condition MoM matrix. The accuracy of such approach in MoM is verified by comparing its numerical results with that of exact analytical method such as Mie theory and conventional procedures in MoM. Besides, it is also confirmed that the condition number of the MoM matrix obtained with the proposed approach is lower than that of the previous approaches.

In this paper, we propose to adapt both the modulation scheme and the transmit power in the frequency domain using a heuristic evaluation of the bit error rate (BER) for each subcarrier. The proposed method consists in ordering in terms of fading impact, grouping a certain number of subcarriers and performing local power adaptation in each subcarrier group. The subcarrier grouping is performed in order to equalize the average channel condition of each subcarrier group. Grouping and local power adaptation allow us to take advantage of the channel variations and to reduce the computational complexity of the proposed power distribution scheme, while avoiding the performance degradation due to the suboptimum power adaptation as much as possible. Compared to the conventional power distribution methods, the proposed scheme does not require any iterative process and the power adaptation is directly performed using an analytical formula. Simulations show a gain in terms of BER performance compared to equal power distribution and existing algorithms for power distribution. In addition, due to the subcarrier group specificity, the trade-off between the computational complexity and the performance can be controlled by adjusting the size of the subcarrier groups. Simulation results show significant improvement of BER performance compared to equal power allocation.

In this letter, we suggest a simple way of implementing a post-FFT pilot-assisted sampling frequency offset and residual frequency offset estimator with reduced complexity in an orthogonal frequency division multiplexing (OFDM) system. In order to devise the low-complexity post-FFT frequency estimator, some modifications on the conventional estimator are highlighted with an emphasis on the selection of pilot subset.

Physical defects that are not covered by stuck-at fault or bridging fault model are increasing in LSI circuits designed and manufactured in modern Deep Sub-Micron (DSM) technologies. Therefore, it is necessary to target non-stuck-at and non-bridging faults. A stuck-open is one such fault model that captures transistor level defects. This paper presents two methods for maximizing stuck-open fault coverage using stuck-at test vectors. In this paper we assume that a test set to detect stuck-at faults is given and we consider two formulations for maximizing stuck-open coverage using the given test set as follows. The first problem is to form a test sequence by using each test vector multiple times, if needed, as long as the stuck-open coverage is increased. In this case the target is to make the resultant test sequence as short as possible under the constraint that the maximum stuck-open coverage is achieved using the given test set. The second problem is to form a test sequence by using each test vector exactly once only. Thus in this case the length of the test sequence is maintained as the number of given test vectors. In both formulations the stuck-at fault coverage does not change. The effectiveness of the proposed methods is established by experimental results for benchmark circuits.

In a grid computing environment, the network characteristics such as bandwidth and latency affect the task performance. The demands for bandwidth of wide-area networks become large and it reaches more than 100 Gbps. In this article, we focus on parallel routes transmission, such as link aggregation, to realize large bandwidth network. The performance of grid computing with parallel routes transmission is evaluated on the emulated wide-area network.

In this paper, we propose a computationally efficient method to solve the large dimension Adaptive Subcarrier Assignment and Bit Allocation (ASABA) problem of multiuser orthogonal frequency division multiplexing system. Our algorithm consists of three Ordinal Optimization (OO) stages to find a good enough solution to the considered problem. First of all, we reformulate the considered problem to separate it into subcarrier assignment and bit allocation problem such that the objective function of a feasible subcarrier assignment pattern is the corresponding optimal bit allocation for minimizing the total consumed power. Then in the first stage, we develop an approximate objective function to evaluate the performance of a subcarrier assignment pattern and use a genetic algorithm to search through the huge solution space and select s best subcarrier assignment patterns based on the approximate objective values. In the second stage, we employ an off-line trained artificial neural network to estimate the objective values of the s subcarrier assignment patterns obtained in stage 1 and select the l best patterns. In the third stage, we use the exact objective function to evaluate the l subcarrier assignment patterns obtained in stage 2, and the best one associated with the corresponding optimal bit allocation is the good enough solution that we seek. We apply our algorithm to numerous cases of large-dimension ASABA problems and compare the results with those obtained by four existing algorithms. The test results show that our algorithm is the best in both aspects of solution quality and computational efficiency.

This paper presents a memory-efficient motion estimation (ME) technique for high-resolution video compression. The main objective is to reduce the external memory access, especially for limited local memory resource. The reduction of memory access can successfully save the notorious power consumption. The key to reduce the memory accesses is based on center-biased algorithm in that the center-biased algorithm performs the motion vector (MV) searching with the minimum search data. While considering the data reusability, the proposed dual-search-windowing (DSW) approaches use the secondary windowing as an option per searching necessity. By doing so, the loading of search windows can be alleviated and hence reduce the required external memory bandwidth. The proposed techniques can save up to 81% of external memory bandwidth and require only 135 MBytes/sec, while the quality degradation is less than 0.2 dB for 720 p HDTV clips coded at 8 Mbits/sec.

In UMTS (universal mobile telecommunications system) networks upgraded with HSPA (high speed packet access) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files quickly is essential for mobile users in file sharing applications, mainly because they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called AFAM -- Adaptive efficient File shAring for uMts networks. AFAM can decrease the dissemination time by efficiently utilizing the upload-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node's concurrent uploads, which causes the count of the node's concurrent uploads to lower while ensuring that the node's upload-bandwidth can be efficiently utilized. AFAM also uses URF -- Upload Rarest First policy for the block selection and receiver selection, which achieves real rarest-first for the spread of blocks and effectively avoids the "last-block" problem in file sharing applications. Our simulations show that, AFAM achieves much less dissemination time than other protocols including BulletPrime and a direct implementation of BitTorrent for mobile environments.

We propose frequency shifted optical single sideband (OSSB), a novel OSSB modulation scheme. It uses a continuous wave to up-convert the source signal, and the signal and the continuous wave then undergo suppressed carrier OSSB modulation simultaneously. This scheme inherently has no unwanted sidebands, even if the suppressed carrier OSSB modulator is defective. Experiments of 12 GHz RF signal transmission confirm that it achieves 2.4 dB relaxation in chromatic dispersion power fading under the condition of 15 dB SSR.

The generalized Hamming weight played an important role in coding theory. In the study of the wiretap channel of type II, the generalized Hamming weight was extended to a two-code format. Two equivalent concepts of the generalized Hamming weight hierarchy and its two-code format, are the inverse dimension/length profile (IDLP) and the inverse relative dimension/length profile (IRDLP), respectively. In this paper, the Singleton upper bound on the IRDLP is improved by using a quotient subcode set and a subset with respect to a generator matrix, respectively. If these new upper bounds on the IRDLP are achieved, in the corresponding coordinated two-party wire-tap channel of type II, the adversary cannot learn more from the illegitimate party.

In wireless sensor networks (WSNs), localization using the received signal strength (RSS) method is famous for easy adaptation and low cost where measuring the distance between sensor nodes. However, in real localization systems, the RSS is strongly affected by many surrounding factors and tends to be unstable, so that it degrades accuracy in distance measurement. In this paper, we propose the angle-referred calibration based RSS method where angle relation between sensor nodes is used to perform the calibration for better performance in distance measurement. As a result, the proposed scheme shows that it can provide high precision.

The thermal gain variation of a high-power amplifier (HPA) module for a wide-band code division multiple access (W-CDMA) system application was reduced to within 1 dB by applying a thermistor to compensate the gain variation. Two techniques for gain variation compensation with respect to temperature were investigated: base bias control according to temperature, and use of a thermistor in a matching network. Experimental comparison of two techniques indicated that the thermistor-based technique was more effective in reducing the gain variation without affecting linearity. A fabricated two-stage HPA module with a thermistor in its input matching network achieved a small gain variation within 1 dB and 5 MHz offset adjacent channel leakage power ratio (first ACLR) below -36 dBc over the temperature range from -10 to +85C, where the first ACLR was measured under a load-mismatched condition with a voltage standing wave ratio (VSWR) of 1.4:1.

This letter presents a novel approach for traffic light detection in a video frame captured by an in-vehicle camera. The algorithm consists of rotated principal component analysis (RPCA), modified amplitude thresholding with respect to the histograms of the PC planes and final filtering with a neural network. The proposed algorithm achieves an average detection rate of 96% and is very robust to variations in the image quality.

We did an experimental study to investigate the effect of the thermal stress due to the heater for adjusting adaptive flying height (AFH) on the readability and instability of tunneling magnetoresistance (TMR) sensors. The slider head consists of a small heater nearby the read/write elements for controlling the clearance between the read/write elements and the recording medium of the magnetic recording system. It is firstly reported that the thermal stress from the AFH heater induces instabilities and caused head degradation. The thermal stress degrades the reader performance by inducing voltage fluctuations and large noise spikes that causes the magnetic recording system having poor bit error rate (BER). The open loop of the transfer curve indicates that the flipping of a synthetic antiferromagnet (SAF) edge magnetization causes these instabilities. The thermal stress reduces the exchange bias field and the energy barrier to flop the SAF edge magnetization. The dispersion and thermal stability of the antiferromagnetic (AFM) layer are the potential root causes of these SAF instabilities because the larger AFM dispersion in these heads gives less net stabilizing field to SAF layers that lowers the energy barrier to flop the SAF edge magnetization. Scanning electron microscope (SEM) images of these weak heads show rough surface and scratches close to the sensor element. The mechanical stress due to these scratches may additionally impact to the stabilizing field of the SAF.

Block-based SSTA analyzes the timing variation of a chip caused by process variations effectively. However, block-based SSTA cannot identify critical nodes, nodes that highly influence the timing yield of a chip, used as the effective guidance of timing yield optimization. In this paper, we propose a new timing criticality to identify those nodes, referred to as the timing yield criticality (TYC). The proposed TYC is defined as the change in the timing yield, which is induced by the change in the mean arrival time at a node. For efficiency, we estimate the TYC through linear approximation instead of propagating the changed arrival time at a node to its fanouts. In experiments using the ISCAS 85 benchmark circuits, the proposed method estimated TYCs with the expense of 9.8% of the runtime for the exact computation. The proposed method identified the node that gives the greatest effect on the timing yield in all benchmark circuits, except C6288, while existing methods did not identify that for any circuit. In addition, the proposed method identified 98.4% of the critical nodes in the top 1% in the effect on the timing yield, while existing methods identified only about 10%.

Attenuated total reflection (ATR) property utilizing surface plasmon (SP) excitation was investigated for BK-7 prism/MgF2/Ag film/fluorescent organic dye film structure. In the structure, it is expected that SPs are excited at MgF2/Ag and Ag/dye film interfaces by Otto and Kretschmann configurations, respectively. In the experimental ATR curve, reflection dips for the SP excitations at the interfaces could be detected. Furthermore, SP emission lights were observed by irradiation of Ar ion laser beam from the dye film side. The SP emission light curve with two peaks was observed and it was also considered that the peaks corresponded to the SP excitation of Otto and Kretschmann configurations. The SP emission light spectra indicated the excited fluorescent dyes induced the SP emission lights. Intense emission light of Otto configuration was observed in this sample.

In this paper, we propose an extension to GridFTP that optimizes its performance by dynamically adjusting the number of parallel TCP connections. GridFTP has been used as a data transfer protocol to effectively transfer a large volume of data in Grid computing. GridFTP supports a feature called parallel data transfer that improves throughput by establishing multiple TCP connections in parallel. However, for achieving high GridFTP throughput, the number of TCP connections should be optimized based on the network status. In this paper, we propose an automatic parallelism tuning mechanism called GridFTP-APT (GridFTP with Automatic Parallelism Tuning) that adjusts the number of parallel TCP connections according to information available to the Grid middleware. Through simulations, we demonstrate that GridFTP-APT significantly improves the performance of GridFTP in various network environments.