This letter deals with blind multiuser detection based on the multi-channel linearly constrained constant modulus algorithm (MLCCMA) for asynchronous code division multiple access (CDMA) systems over frequency-selective Rayleigh fading channels. In conjunction with the decision-feedback generalized sidelobe canceller (DFGSC), we present an efficient approach to combat multiple access interference and intersymbol interference. Computer simulations confirm that the proposed MLCCMA-based DFGSC can significantly speed up convergence and improve the output performance.

In this paper, an analytical model is proposed to compute the optimal number of clusters that minimizes the energy consumption of multi-hop wireless sensor networks. In the proposed analytical model, the average hop count between a general node (GN) and its nearest clusterhead (CH) is obtained assuming a uniform distribution. How the position of the sink impacts the optimal number of clusters is also discussed. A numerical simulation is carried out to validate the proposed model in various network environments.

This paper deals with the scattering of a transverse magnetic (TM) plane wave from a perfectly conductive sinusoidal surface with finite extent. By use of the undersampling approximation and a rectangular pulse approximation, an asymptotic formula for the total scattering cross section at a low grazing limit of incident angle is obtained explicitly under conditions such that the surface is small in roughness and slope, and the corrugation width is sufficiently large. The formula shows that the total scattering cross section is proportional to the square root of the corrugation width but does not depend on the surface period and surface roughness. When the corrugation width is not large, however, the scattered wave can be obtained by a single scattering approximation, which gives the total scattering cross section proportional to the corrugation width and the Rayleigh slope parameter. From the asymptotic formula and the single scattering solution, a transition point is defined explicitly. By comparison with numerical results, it is concluded that the asymptotic formula is fairly accurate when the corrugation width is much larger than the transition point.

A novel low insertion-loss and wideband microstrip bandpass filter has been designed and tested. The basic configuration of this novel dual-mode filter is a square ring resonator with direct-connected orthogonal feed lines, and dual-perturbation elements are introduced within the resonator at symmetrical location. The effects of the size of the perturbation element are studied. A new filter having wider bandwidth and transmission zeros are presented. The proposed filter responses are in good agreement with the simulations and experiments.

The problem of estimating the timing of ultra-wide band signal is considered in the letter. We develop a maximum likelihood timing estimation algorithm for binary PAM DS-UWB systems. The derivation of the proposed algorithm is based on the known training sequence and AWGN channel. The Cramer-Rao Bound (CRB) for the ML timing estimator is presented as a performance benchmark. It is found via numerical results that the ML timing estimator on AWGN channels achieves the CRB when the values of Eb/N0 for the observation bits Nb=50 are sufficiently high. Finally, the performance of the proposed ML estimator is evaluated on actual channels with intersymbol interference such as an IEEE UWB indoor multipath channel model.

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

In this letter, a semi-automatic method for road network extraction from high-resolution satellite images is proposed. First, we focus on detecting the seed points in candidate road regions using a method of self-organizing map (SOM). Then, an approach to road tracking is presented, searching for connected points in the direction and candidate domain of a road. A study of Geographical Information Systems (GIS) using high-resolution satellite images is presented in this letter. Experimental results verified the effectiveness and efficiency of this approach.

The performance of single-carrier (SC) transmission in a frequency-selective fading channel degrades due to a severe inter-symbol interference (ISI). Using frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can improve the bit error rate (BER) performance of SC transmission. However, the residual ISI after FDE limits the performance improvement. In this paper, we propose a joint use of Tomlinson-Harashima precoding (THP) and FDE to remove the residual ISI. An approximate conditional BER analysis is presented for the given channel condition. The achievable average BER performance is evaluated by Monte-Carlo numerical computation method using the derived conditional BER. The BER analysis is confirmed by computer simulation of the signal transmission.

By diversifying processor architecture, computer software is expected to be more resistant to plagiarism, analysis, and attacks. This study presents a new method to diversify instruction set architecture (ISA) by utilizing the redundancy in the instruction set. Our method is particularly suited for embedded systems implemented with FPGA technology, and realizes a genuine instruction set randomization, which has not been provided by the preceding studies. The evaluation results on four typical ISAs indicate that our scheme can provide a far larger degree of freedom than the preceding studies. Diversified processors based on MIPS architecture were actually implemented and evaluated with Xilinx Spartan-3 FPGA. The increase of logic scale was modest: 5.1% in Specialized design and 3.6% in RAM-mapped design. The performance overhead was also modest: 3.4% in Specialized design and 11.6% in RAM-mapped design. From these results, our scheme is regarded as a practical and promising way to secure FPGA-based embedded systems.

