Advanced nanometer circuits are susceptible to errors caused by process, voltage, and temperature (PVT) variations or due to a single event upset (SEU). State-of-the-art design-for-variability (DFV)-aware flip-flops (FFs) suffer from their area and timing overheads. By utilizing C-element modules, two types of FFs are proposed for error detection and error correction.

Manufacturing defects in the deep sub-micron VLSI process and aging resulted problems of devices during lifecycle are inevitable, and fault-tolerant routing algorithms are important to provide the required communication for NoCs in spite of failures. The proposed algorithm, referred to as scalable and reconfigurable fault-tolerant distributed routing (RFDR), partitions the system into nine regions using the concept of divide-and-conquer. It is a distributed algorithm, and each router guarantees fault-tolerance within one's own region and the system can be still sustained with multiple fault areas. The proposed RFDR has excellent scalability with hardware cost keeping constant independent of system size. Also it is completely reconfigurable when new nodes fail. Simulations under various synthetic traffic patterns show its better performance compared to Extended-XY routing algorithm. Moreover, there is almost no hardware overhead compared to Logic-Based Distributed Routing (LBDR), but the fault-tolerance capacity is enhanced in the proposed algorithm. Hardware cost is reduced 37% compared to Reconfigurable Distributed Scalable Predictable Interconnect Network (R-DSPIN) which only supports single fault region.

The tag collection algorithm in ISO/IEC 18000-7 has difficulty in collecting data from massive numbers of active RFID tags in a timely manner, so it should be improved to allow successful application in a wide variety of industrial fields. We propose two novel methods, a reduced-message method to improve the performance of data-tag collection and an efficient-sleep method to improve the performance of ID-tag collection. The reduced-message method decreases the slot size for a tag response by reducing the response size from the tag and reduces the number of commands issued from the reader. The efficient-sleep method utilizes redundant empty slots within the frame period to transmit sleep commands to the tags collected previously. We evaluated the performance improvement of tag collection by the proposed methods experimentally using an active RFID reader and 60 tags that we prepared for this study. The experimental results showed that the reduced-message method and the efficient-sleep method decreased the average tag collection time by 16.7% for data-tag collection and 9.3% for ID-tag collection compared with the standard tag collection. We also developed a simulation model for the active RFID system, reflecting the capture effect in wireless communication, and performed simulations to evaluate the proposed methods with a massive number of tags. The simulation results with up to 300 tags confirmed that the proposed methods could improve the tag collection performance, confirming the experimental results, even with larger numbers of tags.

A planar circularly-polarized (CP) small antenna is proposed. To obtain a low profile configuration, a co-planar waveguide (CPW) structure is employed. Circular polarization is achieved using a curved stub that generates current distribution in a direction orthogonal to the current distribution from the patch. Using meander lines and a series gap capacitance, a 70% size reduction is achieved compared to a half-wavelength resonant antenna. To the best of the authors' knowledge, the proposed antenna is the smallest CP antenna using CPW technology. The measured 3 dB axial ratio bandwidth is 8.3% from 3.83 GHz to 4.16 GHz, and a 1.6 dBic gain and 89% efficiency are achieved.

These days, cheap and intelligent sensors, networked through wireless links and deployed in large numbers, provide unprecedented opportunities for monitoring and controlling homes, cities and the environment. Networked sensors also offer a broad range of applications. Localization capability is essential in most wireless sensor networks applications; for instance in environmental monitoring applications such as animal habitat monitoring, bush fire surveillance, water quality monitoring and precision agriculture, the measurement data are meaningless without accurate knowledge of where they are obtained. Localization techniques are used to determine location information by estimating the location of each sensor node. Distance measurement errors are commonly known to affect the accuracy of the estimated location; resulting in errors that may be due to inherent or environmental factors. Trilateration [1] is a well-known method for localizing nodes by using the distances to three anchor nodes; yet it performs poorly when they are many distance measurement errors. Therefore, we propose the LRD (Localization with Ratio-Distance) algorithm, which performs strongly even in the presence of many measurement errors associated with the estimated distance to anchor nodes. Simulations using the OPNET Modeler show that LRD is more accurate than trilateration.

Nearest neighbor search (NNS) among large-scale and high-dimensional vectors plays an important role in recent large-scale multimedia search applications. This paper proposes an optimized multiple codebook construction method for an approximate NNS scheme based on product quantization, where sets of residual sub-vectors are clustered according to their distribution and the codebooks for product quantization are constructed from these clusters. Our approach enables us to adaptively select the number of codebooks to be used by trading between the search accuracy and the amount of memory available.

