We consider the backlight calculation of local dimming as an optimization problem. The luminance produced by many LEDs at each pixel considered is calculated which should cover the gray value of each pixel, while the sum of LED currents is to be minimized. For this purpose a specific approach called as "Sorted Sector Covering" (SSC) was developed and is described in this paper. In our pre-processing unit called condenser the source image is reduced to a matrix of much lower resolution so that the computation effort of the SSC algorithm is drastically reduced. During this preprocessing phase, filter functions can be integrated so that a further reduction of the power consumption is achieved. Our processing system allows high power saving and high visual quality at low processor cost. We approach the local dimming problem in the physical viewing direction -- from LED to pixel. The luminance for the pixel is based on the light spread function (LSF) and the PWM values of the LEDs. As the physical viewing direction is chosen, this method is universal and can be applied for any kind of LED arrangement -- direct-lit as well as edge-lit. It is validated on prototypes, e.g., a locally dimmed edge-lit TV.

A Real-time Capacitor Compensation (RCC) scheme is proposed for low power and continuous communication in the wearable inductive coupling transceiver. Since inductance values of wearable inductor vary dynamically with deterioration of its communication characteristics, the inductance value is monitored and its resonance frequency is adjusted by additive parallel/serial capacitors in real time. RLC Bridge for detection of the inductance variations and the Dual-edge Sampling Comparator for recognition of the variance direction are proposed. It is implemented in a 0.18 µm CMOS technology, and it occupies a 12.7 mm2 chip area. The proposed transceiver consumes only 426.6 µW at 4 Mbps data rate. The compensation time takes 4.78 µs, including 3 µs of detection and 1.78 µs for compensation process in worst case.

A stacked rectangular microstrip antenna with a shorting plate and a helical pin is proposed as a car antenna for triple band operation in ITS. The proposed antenna operates as a conventional stacked microstrip antenna at the highest frequency band. At the middle and the lowest frequency bands, the antenna radiates at low elevation angles from the helical pin and the shorting plate. In this paper, as an example of triple band antennas in the ITS, an antenna is designed that supports PHS, VICS and ETC. The proposed antennas have the proper radiation pattern for each application and are small in size.

Vision sensors provide rich sources of information, but sensing images and processing them in real time would be a challenging task. This paper introduces a vision system using SoCBase platform and presents heuristic designs of SAD correlation algorithm as a component of the vision system. Simulation results show that the vision system is suitable for real-time applications and that the heuristic designs of SAD algorithm are worth utilizing since they save a considerable amount of space with little sacrificing in quality.

This paper proposes a medium access control (MAC) mechanism for the recently developed IEEE 802.15.4 standard, a promising candidate to become the physical (PHY) and MAC layer standard for Wireless Sensor Networks (WSNs). The main concern in WSNs is the energy consumption, and this paper presents a mechanism that adapts properly the duty cycle operation according to the traffic conditions. Various traffic adaption mechanisms have been presented for the MAC layer of the IEEE 802.15.4. However these conventional mechanisms only consider the temporal traffic fluctuations. The proposed mechanism outperforms the conventional mechanism when applied to cluster-tree based WSNs, because it considers not only the temporal fluctuations but also the spatial (geographical) fluctuations, which are intrinsic characteristics of traffic in WSNs with the cluster tree topology. Evaluations showed that the proposed mechanism achieves less energy consumption than the conventional traffic adaptation mechanism, with maintaining almost the same transmission performance.

Data query is one of the most important issues in wireless ad hoc networks, since the ultimate goal of these networks is to support efficient data sharing among wireless nodes. In this paper, we study the issue of data query for delay-sensitive applications in dense wireless ad hoc networks. We focus our attention on step-by-step expanding ring-based data query, which provides an upper bound on query delay to any expanding ring based query strategies. Two replication strategies including Index Replication (IR) and Data Replication (DR) are considered, to improve the delay performance of data query. We analyze the probabilistic behavior of query delay for both DR and IR by theoretical methods, and develop analytical models to approximate the minimum number of replicas required for both query strategies if an application-specified delay bound is imposed. Our work is validated through extensive simulations.

We propose an "estimation of distribution algorithm" incorporating switching. The algorithm enables switching from the standard estimation of distribution algorithm (EDA) to the genetic algorithm (GA), or vice versa, on the basis of switching criteria. The algorithm shows better performance than GA and EDA in deceptive problems.

