For an FPGA-based heterogeneous multicore platform, we present the design methodology to reduce the total processing time considering data-transfer. The reconfigurability of recent FPGAs with hard CPU cores allows us to realize a single-chip heterogeneous processor optimized for a given application. The major problem in designing such heterogeneous processors is data-transfer between CPU cores and accelerator cores. The total processing time with data-transfers is modeled considering the overlap of computation time and data-transfer time, and optimal design parameters are searched for.

Based on a unified representation of generalized cyclotomic classes, every generalized cyclotomic sequence of order d over $Z_{p_{1}^{e_{1}}p_{2}^{e_{2}}cdots p_{r}^{e_{r}}}$ is shown to be a sum of d-residue sequences over $Z_{p_{s}^{e_{s}}}$ for $sin {1,2,cdots,r }$. For d=2, by the multi-rate approach, several generalized cyclotomic sequences are explicitly expressed by Legendre sequences, and their linear complexity properties are analyzed.

New classes of zero-difference balanced (ZDB) functions derived from Fermat quotients are proposed in this letter. Based on the new ZDB functions, some applications, such as the construction of optimal frequency hopping sequences set and perfect difference systems of sets, are introduced.

In this paper, we first propose ten new discrimination features of SAR images in the moving and stationary target acquisition and recognition (MSTAR) database. The Ada_MCBoost algorithm is then proposed to classify multiclass SAR targets. In the new algorithm, we introduce a novel large-margin loss function to design a multiclass classifier directly instead of decomposing the multiclass problem into a set of binary ones through the error-correcting output codes (ECOC) method. Finally, experiments show that the new features are helpful for SAR targets discrimination; the new algorithm had better recognition performance than three other contrast methods.

A signal-model-based SAR image formation algorithm is proposed in this paper. A model is used to describe the received signal, and each scatterer can be characterized by a set of its parameters. Two parameter estimation methods via atomic decomposition are presented: (1) applying 1-D matching pursuit to azimuthal projection data; (2) applying 2-D matching pursuit to raw data. The estimated parameters are mapped to form a SAR image, and the mapping procedure can be implemented under application guidelines. This algorithm requires no prior information about the relative motion between the platform and the target. The Cramer-Rao bounds of parameter estimation are derived, and the root mean square errors of the estimates are close to the bounds. Experimental results are given to validate the algorithm and indicate its potential applications.

To overcome the target-aspect sensitivity in radar high resolution range profile (HRRP) recognition, a novel method called Improved Kernel Distance Fuzzy C-means Clustering Method (IKDFCM) is proposed in this paper, which introduces kernel function into fuzzy c-means clustering and relaxes the constraint in the membership matrix. The new method finds the underlying geometric structure information hiding in HRRP target and uses it to overcome the HRRP target-aspect sensitivity. The relaxing of constraint in the membership matrix improves anti-noise performance and robustness of the algorithm. Finally, experiments on three kinds of ground HRRP target under different SNRs and four UCI datasets demonstrate the proposed method not only has better recognition accuracy but also more robust than the other three comparison methods.

This paper presents an automatic method to track soccer players in soccer video recorded from a single camera where the occurrence of pan-tilt-zoom can take place. The automatic object tracking is intended to support texture extraction in a free viewpoint video authoring application for soccer video. To ensure that the identity of the tracked object can be correctly obtained, background segmentation is performed and automatically removes commercial billboards whenever it overlaps with the soccer player. Next, object tracking is performed by an attribute matching algorithm for all objects in the temporal domain to find and maintain the correlation of the detected objects. The attribute matching process finds the best match between two objects in different frames according to their pre-determined attributes: position, size, dominant color and motion information. Utilizing these attributes, the experimental results show that the tracking process can handle occlusion problems such as occlusion involving more than three objects and occluded objects with similar color and moving direction, as well as correctly identify objects in the presence of camera movements.

This paper proposes the concept of adaptive multi-rate (AMR), which jointly employs switching between two links and adaptive rate on each link, for hybrid free-space optical/radio-frequency (FSO/RF) systems. Moreover, we present the cross-layer design of AMR switching, which is based on both the physical and link layers with an automatic-repeat request (ARQ) scheme. We develop an analytical framework based on a Markov chain model for system performance analysis. System performance metrics, including frame-error rate, goodput and link switching probability, are analytically studied over fading channels. Numerical results quantitatively show how the proposal significantly outperforms conventional ones with physical layer-based design and/or fixed-rate switching operation.

