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.

A single-carrier multiple-input multiple-output (MIMO) system with frequency-selective channels suffers from the inter-symbol interference (ISI) and the co-channel interference (CCI). To eliminate both type of interference, we propose in this letter a hybrid two-stage decision-feedback equalizer (HTS-DFE), which performs the frequency-domain equalization (FDE) in the first stage and the layered serial interference-cancellation (SIC) in the second stage. Since the decision-feedback (DF) or noise-prediction (NP) architecture can be employed in FDE or SIC, the proposed equalizer actually can have four variations that achieve the same mean square error (MSE) under the assumption of perfect feedback. Further, we combine HTS-DFE with the decoded decision-feedback (DDF) scheme to mitigate the error-propagation encountered in the practice. Simulation results confirm that the proposed HTS-DFE can outperform the existing equalizers significantly.

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.

We have a job with N tandem tasks each of which is executed successively until it is completed. A double modular system of error detection for the processing of each task is adopted. Either type of checkpoints such as compare-checkpoint or compare-and-store-checkpoint can be placed at the end of tasks. Three schemes for the above process of a job are considered and the mean execution time of each scheme is obtained. Three schemes are compared and the best scheme is determined numerically. As an example, a job with 4 tasks is given and 6 types of schemes are compared numerically. Finally, we consider a majority decision system as an error masking system and compute the mean execution time for three schemes.

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.

This letter deals with robust interference suppression based on eigenanalysis interference canceller (EIC) with the joint code-aid and noise subspace-based correcting approach. It has been shown that the EIC is very sensitive to pointing error, especially when the interference number is overestimated. Based on the corrected steering angle, a proper blocking matrix of the EIC can be obtained to suppress the leakage of desired signal. Therefore, desired signal cancellation does not occur; even if the interference number is overestimated in constructing the interference subspace. Several computer simulations are provided to demonstrate the effectiveness of the proposed approach.

In direct-conversion orthogonal frequency division multiplexing (OFDM) receivers, the impact of frequency-dependent I/Q mismatch (IQ-M) with carrier frequency offset (CFO) must be considered. A preamble-assisted estimation is developed to circumvent the frequency-dependent IQ-M with CFO. The results of a simulation and an experiment show that the proposed method could provide good estimation efficiency and enhance the system performance. Moreover, the proposed scheme is compatible with current wireless local area network standards.

The situations where several population parameters need to be estimated simultaneously arise frequently in wide areas of applications, including reliability modeling, survival analysis and biological study. In this paper, we propose Bayesian methods of estimation of the ordered parameters of the two exponential populations, which incorporate the prior information about the simple order restriction, but sometimes breaks the order restriction. A simulation study shows that the proposed estimators are more efficient (in terms of mean square errors) than the isotonic regression of the maximum likelihood estimators with equal weights. An illustrative example is finally presented.

We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning direction for all the scanlines.

Kalman filters are effective channel estimators but they have the drawback of having heavy calculations when filtering needs to be done in each sample for a large number of subcarriers. In our paper we obtain the steady-state Kalman gain to estimate the channel state by utilizing the characteristics of pilot subcarriers in OFDM, and thus a larger portion of the calculation burden can be eliminated. Steady-state value is calculated by transforming the vector Kalman filtering in to scalar domain by exploiting the filter charactertics when pilot subcarriers are used for channel estimation. Kalman filters operate optimally in the steady-state condition. Therefore by avoiding the convergence period of the Kalman gain, the proposed scheme is able to perform better than the conventional method. Also, driving noise variance of the channel is difficult to obtain practical situations and accurate knowledge is important for the proper operation of the Kalman filter. Therefore, we extend our scheme to operate in the absence of the knowledge of driving noise variance by utilizing received Signal-to-Noise Ratio (SNR). Simulation results show considerable estimator performance gain can be obtained compared to the conventional Kalman filter.

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.

This paper presents a grouped scan slice encoding technique using scan slice repetition to simultaneously reduce test data volume and test application time. Using this method, many scan slices that would be incompatible with the conventional selective scan slice method can be encoded as compatible scan slices. Experiments were performed with ISCAS'89 and ITC'99 benchmark circuits, and results show the effectiveness of the proposed method.

In this paper the time-domain analysis of two parallel traces is investigated. First, the telegrapher's equations for transmission line are applied to the parallel traces on printed circuit board (PCB), and are solved by using the mode decomposition technique. The time-domain solutions are then obtained by using the inverse Laplace transform. Although the Fourier-transform technique is also applicable for this problem, the solution is given numerically. Contrarily, the inverse Laplace transform successfully leads to an analytical expression for the transmission characteristics. The analytical expression is represented by series, which clearly explains the coupling mechanism. The analytical expression for the fundamental section of a meander delay line is investigated in detail. The analytical solution is validated by measurements, and the characteristics of the distortions in the output waveforms of meander delay lines due to the crosstalk are also investigated.