As described in this paper, construction and blind estimation methods of phase sequences are proposed for subcarrier-phase control based peak-to-average power ratio (PAPR) reduction in low-density parity-check (LDPC)-coded orthogonal frequency division multiplexing (OFDM) systems. On the transmitter side, phase sequence patterns are constructed based on a given parity-check matrix. The PAPR of the OFDM signal is reduced by multiplying the constructed phase sequence selected from the same number of candidates as the number of weighting factor (WF) combinations in a partial transmit sequence (PTS) method. On the receiver side, the phase sequence is estimated blindly using the decoding function, i.e., the most likely phase sequence among a limited number of possible phase sequence candidates is inferred by comparing the sum-product calculation results of each candidate. Computer simulation results show that PAPR of QPSK-OFDM and 16QAM-OFDM signals can be reduced respectively by about 3.7 dB and 4.0 dB without marked degradation of the block error rate (BLER) performance as compared to perfect estimation in an attenuated 12-path Rayleigh fading condition.

We present self-calibration techniques for an interleaved SAR (Successive Approximation Register) ADC. The calibration technique is based on hardware corrections for linearity of single stage, gain error and mismatch errors of parallel ADCs. The 4-interleaved 11-bit ADC has been fabricated in a 0.18-µm CMOS process. Using the calibrations, measurement and calculation results show that the differences of ramp characteristic among the 4-interleaving ADC can be decresased to under 0.63 LSB.

Let n,k,e,m be positive integers such that n≥ 3, 1 ≤ k ≤ n-1, gcd(n,k)=e, and m= is odd. In this paper, for an odd prime p, we derive a lower bound for the minimal distance of a large class of p-ary cyclic codes Cl with nonzeros α-1, α-(pk+1), α-(p3k+1), …, α-(p(2l-1)k+1), where 1 ≤ l ≤ and α is a primitive element of the finite field Fpn. Employing these codes, p-ary sequence families with a flexible tradeoff between low correlation and large size are constructed.

Recently wireless sensor networks (WSN) has risen as one of the advanced candidate technologies in order to provide more efficient structure health monitoring (SHM) solution in construction sites. In this paper, we proposed WSN monitoring framework in building sites based on 3D visualization and Augmented Reality (AR) in mobile devices. The proposed system applies 3D visualization and AR technology to camera-enabled mobile devices in WSN environment in order to gather much more information than before. Based on the proposed system, we made an experiment to validate the effectiveness of 3D and AR mode using collected data in IEEE 802.15.4-based WSN.

The structure of the nanograting channel MOSFET was optimized by simply rounding the corners of the nanogratings. The current drivabilities of the optimized nanograting channel MOSFETs were enhanced by about 20% and 50% for both n-channel and p-channel MOSFETs, respectively. The mobility changes were analyzed on the basis of channel stress as well as theoretical change of mobilities by various surface orientations. The internal compressive stress of 0.23% was measured in the channel. By suppressing the electric field increase at the corner edge of the nanograting channel to less than 10%, the fabricated rounded nanograting MOSFETs achieved lifetimes of NBTI and TDDB as long as those of conventional planar devices.

This report describes a quantification method for luminance non-uniformity of a large LED backlight. In experiments described herein, participants subjectively evaluated artificial indistinct Mura images that simulated luminance non-uniformity of an LED backlight. We measured the luminance distribution of the Mura images. Then, the measured luminance distribution was converted into S-CIELAB, in which anisotropic properties of the spatial frequency response of human vision were considered. Subsequently, some indexes for the quantification model were extracted. We conducted multiple regression analyses using the subjective evaluation value and the index values obtained from measured luminance of Mura image. We proposed a quantification model consisting of four indexes: high and low luminance area, number of Mura edges, sum of Mura edge areas, and maximum luminance difference.

In wireless sensor networks (WSNs), geographic routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Geographic routing with location errors may produce serious problems such as disconnected links and data transmission delays. In this letter, we present an efficient location error compensation algorithm for the geographic routing. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