A stereo video coding scheme which is compatible with monoview-processor is presented in this paper. At the same time, this paper proposes an adaptive prediction structure which can make different prediction modes to be applied to different groups of picture (GOPs) according to temporal correlations and interview correlations to improve the coding efficiency. Moreover, the most advanced video coding standard H.264 is used conveniently for maximize the coding efficiency in this paper. Finally, the effectiveness of the proposed scheme is verified by extensive experimental results.

High-performance 1.3-µm electroabsorption modulators integrated with DFB lasers are developed for long-reach 100 Gbit Ethernet. The dynamic extinction ratio of over 8-dB with the voltage swing of 2 V are achieved for the four LAN-WDM lanes (14 nm wavelength range) used in 100 Gbit Ethernet with the same modulator structure. The fabricated devices are packaged in butterfly modules and four-lane 40-km single mode fiber transmission at 25-Gbit/s operation is demonstrated. Further, a can-type transmitter optical subassembly is fabricated to reduce the cost and size of transmitter modules. The use of a low-dielectric-constant liquid crystal polymer transmission line makes the 3-dB bandwidth larger and enables 25-Gbit/s operation with CAN-TOSA module.

We demonstrate an all-optical picosecond pulse duration-tunable nonreturn-to-zero (NRZ)-to-return-to-zero (RZ) data format conversion using a Raman amplifier-based compressor and a fiber-based four-wave mixing (FWM) switch. A NRZ data signal is injected into the fiber-based FWM switch (AND gate) with a compressed RZ clock by the Raman amplifier-based compressor, and convert to RZ data signal by the fiber-based FWM switch. The compressed RZ clock train acts as a pump signal in the fiber-based FWM switch to perform the NRZ-to-RZ data format conversion. By changing the Raman pump power of the Raman amplifier-based compressor, it is possible to tune the pulse duration of the converted RZ data signal from 15 ps to 2 ps. In all the tuning range, the receiver sensitivity at bit error rate (BER) of 10-9 for the converted RZ data signal was about 1.31.7 dB better than the receiver sensitivity of the input NRZ data signal. Moreover, the pulse pedestal of the converted RZ data signals is well suppressed owing to the FWM process in the fiber-based FWM switch.

Existing filtering methods of TCP ACK packets are known to be effective in reducing the required bandwidth, resulting in the improvement of TCP throughput. However, the methods cannot handle the filtering of piggyback ACK packets. Considering that most TCP applications require bidirectional data exchange, the lack of the functionality to deal with the piggyback ACK packets should be addressed. This paper proposes a novel filtering scheme for WiMAX systems that can handle the piggyback ACK packets. The novelty comes from the fact that the proposed method overlaps the processing time of packet merging with the round trip delay of the bandwidth request-and-grant procedure. It is advantageous because it does not require extra time for the merging. The results from an analytical model and simulations show that the required uplink bandwidth is decreased while the downlink throughput is increased.

A novel signaling scheme is proposed for iterative channel estimation and data decoding in fast fading channels. The basic idea is to bias the occurrence probability of transmitted symbols. A priori information about the bias is utilized for channel estimation. The bias-based scheme is constructed as a serially concatenated code, in which a convolutional code and a biased nonlinear block code are used as the outer and inner codes, respectively. This construction allows the receiver to estimate channel state information (CSI) efficiently. The proposed scheme is numerically shown to outperform conventional pilot-based schemes in terms of spectral efficiency for moderately fast fading channels.

We present a new structure for parallel affine projection (AP) filters with different step-sizes. By observing their error signals, the proposed alternating AP (A-AP) filter selects one of the two AP filters and updates the weights of the selected filter for each iteration. As a result, the total computations required for the proposed structure is almost the same as that for a single AP filter. Experimental results show that the proposed alternating selection scheme extracts the best properties of each component filter, namely fast convergence and small steady-state error.

To reduce the huge search space when customizing accelerators for the application specific instruction-set processor (ASIP), this paper proposes an automated customization method based on the data flow graph exploration. This method integrates the instruction identification and selection using an iterative improvement strategy, which uses a seed-growth algorithm to select the valid patterns that can bring higher performance enhancement. The search space is reduced by considering the performance factors during the identification stage. The experimental results indicate that the proposed method is feasible enough compared to the previous exhaustive algorithms.

