This study involves implementing an intelligent controller using the fuzzy control algorithm to minimize cold weld and splash in inverter AC spot welding. This study presents an experimental curve of a welding output current and the maximum value of the Instantaneous Heating Rate (IHRmax) using the contact diameter of an electrode as the parameter. It also presents the experimental curve of a welding output current and the slope (S) of the instantaneous dynamic resistance using the instantaneous contact area of an electrode as the parameter. To minimize cold weld and splash, this study proposes an intelligent controller that controls the optimum welding current in real time by estimating the contact diameter of an electrode and the contact area of the initial welding part.

We present a novel high-speed transmitter consisting of a frequency modulated DBR laser and optical filters. The refractive index modulation in the phase control region of the DBR laser allows high-speed frequency modulation. The generated frequency modulated signal is converted to an intensity modulated signal using the edge of the optical filter pass band. We present theoretical simulations of high-speed modulation characteristics and extension of transmission reach. With the proposed transmitter, we review the experimental demonstration of 180-km transmission of a 10-Gb/s signal with a tuning range of 27 nm and 60-km transmission of a 20-Gb/s signal.

A compact (13.38.05.6 mm) 40 Gbit/s 1.55-µm electroabsorption (EA) modulator monolithically integrated distributed feedback (DFB) laser diode (EML) [1] module integrated with a driver IC has been developed. Its compactness was realized by employing a broadband feed-through and a bias tee which were accurately designed by 3-dimensional (3D) electromagnetic simulation. It was confirmed that the simulation results of the frequency response and the actual measurement results are corresponding well. Clear eye opening of the 40 Gbit/s optical output waveform of the fabricated EML module was observed. Degradation was not observed even when the 40 Gbit/s electrical signal was launched into the module via the flexible printed circuit (FPC).

We describe a co-channel interference rejection scheme that is suitable for QR-decomposition maximum likelihood detection (MLD) in multiple-input and multiple output (MIMO) systems. A pre-whitening matrix for interference rejection is decomposed into a triangular matrix and its Hermitian matrix by using a complex Gaxpy version of the Cholesky algorithm. The decomposed triangular matrix is used as a spatial pre-filter to whiten co-channel interference. Simulation results demonstrate that the proposed scheme can suppress co-channel interference streams at the cost of receive diversity order and achieves better transmission performance than QR-decomposition MLD itself in MIMO channels with co-channel interference.

In this letter a new analytical method is presented for estimating the timing jitter of CMOS ring oscillators due to power supply noise. Predictive jitter equation is presented, and the proposed method is utilized to study the jitter induced by power supply noise in an inverter-based ring oscillator, which is designed and simulated in SMIC 0.13-µm standard CMOS process. A comparison between the results obtained by the proposed method and those obtained by HSPICE simulation proves the accuracy of the predictive equation. Most of the errors between the theoretic calculation and simulation results are less than 3 ps.

Particle Swarm Optimization (PSO) is a search method which utilizes a set of agents that move through the search space to find the global minimum of an objective function. The trajectory of each particle is determined by a simple rule incorporating the current particle velocity and exploration histories of the particle and its neighbors. Since its introduction by Kennedy and Eberhart in 1995, PSO has attracted many researchers due to its search efficiency even for a high dimensional objective function with multiple local optima. The dynamics of PSO search has been investigated and numerous variants for improvements have been proposed. This paper reviews the progress of PSO research so far, and the recent achievements for application to large-scale optimization problems.

Searching mechanisms employed in unstructured overlay networks typically hit multiple peers for the desired content. We propose the use of a simple method that raises the hit rates of unpopular contents and balances the loads by choosing the peer holding the least contents as the provider when multiple candidates exist.

An antenna-permutation (AP) scheme is described for channel-vector quantization (CVQ) in zero-forcing beamforming (ZFBF) multiuser multiple-input and multiple-output orthogonal frequency-division multiplexing systems with multiple receive antennas. Different sets of multiple channel sub-matrices are selected for different subcarriers and then quantized to multiple quantization vectors for finite rate feedback. Based on the quantization vectors, ZFBF provides a single stream or multiple streams to users while increasing frequency selectivity. Simulation results demonstrate that AP-CVQ with four-bit quantization that incorporates with pre-whitening maximum likelihood detection for two stream reception achieved better average packet error rates than minimum mean square error receive beamforming for single stream reception when the frequency selectivity was not severe.