Let r be an odd prime, such that r≥5 and r≠p, m be the order of r modulo p. Then, there exists a 2pth root of unity in the extension field Frm. Let G(x) be the generating polynomial of the considered quaternary sequences over Fq[x] with q=rm. By explicitly computing the number of zeros of the generating polynomial G(x) over Frm, we can determine the degree of the minimal polynomial, of the quaternary sequences which in turn represents the linear complexity. In this paper, we show that the minimal value of the linear complexity is equal to $ rac{1}{2}(3p-1) $ which is more than p, the half of the period 2p. According to Berlekamp-Massey algorithm, these sequences viewed as enough good for the use in cryptography.

In this paper, we propose a modeling approach for wireless sensor networks (WSNs) that is based on non-volatile two-dimensional cellular automata (CA) and analyze the space-time dynamics of a WSN based on the proposed model. We introduce the fourth circuit element with memory function — memristor into the cells of CA to model a non-volatile CA and employ the non-volatile CA in modeling a WSN. A state transition method is designed to implement the synchronous updates of the states between the central sensor nodes and its neighbors which might behave asynchronously in sending messages to the central one. Therefore, the energy consumption in sensor nodes can be reduced by lessening the amount of exchanged information. Simulations demonstrate that the energy consumption of a WSN can be reduced greatly based on the proposed model and the lifetime of the whole network can be increased.

New target specific absorption rate (SAR) values, calculated using a proposed reference dipole antenna and the reference flat phantom, are presented for an SAR validation test at 150MHz. The reference flat phantom recommended by the International Electrotechnical Commission (IEC) standard for 150MHz requires a significant amount of liquid owing to its large size. We conduct a numerical analysis in order to reduce the size of the flat phantom. The optimum size of the flat phantom is 780 (L1) × 540 (W) × 200 (H)mm3, which is approximately a 64% reduction in volume compared to the reference flat phantom. The length of the reference dipole antenna required for the optimized flat phantom (extrapolated from the reference values at 300MHz) becomes 760mm. The calculated and measured return losses (S11) of the antenna at 150MHz are 24.1dB and 22dB, respectively. The calculated and measured results for the return loss of the dipole antenna agree well and satisfy the IEC standard (> 20dB). The target SAR values derived from the numerical analysis are 1.08W/kg for 1g of tissue and 0.77W/kg for 10g of tissue for an SAR validation test at 150MHz.

With the development of wireless technologies, wireless relay systems have become a popular topic. To design practical wireless relay systems, link adaptation is an important technique. Because there are both broadcast and multiple access channels in wireless relay systems, link adaptation is difficult to design and hence the optimal throughput is hard to achieve. In this study, a novel method is proposed to maximize the system throughput of wireless relay systems by utilizing the most popular link adaptation methods, adaptive modulation and coding (AMC) and hybrid automatic repeat request (HARQ). The proposed method utilizes the characteristics and operations of AMC and HARQ to adaptively adjust the thresholds for selecting modulation and coding scheme (MCS) to be used. Thus the system can keep tracking the optimal values of the thresholds. Therefore, the system throughput can be maximized. We set up simulations for different relay environment settings, such as different relay HARQ protocols, placements, and multiplexing schemes, to verify the capability of the proposed method. The simulation results show that, compared to the existing method, the proposed method indeed improves system throughput under a variety of relay settings and can be easily applied to different system platforms.

A current mode buck/boost DC-DC converter with automatic mode transition is presented in this paper. At heavy load, a control scheme adaptively changes operation mode between peak and valley current modes to achieve high efficiency, small output voltage ripple, and fast transient response. The switching loss is reduced by operating in pure modes, and the conduction loss is reduced by decreasing the average inductor current in transition modes. At light load, the equivalent switching frequency is decreased to reduce the switching loss. An automatic mode transition between heavy load PWM mode and light load PFM mode is achieved by introducing an average load current sensing method. The converter has been implemented with a standard 0.5,$mu$m CMOS process. The output voltage ripple is less than 10,mV in all modes, and the peak efficiency is 95%.

The linear complexity of binary sequences plays a fundamental part in cryptography. In the paper, we construct more general forms of generalized cyclotomic binary sequences with period 2pm+1qn+1. Furthermore, we establish the formula of the linear complexity of proposed sequences. The results reveal that such sequences with period 2pm+1qn+1 have a good balance property and high linear complexity.