A low complexity minimum mean squared error (MMSE) equalizer for orthogonal frequency division multiplexing (OFDM) systems over time-varying channels is presented. It uses a small matrix of dominant partial channel information and recursive calculation of matrix inverse to significantly reduce the complexity. Theoretical analysis and simulations results are provided to validate its significant performance or complexity advantages over the previously published MMSE equalizers.

Classification of terrain is one of the most important applications of Polarimetric Synthetic Aperture Radar (POLSAR) image analysis. This paper presents a simple method to classify terrain by the use of the correlation coefficients in the circular polarization basis together with the total power of the scattering matrix in the X-band. The reflection symmetry condition that the co-polarized and the cross-polarized correlations are close to zero for natural distributed scatterers is utilized to extract characteristic parameters of small forests or cluster of trees, and oriented urban building blocks with respect to the direction of the radar illumination. Both of these kinds of scatterers are difficult to identify in high resolution POLSAR images of complex urban areas. The indices employed here are the correlation coefficient, a modified coefficient normalized by the reflection symmetric conditional case, and the total power. It is shown that forest areas and oriented building blocks are easily detected and identified. The terrain classification yielded by these combinations is very accurate as confirmed by photographic ground truth images.

Image Registration can be seen as an optimization problem to find a cost function and then use an optimization method to get its minimum. Normalized mutual information is a widely-used robust method to design a cost function in medical image registration. Its calculation is based on the joint histogram of the fixed and transformed moving images. Usually, only a discrete joint histogram is considered in the calculation of normalized mutual information. The discrete joint histogram does not allow the cost function to be explicitly differentiated, so it can only use non-gradient based optimization methods, such as Powell's method, to seek the minimum. In this paper, a parzen-window based method is proposed to estimate the continuous joint histogram in order to make it possible to derive the close form solution for the derivative of the cost function. With this help, we successfully apply the gradient-based optimization method in registration. We also design a new kernel for the parzen-window based method. Our designed kernel is a second order polynomial kernel with the width of two. Because of good theoretical characteristics, this kernel works better than other kernels, such as a cubic B-spline kernel and a first order B-spline kernel, which are widely used in the parzen-window based estimation. Both rigid and non-rigid registration experiments are done to show improved behavior of our designed kernel. Additionally, the proposed method is successfully applied to a clinical CT-MR non-rigid registration which is able to assist a magnetic resonance (MR) guided microwave thermocoagulation of liver tumors.

Normalization transform is known to be very useful for finding the overall trend of time-series data since it enables finding sequences with similar fluctuation patterns. Previous subsequence matching methods with normalization transform, however, would incur index overhead both in storage space and in update maintenance since they should build multiple indexes for supporting query sequences of arbitrary length. To solve this problem, we adopt a single-index approach in the normalization-transformed subsequence matching that supports query sequences of arbitrary length. For the single-index approach, we first provide the notion of inclusion-normalization transform by generalizing the original definition of normalization transform. To normalize a window, the inclusion-normalization transform uses the mean and the standard deviation of a subsequence that includes the window while the original transform uses those of the window itself. Next, we formally prove the correctness of the proposed normalization-transformed subsequence matching method that uses the inclusion-normalization transform. We then propose subsequence matching and index-building algorithms to implement the proposed method. Experimental results for real stock data show that our method improves performance by up to 2.52.8 times compared with the previous method.