In this paper, the performance of multiuser MIMO E-SDM systems in downlink transmission is evaluated in both uncorrelated and correlated time-varying fading environments. In the ideal case, using the block diagonalization scheme, inter-user interference can be completely eliminated at each user; and using the E-SDM technique for each user, optimal resource allocation can be achieved, and spatially orthogonal substreams can be obtained. Therefore, a combination of the block diagonalization scheme and the E-SDM technique applied to multiuser MIMO systems gives very good results. In realistic environments, however, due to the dynamic nature of the channel and processing delay at both the transmitter and the receiver, the channel change during the delay may cause inter-user interference even if the BD scheme is used. In addition, the change may also result in large inter-substream interference and prevent optimal resource allocation from being achieved. As a result, system performance may be degraded seriously. To overcome the problem, we propose a method of channel extrapolation to compensate for the channel change. Applying our proposed method, simulation results show that much better system performance can be obtained than the conventional case. Moreover, it also shows that the system performance in the correlated fading environments is much dependent on the antenna configuration and the angle spread from the base station to scatterers.

The self-timed pipeline (STP) is one of the most promising VLSI/SoC architectures. It achieves efficient utilization of tens of billions of transistors, consumes ultra low power, and is easy-to-design because of its signal integrity and low electro-magnetic interference. These basic features of the STP have been proven by the development of self-timed data-driven multimedia processors, DDMP's. This paper proposes a novel scheme of interacting self-timed (clockless) pipelines by which the various distributed and interconnected pipelines can achieve highly functional stream processing in future giga-transistor chips. The paper also proposes a set of elementary coupling control modules that facilitate various combinations of flow-thru processing between pipelines, and then discusses the practicality of the proposed scheme through the LSI design of application modules such as a priority-based queue, a mutual interconnection network, and a pipelined sorter.

An improved iterative minimum mean-squared error (MMSE) channel estimation method is proposed for joint coding and precoding OFDM systems. Compared with the traditional simplified estimator, the proposed scheme provides higher estimation quality with slight complexity increment at low signal-to-noise ratio (SNR) values. The performance of the iterative receiver including the proposed estimator approaches that of the perfect MMSE estimator without any simplification.

In the present paper, we propose a novel cyber-attack detection model based on two multivariate-analysis methods to the audit data observed on a host machine. The statistical techniques used here are the well-known Hayashi's quantification method IV and cluster analysis method. We quantify the observed qualitative audit event sequence via the quantification method IV, and collect similar audit event sequence in the same groups based on the cluster analysis. It is shown in simulation experiments that our model can improve the cyber-attack detection accuracy in some realistic cases where both normal and attack activities are intermingled.

In this paper, first, we propose a new recursive algorithm for evaluating generalized multi-state k-out-of-n:F systems. This recursive algorithm can be applied to the systems even though the states of all components in the system are assumed to be non-i.i.d. random variables. Our algorithm is useful for any multi-state k-out-of-n:F system, including the decreasing, increasing and constant multi-state k-out-of-n:F system. Furthermore, our algorithm can evaluate the state distributions of the other non-monotonic multi-state k-out-of-n:F systems. Next, we calculate the order of computing time and memory capacity of the proposed algorithm. We perform numerical experiments in the non-i.i.d. case. The results show that the proposed algorithm is efficient for evaluating the system state distribution of multi-state k-out-of-n:F system when n is large and kl are small.

This paper considers a two-echelon repair model where several series systems comprising multiple items are operated in each base. We propose a basic model and two modified models. For two models, approximation methods are developed to derive the system availability. The difference between the basic model and the first modified model is whether the normal items in failed series systems are available as spare or not. The second modified model relaxes the assumptions of the first modified model to reflect more realistic situation. We perform numerical analysis for the models to compare their system availabilities and verify the accuracy of the approximation methods.

