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

Keyword Search Result

[Keyword] operation(397hit)

81-100hit(397hit)

  • Backhaul Assignment Design for MISO Downlinks with Multi-Cell Cooperation

    Fengfeng SHI  Wei XU  Jiaheng WANG  Chunming ZHAO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E97-B No:6
      Page(s):
    1166-1174

    Multi-cell cooperation is a promising technique to mitigate inter-cell interference arising from universal frequency reuse in cellular networks. Sharing channel state information (CSI) in neighboring cells can help enhance the overall system capacity at the cost of high feedback burden. In this paper, an asymmetric CSI feedback strategy is proposed for multi-cell cooperation beamforming. In order to improve the overall system performance, we optimize the limited feedback bandwidth based on the average received power from both serving and neighboring cells. Simulation results show that the proposed strategy utilizes the limited feedback bandwidth more efficiently, thereby achieving a higher sum rate.

  • A New Hybrid Approach for Privacy Preserving Distributed Data Mining

    Chongjing SUN  Hui GAO  Junlin ZHOU  Yan FU  Li SHE  

     
    PAPER-Artificial Intelligence, Data Mining

      Vol:
    E97-D No:4
      Page(s):
    876-883

    With the distributed data mining technique having been widely used in a variety of fields, the privacy preserving issue of sensitive data has attracted more and more attention in recent years. Our major concern over privacy preserving in distributed data mining is the accuracy of the data mining results while privacy preserving is ensured. Corresponding to the horizontally partitioned data, this paper presents a new hybrid algorithm for privacy preserving distributed data mining. The main idea of the algorithm is to combine the method of random orthogonal matrix transformation with the proposed secure multi-party protocol of matrix product to achieve zero loss of accuracy in most data mining implementations.

  • Effect of Multivariate Cauchy Mutation in Evolutionary Programming

    Chang-Yong LEE  Yong-Jin PARK  

     
    PAPER-Fundamentals of Information Systems

      Vol:
    E97-D No:4
      Page(s):
    821-829

    In this paper, we apply a mutation operation based on a multivariate Cauchy distribution to fast evolutionary programming and analyze its effect in terms of various function optimizations. The conventional fast evolutionary programming in-cooperates the univariate Cauchy mutation in order to overcome the slow convergence rate of the canonical Gaussian mutation. For a mutation of n variables, while the conventional method utilizes n independent random variables from a univariate Cauchy distribution, the proposed method adopts n mutually dependent random variables that satisfy a multivariate Cauchy distribution. The multivariate Cauchy distribution naturally has higher probabilities of generating random variables in inter-variable regions than the univariate Cauchy distribution due to the mutual dependence among variables. This implies that the multivariate Cauchy random variable enhances the search capability especially for a large number of correlated variables, and, as a result, is more appropriate for optimization schemes characterized by interdependence among variables. In this sense, the proposed mutation possesses the advantage of both the univariate Cauchy and Gaussian mutations. The proposed mutation is tested against various types of real-valued function optimizations. We empirically find that the proposed mutation outperformed the conventional Cauchy and Gaussian mutations in the optimization of functions having correlations among variables, whereas the conventional mutations showed better performance in functions of uncorrelated variables.

  • Wireless Self-Powered Urinary Incontinence Sensor for Disposable Diapers

    Ami TANAKA  Takakuni DOUSEKI  

     
    PAPER

      Vol:
    E97-B No:3
      Page(s):
    587-593

    A self-powered urinary-incontinence sensor with a flexible wire-type urine-activated battery has been developed as an application for wireless biosensor networks. It is disposable and can be embedded in a diaper. The battery consists of two long film-type line electrodes printed on a flexible plastic sheet that abuts the absorbent material of the diaper. It conforms to the shape of the diaper when the diaper is worn. The stress produced by the curvature of the diaper presses the electrodes firmly against the diaper material, providing greater contact with any urine present. Thus, the battery generates more power than when it is flat, as in an unworn diaper. To verify the effectiveness of the battery, we fabricated a battery and a prototype sensor, which consists of an intermittent-power-supply circuit and a wireless transmitter, and embedded the battery in a diaper. The anode of the battery also acts as a wide ground plane for the antenna of the wireless transmitter, which radiates a large amount of power. When 80cc of urine is poured onto the diaper, the battery outputs a voltage of around 1V, which allows the sensor to transmit an ID signal over a distance of 5m every 40 seconds or so.

  • Development of a Device to Measure Movement of Gaze and Hand

    Kei KIKUCHI  Hideaki TAKAHIRA  Ryouichi ISHIKAWA  Eiki WAKAMATSU  Tatsuya SHINKAWA  Mitsuho YAMADA  

     
    LETTER

      Vol:
    E97-A No:2
      Page(s):
    534-537

    We developed a device to measure gaze and hand movement in a natural setting such as while reading a book on a train or bus. We examined what kind of cooperation exists among the head, eye and hand movements while subjects were reading a book held in the hand.

  • Cell Clustering Algorithm in Uplink Network MIMO Systems with Individual SINR Constraints

    Sang-Uk PARK  Jung-Hyun PARK  Dong-Jo PARK  

     
    LETTER-Communication Theory and Signals

      Vol:
    E97-A No:2
      Page(s):
    698-703

    This letter deals with a new cell clustering problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints in uplink network MIMO systems, where multiple base stations (BSs) cooperate for joint processing as forming a cluster. We first prove that the SINRs of users in a certain cluster always increase monotonically as the cluster size increases when the receiver filter that maximizes the SINR is used. Using this result, we propose an efficient clustering algorithm to minimize the maximum number of cooperative BSs in a cluster. Simulation results show that the maximum number of cooperative BSs minimized by the proposed method is close to that minimized by the exhaustive search and the proposed scheme outperforms the conventional one in terms of the outage probability.

  • A Novel Adaptive Interference Admission Control Method for Layered Partially Non-orthogonal Block Diagonalization for Base Station Cooperative MIMO

    Yusuke OSHIMA  Anass BENJEBBOUR  Kenichi HIGUCHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E97-B No:1
      Page(s):
    155-163

    This paper proposes a novel method for adaptively controlling the admission of interference to users in our previously proposed layered partially non-orthogonal block diagonalization (BD) precoding method for downlink multiuser multiple-input multiple-output (MIMO) transmission that employs cooperation among multiple base stations (BSs). The proposed method is applicable when some of the instantaneous channel state information (CSI) feedback between the user equipment and the respective BSs is missing if the path loss between the user equipment and BS is higher than a predetermined threshold. The proposed method suppresses the loss in the transmitter diversity (beam forming) gain caused by the perfect nulling of inter-user interference in BD. By allowing the inter-user interference from a link that has a high average path loss, the overall throughput performance of simple BD is enhanced. We show that the combination of layered transmission that restricts the set of BSs used for the signal transmission and adaptive control of interference admission significantly increases the throughput of BS cooperative multiuser MIMO with partial CSI feedback.

  • A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations

    Ryusuke UEDERA  Satoshi FUJITA  

     
    PAPER

      Vol:
    E96-D No:12
      Page(s):
    2713-2719

    In this paper, we propose a new buffer map notification scheme for Peer-to-Peer Video-on-Demand systems (P2P VoDs) which support VCR operations such as fast-forward, fast-backward, and seek. To enhance the fluidity of such VCR operations, we need to refine the size of each piece as small as possible. However, such a refinement significantly degrades the performance of buffer map notification schemes with respect to the overhead, piece availability and the efficiency of resource utilizations. The basic idea behind our proposed scheme is to use a piece-based buffer map with a segment-based buffer map in a complementary manner. The result of simulations indicates that the proposed scheme certainly increases the accuracy of the information on the piece availability in the neighborhood with a sufficiently low cost, which reduces the intermittent waiting time of each peer by more than 40% even under a situation in which 50% of peers conduct the fast-forward operation over a range of 30% of the entire video.

  • Multilane Hashing Mode Suitable for Parallel Processing

    Hidenori KUWAKADO  Shoichi HIROSE  

     
    PAPER-Information Security

      Vol:
    E96-A No:12
      Page(s):
    2434-2442

    A hash function is an important primitive for cryptographic protocols. Since algorithms of well-known hash functions are almost serial, it seems difficult to take full advantage of recent multi-core processors. This paper proposes a multilane hashing (MLH) mode that achieves both of high parallelism and high security. The MLH mode is designed in such a way that the processing speed is almost linear in the number of processors. Since the MLH mode exploits an existing hash function as a black box, it is applicable to any hash function. The bound on the indifferentiability of the MLH mode from a random oracle is beyond the birthday bound on the output length of an underlying primitive.

  • Deployment of OpenFlow/SDN Technologies to Carrier Services Open Access

    Yoichi SATO  Ichiro FUKUDA  Tomonori FUJITA  

     
    INVITED PAPER

      Vol:
    E96-B No:12
      Page(s):
    2946-2952

    The use of computing resources on network is becoming active in the Internet and private networks. OpenFlow/Software-Defined Networking (SDN) is drawing attention as a method to control network virtualization for the cloud computing services and other carrier services. This paper introduces examples of OpenFlow/SDN technologies applied to commercial cloud services. Various activities to expand coverage over commercial carrier networks are also mentioned.

  • Standard Cell Structure with Flexible P/N Well Boundaries for Near-Threshold Voltage Operation

    Shinichi NISHIZAWA  Tohru ISHIHARA  Hidetoshi ONODERA  

     
    PAPER-Physical Level Design

      Vol:
    E96-A No:12
      Page(s):
    2499-2507

    This paper propose a structure of standard cells where the P/N boundary ratio of each cell can be independently customized for near-threshold operation. Lowering the supply voltage is one of the most promising approaches for reducing the power consumption of VLSI circuit, however, this causes an increase of imbalance between rise and fall delays for cells having transistor stacks. Conventional cell library with fixed P/N boundary is not efficient to compensate this delay imbalance. Proposed structure achieves individual P/N boundary ratio optimization for each standard cell, therefore it cancels the imbalance between rise and fall delays at the expense of cell area. Proposed structure is verified using measured result of Ring Oscillator circuits and simulation result of benchmark circuits in 65nm CMOS. The experiments with ISCAS'85 benchmark circuits demonstrate that the standard cell library consisting of the proposed cells reduces the power consumption of the benchmark circuits by 16% on average without increasing the circuit area, compared to that of the same circuit synthesized with a library which is not optimized for the near-threshold operation.

  • Dual-Edge-Triggered Flip-Flop-Based High-Level Synthesis with Programmable Duty Cycle

    Keisuke INOUE  Mineo KANEKO  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E96-A No:12
      Page(s):
    2689-2697

    This paper addresses a high-level synthesis (HLS) using dual-edge-triggered flip-flops (DETFFs) as memory elements. In DETFF-based HLS, the duty cycle becomes a manageable resource to improve the timing performance. To utilize the duty cycle radically, a programmable duty cycle (PDC) mechanism is built into this HLS, and captured by a new HLS task named PDC scheduling. As a first step toward DETFF-based HLS with PDC, the execution time minimization problem is formulated for given results of operation scheduling. A linear program is presented to solve this problem in polynomial time. As a next step, simultaneous operation scheduling and PDC scheduling problem for the same objective is tackled. A mixed integer linear programming-based (MILP) approach is presented to solve this problem. The experimental results show that the MILP can reduce the execution time for several benchmarks.

  • A Steganographic Scheme Based on Formula Fully Exploiting Modification Directions

    Wen-Chung KUO  Ming-Chih KAO  

     
    PAPER-Cryptography and Information Security

      Vol:
    E96-A No:11
      Page(s):
    2235-2243

    Many EMD-type data hiding schemes have been proposed. However, the data hiding capacity is less than 2bpp when the embedding procedure uses formula operations. In order to improve the data hiding capacity from 1bpp to 4.5bpp, a new data hiding scheme is proposed in this paper based on a formula using the fully exploiting modification directions method (FEMD). By using our proposed theorem, the secret data can be embedded by formula operations directly without using a lookup matrix. The simulation results and performance analysis show the proposed scheme not only maintains good embedding capacity and stegoimage quality but also solves the overflow problem. It does so without using extra memory resources and performs within a reasonable computing time. The resource usage and capabilities of this scheme are well matched to the constraints and requirements of resource-scarce mobile devices.

  • S-Band GaN on Si Based 1kW-Class SSPA System for Space Wireless Applications

    Yuta KOBAYASHI  Satoshi YOSHIDA  Zen-ichi YAMAMOTO  Shigeo KAWASAKI  

     
    PAPER

      Vol:
    E96-C No:10
      Page(s):
    1245-1253

    An S-band GaN on Si based 1kW-class SSPA system for space wireless applications is proposed. Since high-efficiency and high-reliability amplifier is one of the most important technologies for power and communication systems in a future space base station on a planet, compact, high-power, and high-efficiency SSPA is strongly requested instead of TWTA. Thus, we adopt GaN on Si based amplifier due to its remarkable material properties. At the beginning, thermal vacuum and radiation test of GaN on Si are conducted so as to confirm the space applicability. Fabricated SSPA system consists of eight 200W HPAs and coaxial waveguide power combiner. It achieves high efficiency such as 57% of drain efficiency and 87% of combining efficiency when RF output power achieves more than 60dBm. Furthermore, long-term stable operation and good phase noise characteristics are also confirmed.

  • Design Equations for Off-Nominal Operation of Class E Amplifier with Nonlinear Shunt Capacitance at D=0.5

    Tadashi SUETSUGU  Xiuqin WEI  Marian K. KAZIMIERCZUK  

     
    PAPER-Energy in Electronics Communications

      Vol:
    E96-B No:9
      Page(s):
    2198-2205

    Design equations for satisfying off-nominal operating conditions of the class E amplifier with a nonlinear shunt capacitance for a grading coefficient of 0.5 and the duty cycle D=0.5 are derived. By exploiting the off-nominal class E operation, various amplifier parameters such as input voltage, operating frequency, output power, and load resistance can be set as design specifications. As a result of the analysis in this paper, the following extension of the usability of the class E amplifier was achieved. With rising up the dc supply voltage, the shunt capacitance which achieves the off-nominal operation can be increased. This means that a transistor with higher output capacitance can be used for ZVS operation. This also means that maximum operating frequency which achieves ZVS can be increased. An example of a design procedure of the class E amplifier is given. The theoretical results were verified with an experiment.

  • Identification of Smallest Unacceptable Combinations of Simultaneous Component Failures in Information Systems

    Kumiko TADANO  Jianwen XIANG  Fumio MACHIDA  Yoshiharu MAENO  

     
    PAPER

      Vol:
    E96-D No:9
      Page(s):
    1941-1951

    Large-scale disasters may cause simultaneous failures of many components in information systems. In the design for disaster recovery, operational procedures to recover from simultaneous component failures need to be determined so as to satisfy the time-to-recovery objective within the limited budget. For this purpose, it is beneficial to identify the smallest unacceptable combination of component failures (SUCCF) which exceeds the acceptable cost for recovering the system. This allows us to know the limitation of the recovery capability of the designed recovery operation procedure. In this paper, we propose a technique to identify the SUCCF by predicting the required cost for recovery from each combination of component failures with and without two-person cross-check of execution of recovery operations. We synthesize analytic models from the description of recovery operation procedure in the form of SysML Activity Diagram, and solve the models to predict the time-to-recovery and the cost. An example recovery operation procedure for a commercial database management system is used to demonstrate the proposed technique.

  • A Session State Migration Architecture for Flexible Server Consolidation

    Takeshi USUI  Kiyohide NAKAUCHI  Yozo SHOJI  Yoshinori KITATSUJI  Hidetoshi YOKOTA  Nozomu NISHINAGA  

     
    PAPER

      Vol:
    E96-B No:7
      Page(s):
    1727-1741

    This paper proposes a session state migration architecture for flexible server consolidation. One of technical challenges is how to split a session state from a connection and bind the session state to another connection in any servers. A conventional server and client application assumes that a session state is statically bound to a connection once the connection has been established. The proposed architecture reduces the migration latency, compared to an existing study by splitting the session state from the connection. This paper classifies common procedures of session state migration for various services. The session state migration architecture enables service providers to conduct server maintenance at their own convenience, and to conserve energy consumption at servers by consolidating them. A simulation to evaluate server consolidation reveals that the session state migration reduces the number of servers for accommdating users, compared to virtual machine migration. This paper also shows implementation of the session state migration architecture. Experimental results reveal that the impact caused by the proposed architecture on real-time applications is small.

  • MSE-Based Robust Precoder Design in Multicell Downlink Systems

    Cong-gai LI  Chen HE  Ling-ge JIANG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E96-A No:5
      Page(s):
    1017-1020

    To mitigate the inter-cell interference in multicell downlink systems, this letter consider the robust precoder design for multicell cooperation where the knowledge of channel state available at the base station is imperfect. Assuming that imperfect channel state information (CSI) can be exchanged among cells but with no data sharing, we investigate the worst-case performance optimization problem with bounded CSI error. Our objective is to minimize the weighted sum mean-square-error (MSE) subject to per-base-station power constraints. A distributed solution is obtained by reformulating the upper bound of MSE and exploiting the Lagrangian method for the optimal problem. Simulation results demonstrate that the proposed algorithm is robust to guarantee the worst-case sum rate performance and has lower computational complexity than the SINR-based design.

  • Fine-Grained Run-Tume Power Gating through Co-optimization of Circuit, Architecture, and System Software Design Open Access

    Hiroshi NAKAMURA  Weihan WANG  Yuya OHTA  Kimiyoshi USAMI  Hideharu AMANO  Masaaki KONDO  Mitaro NAMIKI  

     
    INVITED PAPER

      Vol:
    E96-C No:4
      Page(s):
    404-412

    Power consumption has recently emerged as a first class design constraint in system LSI designs. Specially, leakage power has occupied a large part of the total power consumption. Therefore, reduction of leakage power is indispensable for efficient design of high-performance system LSIs. Since 2006, we have carried out a research project called “Innovative Power Control for Ultra Low-Power and High-Performance System LSIs”, supported by Japan Science and Technology Agency as a CREST research program. One of the major objectives of this project is reducing the leakage power consumption of system LSIs by innovative power control through tight cooperation and co-optimization of circuit technology, architecture, and system software designs. In this project, we focused on power gating as a circuit technique for reducing leakage power. Temporal granularity is one of the most important issue in power gating. Thus, we have developed a series of Geysers as proof-of-concept CPUs which provide several mechanisms of fine-grained run-time power gating. In this paper, we describe their concept and design, and explain why co-optimization of different design layers are important. Then, three kinds of power gating implementations and their evaluation are presented from the view point of power saving and temporal granularity.

  • Development and Evaluation of a Wide Range Impulse Current Generator for Surge Arrester Testing

    Kuo-Hsiung TSENG  Ching-Lin HUANG  Pei-Yu CHENG  Zih-Ciao WEI  

     
    PAPER-Measurement Technology

      Vol:
    E96-A No:3
      Page(s):
    713-720

    This paper is focused on discussing a low-voltage system for lightning, and in particular the testing equipment of surge arresters. Only by demonstrating the performance and applicability of arresters can we seek the most feasible and economic low-voltage solutions. After performing repeated experiments with the same testing samples, using different testing equipment, we compare the different test results in order to select the most suitable and applicable testing equipment. In addition, the basis of a surge current parameter design theory is confirmed and verified through the test results using a simple and compact Impulse Current Generator to test a wide range of samples. By performing the actual analyzes and experiments, we can understand deeply how R, L, and C affect surge current, current wave, and current wave time. The ideal testing equipment standards have been set as follows: (1) Test Voltage up to 20 kV; (2) Expand current range from 1.5 kA to 46.5 kA, with resolution 1.5 kA; and (3) Simple operational procedures.

81-100hit(397hit)