In this paper, we propose a zero-forcing (ZF) Tomlinson-Harashima precoding (THP) with substream permutations based on the bit rate maximization for single-user MIMO (SU-MIMO) systems. We study the effect of substream permutations on the ZF-THP SU-MIMO systems, when the mean squared error (MSE) and the bit rate are adopted for the selection of the permutation matrix as criteria. Based on our analysis, we propose a method to increase the bit rate by substream permutations, and derive QR and Cholesky decomposition-based algorithms which realize the proposed method. Furthermore, to improve the error rate performance, we apply zero transmission to subchannels with low signal-to-noise ratios. Numerical examples are provided to demonstrate the effectiveness of the proposed THP MIMO system.

Ni nanodots (NDs) used as nano-scale top electrodes were formed on a 10-nm-thick Si-rich oxide (SiO$_{mathrm{x}}$)/Ni bottom electrode by exposing a 2-nm-thick Ni layer to remote H$_{2}$-plasma (H$_{2}$-RP) without external heating, and the resistance-switching behaviors of SiO$_{mathrm{x}}$ were investigated from current-voltage ( extit{I--V}) curves. Atomic force microscope (AFM) analyses confirmed the formation of electrically isolated Ni NDs as a result of surface migration and agglomeration of Ni atoms promoted by the surface recombination of H radicals. From local extit{I--V} measurements performed by contacting a single Ni ND as a top electrode with a Rh coated Si cantilever, a distinct uni-polar type resistance switching behavior was observed repeatedly despite an average contact area between the Ni ND and the SiO$_{mathrm{x}}$ as small as $sim$ 1.9 $ imes$ 10$^{-12}$cm$^{2}$. This local extit{I--V} measurement technique is quite a simple method to evaluate the size scalability of switching properties.

This paper presents a new methodology for realizing a Rice channel in BAN Over-The-Air (OTA) testing using a fading emulator with a dynamic phantom. For the proposed apparatus to be effective, the fading emulator must be provided with an appropriate K-factor that represents the actual propagation environment indoors. Further, an implementation of the Rice channel to the proposed fading emulator in a BAN situation is presented. Thereafter, a calibration method for the fading emulator to adjust the actual K-factor of the on-body Rice channel is advanced. This calibration method is validated by analyzing the variations in the instantaneous K-factor attributed to the arm-swinging motion. Finally, an experiment is conducted for a continuous human walking motion with the fading emulator using an arm-swinging dynamic phantom. The results show that the developed fading emulator allows BAN-OTA testing to replicate the actual Rice channel propagation environment with the consideration of the dynamic characteristics of human walking motion.

Aiming to ease the parallel programming for heterogeneous architectures, we propose and implement a high-level OpenCL runtime that conceptually merges multiple heterogeneous hardware devices into one virtual heterogeneous compute device (VHCD). Moreover, automated workload distribution among the devices is based on offline profiling, together with new programming directives that define the device-independent data access range per work-group. Therefore, an OpenCL program originally written for a single compute device can, after inserting a small number of programming directives, run efficiently on a platform consisting of heterogeneous compute devices. Performance is ensured by introducing the technique of virtual cache management, which minimizes the amount of host-device data transfer. Our new OpenCL runtime is evaluated by a diverse set of OpenCL benchmarks, demonstrating good performance on various configurations of a heterogeneous system.

Fault localization is essential for conducting effective program repair. However, preliminary studies have shown that existing fault localization approaches do not take the requirements of automatic repair into account, and therefore restrict the repair performance. To address this issue, this paper presents the first study on designing fault localization approaches for automatic program repair, that is, we propose a fault localization approach using failure-related contexts in order to improve automatic program repair. The proposed approach first utilizes program slicing technique to construct a failure-related context, then evaluates the suspiciousness of each element in this context, and finally transfers the result of evaluation to automatic program repair techniques for performing repair on faulty programs. The experimental results demonstrate that the proposed approach is effective to improve automatic repair performance.

Recently, Hadoop has attracted much attention from engineers and researchers as an emerging and effective framework for Big Data. HDFS (Hadoop Distributed File System) can manage a huge amount of data with high performance and reliability using only commodity hardware. However, HDFS requires a single master node, called a NameNode, to manage the entire namespace (or all the i-nodes) of a file system. This causes the SPOF (Single Point Of Failure) problem because the file system becomes inaccessible when the NameNode fails. This also causes a bottleneck of efficiency since all the access requests to the file system have to contact the NameNode. Hadoop 2.0 resolves the SPOF problem by introducing manual failover based on two NameNodes, Active and Standby. However, it still has the efficiency bottleneck problem since all the access requests have to contact the Active in ordinary executions. It may also lose the advantage of using commodity hardware since the two NameNodes have to share a highly reliable sophisticated storage. In this paper, we propose a new HDFS architecture to resolve all the problems mentioned above.