This paper proposes a proactive management system for the events that occur across multiple personal user devices, including desktop PCs, laptops, and smart phones. We implemented the Personal Event Management Service using Dynamic Bayesian Networks (PEMS-DBN) system that proactively executes appropriate tasks across multiple devices without explicit user requests by recognizing the user's device reuse intention, based on the observed actions of the user for specific devices. The client module of PEMS-DBN installed on each device monitors the user actions and recognizes user intention by using dynamic Bayesian networks. The server provides data sharing and maintenance for the clients. A series of experiments were performed to evaluate user satisfaction and system accuracy, and also the amounts of resource consumption during intention recognition and proactive execution are measured to ensure the system efficiency. The experimental results showed that the PEMS-DBN system can proactively provide appropriate, personalized services with a high degree of satisfaction to the user in an effective and efficient manner.

It is an important problem to determine major collection times to meet the pause time goal for a generational garbage collector. From such a viewpoint, this paper proposes two stochastic models based on working schemes of a generational garbage collector: Garbage collections occur in a nonhomogeneous Poisson process, tenuring collection is made at a threshold level K, and major collection is made at time T or at Nth collection including minor and tenuring collections for the first model and at time T or at Nth collection including tenuring collections for the second model. Using the techniques of cumulative processes and reliability theory, expected cost rates are obtained, and optimal policies of major collection times which minimize them are discussed analytically and computed numerically.

Over 100 Gbit/s/ch high-speed optical transmission is required to achieve the high capacity networks that can meet future demands. The coherent receiver, which is expected to yield high frequency utilization, is a promising means of achieving such high-speed transmission. However, it requires a high-speed Analog to Digital Converter (ADC) because the received signal bandwidth would be over several tens or hundreds of GHz. To solve this problem, we propose a band-divided receiver structure for wideband optical signals. In the receiver, received wideband signals are divided into a number of narrow band signals without any guard band. We develop a band-divided receiver prototype and evaluate it in an experiment. In addition, we develop a real-time OFDM demodulator on an FPGA board that implements 1.5 GS/s ADCs. We demonstrate that the band-divided receiver prototype with its real-time OFDM demodulator and 1.5 GS/s ADC can demodulate single polarization 12 Gbit/s OFDM signals in real-time.

For an indoor area where a target node is tracked with anchor nodes, we can calculate the priori probability density functions (pdfs) on the distances between the target and anchor nodes by using its shape, three-dimensional sizes and anchor nodes locations. We call it “the area layout information (ALI)” and apply it for two indoor target tracking methods with received signal strength indication (RSSI) assuming a square location estimation area. First, we introduce the ALI to a target tracking method which tracks a target using the weighted sum of its past-to-present locations by a simple infinite impulse response (IIR) low pass filter. Second, we show that the ALI is applicable to a target tracking method with a particle filter where the motion of the target is nonlinearly modelled. The performances of the two tracking methods are evaluated by not only computer simulations but also experiments. The results demonstrate that the use of ALI can successfully improve the location estimation performance of both target tracking methods, without huge increase of computational complexity.

We achieve concurrent access to WiFi and WiMAX networks on a mobile terminal equipped with a common RF subsystem by providing time-interleaved RF access control schemes to both of the MAC layers. We propose cooperative and competitive sharing schemes, neither of which requires any modification to other network components. We implement our schemes on a WiFi/WiMAX dual-mode SoC platform. Experimental results show that these schemes work and have affordable overheads.

The problem of estimating the nominal angles and angular spreads of multiple coherently distributed (CD) sources in a symmetric uniform linear array (ULA) is considered. Based on structure of the subarrays consisting of two opposite sensors relative to the center of a ULA and the rank reduction (RARE) concept, the proposed algorithm is able to estimate the nominal angles without any angular signal density model assumptions of the sources. Using the estimated nominal angles, the angular spread of each source is then obtained using a one-dimensional (1-D) distributed source parameter estimator (DSPE).

An optimal selection criterion of the modulation and coding scheme (MCS) for maximizing spectral efficiency is proposed in consideration of the signaling overhead of mobile WiMAX systems with a hybrid automatic repeat request mechanism. A base station informs users about the resource assignments in each frame, and the allocation process generates a substantial signaling overhead, which influences the system throughput. However, the signaling overhead was ignored in previous MCS selection criteria. In this letter, the spectral efficiency is estimated on the basis of the signaling overhead and the number of transmissions. The performance of the proposed MCS selection criterion is evaluated in terms of the spectral efficiency in the mobile WiMAX system, with and without persistent allocation.