Distributed video coding (DVC) technology has been considered to be capable of reducing the processing complexity of the encoder immensely, while majority of the computational overheads are taken over by the decoder. In the common DVC framework, the pictures are decoded using the Wyner-Ziv encoded bit stream received from the encoder and the side information estimated using previously decoded information. As a result, accuracy of the side information estimation is very critical in improving the coding efficiency. In this paper we propose a novel side information refinement technique for DVC using multiple side information streams and sequential motion compensation with luminance and chrominance information involving iterative fusion of parallel information streams. In the bit plane wise coding architecture, previously decoded higher order bit planes are incrementally used to perform the motion estimation jointly in luminance and chrominance spaces to estimate multiple redundant bit streams for iterative fusion to produce more improved side information for subsequent bit planes. Simulation results show significant objective quality gain can be achieved at the same bit rate by utilizing the proposed refinement algorithms.

This paper presents a system architecture for sensor signal digitization utilizing a band-pass sigma-delta modulator (BP ΣΔM). The first version of the proposed system architecture was implemented in 5 V 0.7 µm CMOS technology. The proposed system architecture is useful for our capacitive pressure sensor measurement. The paper describes the possibilities of using the proposed enhanced system architecture in impedance spectroscopy and in capacitive pressure sensor measurement. The BP ΣΔM is well suited for wireless applications. This paper shows another way how to use its advantages.

A new H.264 fast inter-mode decision algorithm based on coded block patterns is presented. Compared to the exhaustive mode search, the proposed method achieves an average 57 % reduction in computation time with negligible degradation in visual quality. The speed and rate-distortion performance is comparable to known fast algorithms that involve more elaborate mechanisms.

In this paper, we solve the call admission control (CAC) and routing problem in an integrated network that handles several classes of calls of different values and with different resource requirements. The problem of maximizing the average reward (or cost) of admitted calls per unit time is naturally formulated as a semi-Markov Decision Process (SMDP) problem, but is too complex to allow for an exact solution. Thus in this paper, a policy gradient algorithm, together with a decomposition approach, is proposed to find the dynamic (state-dependent) optimal CAC and routing policy among a parameterized policy space. To implement that gradient algorithm, we approximate the gradient of the average reward. Then, we present a simulation-based algorithm to estimate the approximate gradient of the average reward (called GSMDP algorithm), using only a single sample path of the underlying Markov chain for the SMDP of CAC and routing problem. The algorithm enhances performance in terms of convergence speed, rejection probability, robustness to the changing arrival statistics and an overall received average revenue. The experimental simulations will compare our method's performance with other existing methods and show the robustness of our method.

To reduce RFID tag identification delay, we propose a novel Dynamic Splitting protocol (DS) which is an improvement of the Query tree protocol (QT). DS controls the number of branches of a tree dynamically. An improved performance of DS relative to QT is verified by analytical results and simulation studies.

We analyze the performance of an opportunistic transmission strategy for Wireless Sensor Networks (WSNs). We consider a transmission strategy called Binary Decision-Based Transmission (BDT), which is a common form of opportunistic transmission. The BDT scheme initiates transmission only when the channel quality exceeds the optimum threshold to avoid unsuccessful transmissions that waste energy. We formulate the Markov Decision Process (MDP) to identify an optimum threshold for transmission decisions in the BDT scheme.

Vector Coding (VC) is a novel vector modulation scheme that partitions a SISO (Single-Input Single-Output) channel into orthogonal subchannels by singular value decomposition (SVD). Because the orthogonal transmissions enabled by VC cannot cope with inter block interference (IBI) that is inevitable in delay spread channels, this paper proposes an IBI cancelling demodulator which can remove IBI by an iterative technique. We also show that code elimination in which insignificant eigencodes with lowermost eigenvalues are intentionally removed from transmission vectors greatly reduces BER (Bit Error Rate). The VC which utilizes the IBI cancelling demodulator and code elimination to reduce BER is compared with the original VC in not only delay spread SISO channels but also delay spread MIMO (Multi-Input Multi-Output) channels while emphasis is placed on the MIMO cases. Simulation results show that, under a predetermined BER, the enhanced MIMO-VC can improve effective transmission rate than the natural extension of VC to delay spread MIMO channels.