This paper proposes physical channel structures and a cell search method for OFDM based radio access in the Evolved UTRA (UMTS Terrestrial Radio Access) downlink, which supports multiple scalable transmission bandwidths from 1.25 to 20 MHz. In the proposed physical channel structures, the central sub-carrier of the OFDM signal is located on the frequency satisfying the 200-kHz raster condition regardless of the transmission bandwidth of the cell site. Moreover, the synchronization channel (SCH) and broadcast channel (BCH), which are necessary for cell search, are transmitted in the central part of the entire transmission spectrum with a fixed bandwidth. In the proposed cell search method, a user equipment (UE) acquires the target cell in the cell search process in the initial or connected mode employing the SCH and possibly the reference signal, which are transmitted in the central part of the given transmission bandwidth. After detecting the target cell, the UE decodes the common control information through the BCH, which is transmitted at the same frequency as the SCH, and identifies the transmission bandwidth of the cell to be connected. Computer simulations show the fast cell search performance made possible by using the proposed SCH structure and the cell search method.

Most studies into multiple-input multiple-output (MIMO) antenna systems have aimed at determining the capacity-achieving (CA) input covariance given a certain degree of channel state information (CSI) at the transmitter and/or the receiver side. From the practical perspective, however, there is a growing interest in investigating the scenario where the system performance is power-limited as opposed to rate-limited. Of particular concern is the open problem of solving the optimal power-saving (PS) input covariance for spatially correlated MIMO channels when only the long-term (slow-varying) channel spatial covariance information is available at the transmitter. In an attempt to achieve this goal, this paper analyzes the characteristics of the optimal PS input covariance given the knowledge of channel spatial covariance information and the rate constraint of the transmission. Sufficient and necessary conditions of the optimal PS input covariance are derived. By considering the large-system regimes, we further devise an efficient iterative algorithm to compute the asymptotic optimal PS input covariance. Numerical results will show that the asymptotic solution is very effective in that it gives promising results even for MIMO systems with only a few antennas at the transmitter and the receiver.

We propose an accurate, distributed localization method that uses the connectivity measure to localize nodes in a wireless sensor network. The proposed method is based on a self-organizing isometric embedding algorithm that adaptively emphasizes the most accurate range of measurements and naturally accounts for communication constraints within the sensor network. Each node adaptively chooses a neighborhood of sensors and updates its estimate of position by minimizing a local cost function and then passes this update to the neighboring sensors. Simulations demonstrate that the proposed method is more robust to measurement error than previous methods and it can achieve comparable results using much fewer anchor nodes than previous methods.

A simplified equalization method based on the band structure of the frequency domain channel matrix is proposed for the single carrier systems employing cyclic prefix (SC-CP) over time-varying wireless channels. Using both theoretical analysis and computer simulation, it is shown that the complexity of this method is proportional to the number of symbols in one SC-CP block and is less than that of traditional block equalization methods. We also show that they have similar performance.

The use of frequency-domain equalization based on minimum mean square error criterion (called MMSE-FDE) can significantly improve the bit error rate (BER) performance of DS-CDMA signal transmission compared to the well-known coherent rake combining. However, in a DS-CDMA cellular system, as a mobile user moves away from a base station and approaches the cell edge, the received signal power gets weaker and the interference from other cells becomes stronger, thereby degrading the transmission performance. To improve the transmission performance of a user close to the cell edge, the well-known site diversity can be used in conjunction with FDE. In this paper, we consider DS-CDMA downlink site diversity with FDE. The MMSE site diversity combining weight is theoretically derived for joint FDE and antenna diversity reception and the downlink capacity is evaluated by computer simulation. It is shown that the larger downlink capacity can be achieved with FDE than with coherent rake combining. It is also shown that the DS-CDMA downlink capacity is almost the same as MC-CDMA downlink capacity.

We experimentally demonstrated polarization-mode dispersion (PMD) compensation by distributing polarizers with only 1 degree of freedom (DOF) along the transmission line. The average power penalty was measured to be 0.4 dB by inserting four compensators, where average differential group delay was 47% of bit period.

The classical 4-phase constant-amplitude zero-autocorrelation (CAZAC) sequence with the length of 16 has been used for multifarious purposes such as channel estimation and frequency/timing synchronizations since it presents good performance even in low signal to noise ratio (SNR) conditions. However, as multiple transmit antennas are employed, its properties are easily destroyed by the effect of multipath. In this letter, we propose a technique which ensures that the conventional CAZAC sequence is reliable in a multi-antenna system by inserting nulls. The performance of the modified sequence is verified through the mean s quare error (MSE) performance with the least squares (LS) method.