Signals received at the interrogator of an RFID system always suffer from various kinds of channel deformation factors, such as the path loss of the wireless channel, insufficient channel bandwidth resulted from the multipath propagation, and the carrier frequency offset between tags and interrogators. In this paper we proposed a novel Viterbi-based algorithm for joint detection of data sequence and compensation of distorted signal waveform. With the assumption that the transmission clock is exactly synchronized at the reader, the proposed algorithm takes advantage of the structured data-encoded waveform to represent the modulation scheme of the RFID system as a trellis diagram and then the Viterbi algorithm is applicable to perform data sequence estimation. Furthermore, to compensate the distorted symbol waveform, the proposed Jiggle-Viterbi algorithm generates two substates, each corresponding to a variant structure waveform with adjustable temporal support, so that the symbol waveform deformation can be compensated and therefore yield a significant better performance in terms of bit error rate. Computer simulations shows that even in the presence of a moderate carrier frequency offset, the proposed approach can work out with an acceptable accuracy on data sequence detection.

Recently, novel full-diversity full-rate quasi-orthogonal space-time block codes (QSTBCs) with power scaling and double-symbol maximum likelihood (ML) decoding was proposed. Specifically, the codes can achieve full-diversity through linearly combining two adequately power scaled orthogonal space-time block codes (OSTBCs). In this letter, we derive expressions for mutual information and post-processing signal-to-noise ratio (SNR) for a system with four transmit antennas. By exploiting these formulas, we propose three transmit antenna grouping (TAG) methods for a closed-loop system with low-rate feedback information. The TAG methods make it possible to provide an excellent error-rate performance even with a low-complexity zero-forcing (ZF) detection, especially in spatially correlated fading channels.

Binary maximal-length sequences (or m-sequences) are sequences of period 2m-1 generated by a linear recursion of degree m. Decimating an m-sequence {st} by an integer d relatively prime to 2m-1 leads to another m-sequence {sdt} of the same period. The crosscorrelation of m-sequences has many applications in communication systems and has been an important and well studied problem during more than 40 years. This paper presents an updated survey on the crosscorrelation between binary m-sequences with at most five-valued crosscorrelation and shows some of the many recent connections of this problem to several areas of mathematics such as exponential sums and Dickson polynomials.

This paper presents an autonomous traffic engineering framework, named ATE, a highly efficient data dissemination mechanism for multipath data forwarding in Wireless Sensor Networks (WSNs). The proposed ATE has several salient features. First, ATE utilizes three coordinating schemes: an incipient congestion inference scheme, an accurate link quality estimation scheme and a dynamic traffic diversion scheme. It significantly minimizes packet drops due to congestion by dynamically and adaptively controlling the data traffic over congested nodes and/or poorer quality links, and by opportunistically exploiting under-utilized nodes for traffic diversion, while minimizing the estimation and measurement overhead. Second, ATE can provide with high application fidelity of the network even for increasing values of bit error rates and node failures. The proposed link quality estimation and congestion inference schemes are light weight and distributed, improving the energy efficiency of the network. Autonomous Traffic Engineering has been evaluated extensively via NS-2 simulations, and the results have shown that ATE provides a better performance with minimum overhead than those of existing approaches.

In this paper, we propose two new chosen-ciphertext (CCA) secure schemes from the computational Diffie-Hellman (CDH) and bilinear computational Diffie-Hellman (BCDH) assumptions. Our first scheme from the CDH assumption is constructed by extending Cash-Kiltz-Shoup scheme. This scheme yields the same ciphertext as that of Hanaoka-Kurosawa scheme (and thus Cramer-Shoup scheme) with cheaper computational cost for encryption. However, key size is still the same as that of Hanaoka-Kurosawa scheme. Our second scheme from the BCDH assumption is constructed by extending Boyen-Mei-Waters scheme. Though this scheme requires a stronger underlying assumption than the CDH assumption, it yields significantly shorter key size for both public and secret keys. Furthermore, ciphertext length of our second scheme is the same as that of the original Boyen-Mei-Waters scheme.

This letter examines the problem of allocating the subcarrier power of the relayed signal in orthogonal frequency division multiplexing (OFDM) based dual-hop systems in which the relay terminal is operated in an Amplify-and-Forward (AF) mode and the source node transmits its signal with a uniform power distribution. In AF relaying systems, both the modulation order and the error control scheme are fixed at the relay node, and thus the potential for increasing the data rate via a suitable allocation of the subcarrier power at the relay node does not exist. Therefore, this study proposes an alternative subcarrier power allocation scheme in which the objective is to scale the power assigned to each of the relayed signal sub-carriers in such a way as to minimize the equivalent average noise power at the destination terminal.