The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] tin(3578hit)

1001-1020hit(3578hit)

  • An Interference-Aware Clustering Based on Genetic Algorithm for Cell Broadcasting Service

    Kyungho JUN  Sekchin CHANG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E96-A No:12
      Page(s):
    2740-2744

    In this letter, we present a novel interference-aware clustering scheme for cell broadcasting service. The proposed approach is based on a genetic algorithm for re-clustering. Using the genetic algorithm, the suggested method efficiently re-clusters the user nodes when the relays fail in receiving the cell broadcasting message from the base station. The simulation results exhibit that the proposed clustering scheme can maintain much higher capacity than the conventional clustering scheme in the cases of relay outage. The re-clustering method based on genetic algorithm also shows lower complexity than the re-clustering approach based on exhaustive search.

  • Battery-Aware Task Mapping for Coarse-Grained Reconfigurable Architecture

    Shouyi YIN  Rui SHI  Leibo LIU  Shaojun WEI  

     
    PAPER

      Vol:
    E96-D No:12
      Page(s):
    2524-2535

    Coarse-grained Reconfigurable Architecture (CGRA) is a parallel computing platform that provides both high performance of hardware and high flexibility of software. It is becoming a promising platform for embedded and mobile applications. Since the embedded and mobile devices are usually battery-powered, improving battery lifetime becomes one of the primary design issues in using CGRAs. In this paper, we propose a battery-aware task-mapping method to optimize energy consumption and improve battery lifetime. The proposed method mainly addresses two problems: task partitioning and task scheduling when mapping applications onto CGRA. The task partitioning and scheduling are formulated as a joint optimization problem of minimizing the energy consumption. The nonlinear effects of real battery are taken into account in problem formulation. Using the insights from the problem formulation, we design the task-mapping algorithm. We have used several real-world benchmarks to test the effectiveness of the proposed method. Experiment results show that our method can dramatically lower the energy consumption and prolong the battery-life.

  • An Efficiency-Aware Scheduling for Data-Intensive Computations on MapReduce Clusters

    Hui ZHAO  Shuqiang YANG  Hua FAN  Zhikun CHEN  Jinghu XU  

     
    PAPER

      Vol:
    E96-D No:12
      Page(s):
    2654-2662

    Scheduling plays a key role in MapReduce systems. In this paper, we explore the efficiency of an MapReduce cluster running lots of independent and continuously arriving MapReduce jobs. Data locality and load balancing are two important factors to improve computation efficiency in MapReduce systems for data-intensive computations. Traditional cluster scheduling technologies are not well suitable for MapReduce environment, there are some in-used schedulers for the popular open-source Hadoop MapReduce implementation, however, they can not well optimize both factors. Our main objective is to minimize total flowtime of all jobs, given it's a strong NP-hard problem, we adopt some effective heuristics to seek satisfied solution. In this paper, we formalize the scheduling problem as job selection problem, a load balance aware job selection algorithm is proposed, in task level we design a strict data locality tasks scheduling algorithm for map tasks on map machines and a load balance aware scheduling algorithm for reduce tasks on reduce machines. Comprehensive experiments have been conducted to compare our scheduling strategy with well-known Hadoop scheduling strategies. The experimental results validate the efficiency of our proposed scheduling strategy.

  • Effective Implementation and Embedding Algorithms of CEPTA Method for Finding DC Operating Points

    Zhou JIN  Xiao WU  Dan NIU  Yasuaki INOUE  

     
    PAPER-Device and Circuit Modeling and Analysis

      Vol:
    E96-A No:12
      Page(s):
    2524-2532

    Recently, the compound element pseudo transient analysis, CEPTA, method is regarded as an efficient practical method to find DC operating points of nonlinear circuits when the Newton-Raphson method fails. In the previous CEPTA method, an effective SPICE3 implementation algorithm was proposed without expanding the Jacobian matrix. However the limitation of step size was not well considered. Thus, the non-convergence problem occurs and the simulation efficiency is still a big challenge for current LSI nonlinear cicuits, especially for some practical large-scale circuits. Therefore, in this paper, we propose a new SPICE3 implementation algorithm and an embedding algorithm, which is where to insert the pseudo capacitors, for the CEPTA method. The proposed implementation algorithm has no limitation for step size and can significantly improve simulation efficiency. Considering the existence of various types of circuits, we extend some possible embedding positions. Numerical examples demonstrate the improvement of simulation efficiency and convergence performance.

  • Dual-Stage Pseudo Power Gating with Advanced Clustering Algorithm for Gate Level Power Optimization

    Yu JIN  Zhe DU  Shinji KIMURA  

     
    PAPER-Logic Synthesis, Test and Verification

      Vol:
    E96-A No:12
      Page(s):
    2568-2575

    Pseudo Power Gating (Pseudo PG) is one of gate level power reduction methods for combinational circuits by stopping unnecessary input changes of gates. In Pseudo PG, an extra control signal might be added to a gate and other input changes of the gate are deactivated when the control signal takes the controlling value. To improve the power reduction capability, the paper newly introduces dual-stage Pseudo PG with advanced clustering algorithm where up to two extra control signals are added to a gate if effective. The advanced clustering algorithm selects the first control signal to be compatible with the second control signal based on the propagation of controlling condition via a path, with which candidates of controllable gates excluded by the maximum depth constraint can be controlled. Experimental results show that the proposed dual-stage Pseudo PG method has obtained 23.23% average power reduction with 5.28% delay penalty with respect to the original circuits, and has obtained 10.46% more power reduction with 2.75% delay penalty compared with respect to circuits applying the original single-stage Pseudo PG.

  • A New Face Relighting Method Based on Edge-Preserving Filter

    Lingyu LIANG  Lianwen JIN  

     
    LETTER-Computer Graphics

      Vol:
    E96-D No:12
      Page(s):
    2904-2907

    We propose a new face relighting method using an illuminance template generated from a single reference portrait. First, the reference is wrapped according to the shape of the target. Second, we employ a new spatially variant edge-preserving smoothing filter to remove the facial identity and texture details of the wrapped reference, and obtain the illumination template. Finally, we relight the target with the template in CIELAB color space. Experiments show the effectiveness of our method for both grayscale and color faces taken from different databases, and the comparisons with previous works demonstrate a better relighting effect produced by our method.

  • Time Shift Parameter Setting of Temporal Decorrelation Source Separation for Periodic Gaussian Signals

    Takeshi AMISHIMA  Kazufumi HIRATA  

     
    PAPER-Sensing

      Vol:
    E96-B No:12
      Page(s):
    3190-3198

    Temporal Decorrelation source SEParation (TDSEP) is a blind separation scheme that utilizes the time structure of the source signals, typically, their periodicities. The advantage of TDSEP over non-Gaussianity based methods is that it can separate Gaussian signals as long as they are periodic. However, its shortcoming is that separation performance (SEP) heavily depends upon the values of the time shift parameters (TSPs). This paper proposes a method to automatically and blindly estimate a set of TSPs that achieves optimal SEP against periodic Gaussian signals. It is also shown that, selecting the same number of TSPs as that of the source signals, is sufficient to obtain optimal SEP, and adding more TSPs does not improve SEP, but only increases the computational complexity. The simulation example showed that the SEP is higher by approximately 20dB, compared with the ordinary method. It is also shown that the proposed method successfully selects just the same number of TSPs as that of incoming signals.

  • Manufacture and Performance of a 60GHz-Band High-Efficiency Antenna with a Thick Resin Layer and the Feed through a Hole in a Silicon Chip

    Jun ASANO  Jiro HIROKAWA  Hiroshi NAKANO  Yasutake HIRACHI  Hiroshi ISONO  Atsushi ISHII  Makoto ANDO  

     
    PAPER-Antennas and Propagation

      Vol:
    E96-B No:12
      Page(s):
    3108-3115

    As a first step towards the realization of high-efficiency on-chip antennas for 60GHz-band wireless personal area networks, this paper proposes the fabrication of a patch antenna placed on a 200µm thick dielectric resin and fed through a hole in a silicon chip. Despite the large tan δ of the adopted material (0.015 at 50GHz), the thick resin reduces the conductor loss at the radiating element and a radiation efficiency of 78%, which includes the connecting loss from the bottom is predicted by simulation. This calculated value is verified in the millimeter-wave band by experiments in a reverberation chamber. Six stirrers are installed, one on each wall in the chamber, to create a statistical Rayleigh environment. The manufactured prototype antenna with a test jig demonstrates the radiation efficiency of 75% in the reverberation chamber. This agrees well with the simulated value of 76%, while the statistical measurement uncertainty of our handmade reverberation chamber is calculated as ±0.14dB.

  • Performance Evaluation of Neuro-ITI Canceller Using a Modified Writing Process for TDMR

    Masato YAMASHITA  Yoshihiro OKAMOTO  Yasuaki NAKAMURA  Hisashi OSAWA  Simon J. GREAVES  Hiroaki MURAOKA  

     
    BRIEF PAPER

      Vol:
    E96-C No:12
      Page(s):
    1504-1507

    The previously-proposed model of the writing process in TDMR is modified based on the Stoner-Wohlfarth reversal mechanism. The BER performance for a neuro-ITI canceller is obtained via computer simulation using the R/W channel model based on the writing process, and it is compared to those for well-known TDMR equalization techniques.

  • Equivalent Circuit of Aperture-Coupled Transmission-Line Cavities Involving Dielectric Loss and Wall Loss

    Shin-ichi MORIYAMA  

     
    PAPER-Electromagnetic Theory

      Vol:
    E96-C No:12
      Page(s):
    1525-1535

    The equivalent circuit of aperture-coupled cavities filled with a lossy dielectric is considered by means of an eigenmode expansion technique founded on the segmentation concept. It is different from a series LCR resonant circuit, and the resistor which symbolizes the dielectric loss is connected to the capacitor in parallel. If the cavities are formed by a short-circuited oversize waveguide, then the input admittance can be represented by the product of a coupling factor to the connected waveguide port and the equivalent admittance of the short-circuited waveguide. The transmission line model is effective even if lossy wall effect and dielectric partially-loading effect are considered. As a result, three-dimensional eigenmode parameters, such as the resonant frequency and the Q-factor, become dispensable and the computational complexity for the cavity simulation in the field of microwave heating is dramatically reduced.

  • Continuous Phase Modulation (CPM) Revisited: Using Time-Limited Phase Shaping Pulses

    Richard Hsin-Hsyong YANG  Chia-Kun LEE  Shiunn-Jang CHERN  

     
    PAPER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E96-B No:11
      Page(s):
    2828-2839

    Conventional CPM signals employ information sequence with time-unlimited phase shaping pulse (PSP) to achieve power and bandwidth efficient transmission. On the contrary, information sequence using time-limited PSP was believed to produce power-wasting data-independent discrete spectral lines in CPM spectra, and was suggested to be avoided. In this paper, we revisit this problem and adopt the time-limited PSP to replace the one with time-unlimited, it turns out to have an alternative solution to the CPM scheme. We first modify the spectral computing formula for the CPM with time-limited PSP (or CPM-TL) from conventional CPM formula and show that the discrete spectral lines appeared in the power density spectrum of CPM-TL signals can be diminished or become negligible by appropriately choosing PSP. We also show that this class of CPM can use any real number modulation index (h) and the resultant trellis structure of CPM guarantees the maximum constraint length allowed by the number of states in the MLSD receiver. Finally, the energy-bandwidth performance of CPM using time-limited PSP is investigated and compared with conventional CPM with time-unlimited PSP. From numerical results we show that, under the same number of states in the MLSD receiver and bandwidth occupancy, this subclass of CPM could outperform the conventional CPM up to 6dB coding gain, for h<1, in many cases.

  • Single-Wavelength Emission by Using 1 × N Active Multi-Mode Interferometer Laser Diode

    Yasuhiro HINOKUMA  Zhipeng YUEN  Teppei FUKUDA  Takahira MITOMI  Kiichi HAMAMOTO  

     
    PAPER-Lasers, Quantum Electronics

      Vol:
    E96-C No:11
      Page(s):
    1413-1419

    1 × N active multi-mode interferometer laser diode (MMI LD) is proposed and demonstrated to realize single-wavelength edge-emitter without using grating configuration. As the 1 × N active-MMI LDs are based on longitudinal mode interference, they have a potential of single-wavelength emission without incorporating any grating layer on/beneath active layer. The fabricated devices showed single-wavelength emission with a side mode suppression ratio (SMSR) of 12dB at a wavelength of 1.57µm.

  • Anticipatory Runway Incursion Prevention Systems

    Kai SHI  Yuichi GOTO  Zhiliang ZHU  Jingde CHENG  

     
    PAPER-Artificial Intelligence, Data Mining

      Vol:
    E96-D No:11
      Page(s):
    2385-2396

    Avoiding runway incursions is a significant challenge and a top priority in aviation. Due to all causes of runway incursions belong to human factors, runway incursion prevention systems should remove human from the system operation loop as much as possible. Although current runway incursion prevention systems have made big progress on how to obtain accurate and sufficient information of aircraft/vehicles, they cannot predict and detect runway incursions as early as experienced air traffic controllers by using the same surveillance information, and cannot give explicit instructions and/or suggestions to prevent runway incursions like real air traffic controllers either. In one word, human still plays an important position in current runway incursion prevention systems. In order to remove human factors from the system operation loop as much as possible, this paper proposes a new type of runway incursion prevention system based on logic-based reasoning. The system predicts and detects runway incursions, then gives explicit instructions and/or suggestions to pilots/drivers to avoid runway incursions/collisions. The features of the system include long-range prediction of incidents, explicit instructions and/or suggestions, and flexible model for different policies and airports. To evaluate our system, we built a simulation system, and evaluated our system using both real historical scenarios and conventional fictional scenarios. The evaluation showed that our system is effective at providing earlier prediction of incidents than current systems, giving explicit instructions and/or suggestions for handling the incidents effectively, and customizing for specific policies and airports using flexible model.

  • A Depth-Guided Inpainting Scheme Based on Foreground Depth-Layer Removal for High Quality 2D to 3D Video Conversion

    Jangwon CHOI  Yoonsik CHOE  Yong-Goo KIM  

     
    LETTER-Image Processing and Video Processing

      Vol:
    E96-D No:11
      Page(s):
    2483-2486

    This letter proposes a novel depth-guided inpainting scheme for the high quality hole-filling in 2D-to-3D video conversion. The proposed scheme detects and removes foreground depth layers in an image patch, enabling appropriate patch formation using only disoccluded background information. This background only patch formation helps to avoid the propagation of wrong depths over hole area, and thus improve the overall quality of converted 3D video experience. Experimental results demonstrate the proposed scheme provides visually much more pleasing inpainting results with better preserved object edges compared to the state-of-the-art depth-guided inpainting schemes.

  • Basics of Counting Statistics Open Access

    Jun OHKUBO  

     
    INVITED PAPER

      Vol:
    E96-B No:11
      Page(s):
    2733-2740

    In this paper, we briefly review the scheme of counting statistics, in which a probability of the number of monitored or target transitions in a Markov jump process is evaluated. It is generally easy to construct a master equation for the Markov jump process, and the counting statistics enables us to straightforwardly obtain basic equations of the counting statistics from the master equation; the basic equation is used to calculate the cumulant generating function of the probability of the number of target transitions. For stationary cases, the probability is evaluated from the eigenvalue analysis. As for the nonstationary cases, we review a numerical integration scheme to calculate the statistics of the number of transitions.

  • T-YUN: Trustworthiness Verification and Audit on the Cloud Providers

    Chuanyi LIU  Jie LIN  Binxing FANG  

     
    PAPER-Computer System

      Vol:
    E96-D No:11
      Page(s):
    2344-2353

    Cloud computing is broadly recognized as as the prevalent trend in IT. However, in cloud computing mode, customers lose the direct control of their data and applications hosted by the cloud providers, which leads to the trustworthiness issue of the cloud providers, hindering the widespread use of cloud computing. This paper proposes a trustworthiness verification and audit mechanism on cloud providers called T-YUN. It introduces a trusted third party to cyclically attest the remote clouds, which are instrumented with the trusted chain covering the whole architecture stack. According to the main operations of the clouds, remote verification protocols are also proposed in T-YUN, with a dedicated key management scheme. This paper also implements a proof-of-concept emulator to validate the effectiveness and performance overhead of T-YUN. The experimental results show that T-YUN is effective and the extra overhead incurred by it is acceptable.

  • A Robust Method for Recognition of Complicated Pulse Repetition Interval Modulations

    Mahmoud KESHAVARZI  Amir Mansour PEZESHK  Forouhar FARZANEH  Delaram AMIRI  

     
    LETTER-Communication Theory and Signals

      Vol:
    E96-A No:11
      Page(s):
    2306-2310

    After receiving emitted signals from various radars by electronic support measures (ESM) system, several processes are applied to signals such as: deinterleaving, recognition of pulse repetition interval (PRI) modulation, PRI estimation and etc. Indeed, recognition of PRI modulation is an essential task of ESM system. In this paper a novel and robust method for recognition of complicated PRI Modulations is presented. This method uses specifications such as distribution related to members of sequences obtained from first and second order derivation of TOAs around a constant value and continuity of these sequences to recognize the PRI modulation. Some numerical simulations are performed to illustrate the effectiveness of proposed method. Simulation results show high robustness of proposed method against noise (spurious and missing pulses) and unwanted jitter.

  • On-Chip Single-Inductor Dual-Output DC-DC Boost Converter Having Off-Chip Power Transistor Drive and Micro-Computer Controlled MPPT Modes

    Yasunobu NAKASE  Yasuhiro IDO  Tsukasa OISHI  Toru SHIMIZU  

     
    PAPER-Electronic Circuits

      Vol:
    E96-C No:11
      Page(s):
    1420-1427

    An on-chip SIDO DC-DC boost converter core that can be used for both battery and solar cell operating applications is proposed. The converter is able to supply a current of up to around 30mA with an on-chip driver and more than 100mA by using an off-chip power MOS driver. The cross regulation problem was solved by inserting an extra cycle. Efficiencies of 85% and 84% were achieved for each driving mode. Complicated maximum power point tracking (MPPT) controls are available for a solar cell operation. An embedded micro-computer can be used to calculate a complicated algorithm. The converter exploits 99% of the expected maximum power of the solar cell. The converter protects the leak current that flows through the solar cell when there is no light. The proposed protection circuits reduce the leak current by three orders of magnitude without any performance loss.

  • Speckle-Free Phosphor-Scattered Blue Light Emitted out of InGaN/GaN Laser Diode with Broadened Spectral Behavior for High Luminance White Lamp Applications Open Access

    Junichi KINOSHITA  Yoshihisa IKEDA  Yuji TAKEDA  

     
    INVITED PAPER

      Vol:
    E96-C No:11
      Page(s):
    1391-1398

    Ultra-high luminance lamps emitting white light with a well-scattered blue spectrum from InGaN/GaN laser diodes and a phosphor-converted yellow spectrum show speckle contrast values as low as LED. Spectral behavior of the laser diodes is analyzed to find the reason why such low values are obtained. As a result, the PWM-driven, multi-longitudinal mode with dynamically broadened line-width is found to have a great effect on reducing speckle contrast. Despite using the lasers, such speckle-free lamps are considered to be very suitable for high-luminance and other various lighting applications.

  • Cheating Detectable Secret Sharing Schemes for Random Bit Strings

    Wakaha OGATA  Toshinori ARAKI  

     
    PAPER-Cryptography and Information Security

      Vol:
    E96-A No:11
      Page(s):
    2230-2234

    In secret sharing scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of shares were shown in the situation of fixing the minimum successful cheating probability. Under the assumption that cheaters do not know the distributed secret, no efficient scheme is known which can distribute bit strings. In this paper, we propose an efficient scheme for distributing bit strings with an arbitrary access structure. When distributing a random bit string with threshold access structures, the bit length of shares in the proposed scheme is only a few bits longer than the lower bound.

1001-1020hit(3578hit)