This paper proposes a dynamic capture-recapture (DCR) model to estimate not only the total number of software faults but also quantitative software reliability from observed data. Compared to conventional static capture-recapture (SCR) model and usual software reliability models (SRMs) in the past literature, the DCR model can handle dynamic behavior of software fault-detection processes and can evaluate quantitative software reliability based on capture-recapture sampling of software fault data. This is regarded as a unified modeling framework of SCR and SRM with the Bayesian estimation. Simulation experiments under some plausible testing scenarios show that our models are superior to SCR and SRMs in terms of estimation accuracy.

To attain good performance in an acoustic echo cancellation system, it is important to have a variable step size (VSS) algorithm as part of an adaptive filter. In this paper, we are concerned with the development of a VSS algorithm for a recently proposed subband affine projection (SAP) adaptive filter. Two popular VSS algorithms in the literature are the methods of delayed coefficients (DC) and variable regularization (VR). However, the merits and demerits of them are mutually exclusive. We propose a VSS algorithm that is a hybrid of both methods and combines their advantages. An extensive study of the new algorithm in different scenarios like the presence double-talk (DT) during the transient phase of the adaptive filter, DT during steady state, and varying DT power is conducted and reasoning is given to support the observed behavior. The importance of the method of VR as part of a VSS algorithm is emphasized.

We observe a natural generalisation of the ate and twisted ate pairings, which allow for performance improvements in non standard applications of pairings to cryptography like composite group orders. We also give a performance comparison of our pairings and the Tate, ate and twisted ate pairings for certain polynomial families based on operation count estimations and on an implementation, showing that our pairings can achieve a speedup of a factor of up to two over the other pairings.

One major drawback of orthogonal frequency-division multiplexing is the high peak-to-average power ratio (PAPR) of the output signal. The selected mapping (SLM) and partial transmit sequences (PTS) methods are two promising techniques for PAPR reduction. However, to generate a set of candidate signals, these techniques need a bank of inverse fast Fourier transforms (IFFT's) and thus require high computational complexity. In this paper, we propose two low-complexity multiplication-free conversion processes to replace the IFFT's in the SLM method, where each conversion process for an N-point IFFT involves only 3N complex additions. Using these proposed conversions, we develop several new SLM schemes and a combined SLM & PTS method, in which at least half of the IFFT blocks are reduced. Computer simulation results show that, compared to the conventional methods, these new schemes have approximately the same PAPR reduction performance under the same number of candidate signals for transmission selection.

Hybrid automatic repeat request (HARQ) is employed for the Evolved Universal Terrestrial Radio Access (E-UTRA) downlink. Each user equipment (UE) sends its ACK/NACK corresponding to the downlink data reception to the base station via a physical uplink control channel (PUCCH). The ACK/NACK signals from the UE are first code spread by the cyclic shift (CS) sequences, and then code spread again by the orthogonal cover (OC) sequences. The ACK/NACK signals from each UE are multiplexed by means of code division multiple access (CDMA), however, it is difficult for the conventional PUCCH code design to satisfy the required bit error rate (BER) of 10-3 [1] in fast-fading environments because of inter-code interference (ICI) among the OC sequences. Therefore, resource management of PUCCH is required depending on the mobility of the UEs to maximize the performance of the ACK/NACK signals and the capacity of PUCCH simultaneously. In this paper, we propose a novel code design for PUCCH, which can suppress the effects of ICI among the OC sequences, and thus can simplify the resource management of PUCCH. The simulation evaluations confirm that the proposed code design can significantly improve the performance of the ACK/NACK signals via PUCCH in fast-fading environments, and any complicated resource management based on the mobility of the UEs are not necessary.

Threshold-based ordered successive interference cancellation (OSIC) detection algorithm is proposed for per-antenna-coded (PAC) two-input multiple-output (TIMO) orthogonal frequency division multiplexing (OFDM) systems. Successive interference cancellation (SIC) is performed selectively according to channel conditions. Compared with the conventional OSIC algorithm, the proposed algorithm reduces the complexity significantly with only a slight performance degradation.