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

Keyword Search Result

[Keyword] bus(380hit)

261-280hit(380hit)

  • A Power Reduction Scheme for Data Buses by Dynamic Detection of Active Bits

    Masanori MUROYAMA  Akihiko HYODO  Takanori OKUMA  Hiroto YASUURA  

     
    PAPER

      Vol:
    E87-C No:4
      Page(s):
    598-605

    To transfer a small number, we inherently need a small number of bits. However all bit lines on a data bus change their status and redundant power is consumed. To reduce the redundant power consumption, we introduce a concept named active bit. In this paper, we propose a power reduction scheme for data buses using active bits. Suppressing switching activity of inactive bits, we can reduce redundant power consumption. We propose various power reduction techniques using active bits and the implementation methods. Experimental results illustrate up to 54.2% switching activity reduction.

  • Memory Data Organization for Low-Energy Address Buses

    Hiroyuki TOMIYAMA  Hiroaki TAKADA  Nikil D. DUTT  

     
    PAPER

      Vol:
    E87-C No:4
      Page(s):
    606-612

    Energy consumption has become one of the most critical constraints in the design of portable multimedia systems. For media applications, address buses between processor and data memory consume a considerable amount of energy due to their large capacitance and frequent accesses. This paper studies impacts of memory data organization on the address bus energy. Our experiments show that the address bus activity is significantly reduced by 50% through exploring memory data organization and encoding address buses.

  • A Robust Blind Image Watermarking Scheme Based on Vector Quantization

    Soo-Chang PEI  Jun-Horng CHEN  

     
    PAPER-Image

      Vol:
    E87-A No:4
      Page(s):
    912-919

    Watermarking schemes have been extensively discussed and developed recently. People are usually facing the dilemma of two factors, robustness and transparency. To achieve these requirements, embedding the watermark message in the transform domain or the spatial domain is usually considered. In this paper, we will propose a blind image watermarking scheme based on vector quantization. By exploiting a modified binary tree splitting method, a stable codebook could be generated so that the watermark message could be novelly embedded and survive the JPEG compression and the Gaussian noise addition. The embedded message could be extracted without referring the host image. It makes the scheme more practical.

  • Discrete Simulation of Reactive Flow with Lattice Gas Automata

    Kazuhiro YAMAMOTO  

     
    PAPER

      Vol:
    E87-D No:3
      Page(s):
    740-744

    Normally, flow field is described with governing equations, such as the Navier-Stokes equations. However, for complex flow including multiphase and reactive flow such as combustion, this approach may not be suitable. As an alternative approach, Lattice Gas Automata (LGA) has been used to simulate fluid with mesoscopic particles by assuming that space and time are discrete, and the physical quantities take only a finite set of values. In this study, the model for combustion simulation is proposed, with the reaction probability depending on the local temperature to simplify the chemical reaction. Here, counter-flow twin flames are simulated. In order to validate this approach, some results of non-reactive flow are presented, compared with those by solving Navier-Stokes equations.

  • Nonlinear Observer Design via Approximate Normal Form: Ball and Beam System on a Vibrating Frame

    Juhoon BACK  Nam H. JO  Young I. SON  Hyungbo SHIM  Jin H. SEO  

     
    PAPER-Systems and Control

      Vol:
    E87-A No:3
      Page(s):
    716-724

    There exists a class of nonlinear systems which fail to have a well-defined relative degree but have a robust relative degree. We have removed the full relative degree assumption which the previous results required, and have provided a local state observer for nonlinear systems that have robust relative degree γ n and have detectability property in some sense. The proposed observer utilizes the coordinate change which transforms the system into an approximate normal form. Using the proposed method, we constructed an observer for the ball and beam system on a vibrating frame. Simulation results reveal that substantial improvement in the performance is achieved compared with other local observers.

  • An Efficient FEC Method for High-Quality Video Transmission on the Broadband Internet

    Tohru KONDO  Kouji NISHIMURA  Reiji AIBARA  

     
    PAPER-Multicast

      Vol:
    E87-B No:3
      Page(s):
    643-650

    FEC (Forward Error Correction) can repair the damage to communication quality due to packet loss. The growing requirement of FEC for high-quality video transmission is inevitable on broadband networks. We have designed and implemented FEC, and integrated it to our developed video transmission system named "mpeg2ts." Our goal is to make it possible to deploy this system on the broadband Internet. However, the problem with constant redundancy of FEC is that weakness to fluctuation of network condition. To resolve this problem, in this paper, we propose and evaluate an efficient FEC method for high-quality video transmission. The proposed mechanisms can provide robustness as well as saving of processing load and optimization of bandwidth consumption. Moreover, we integrate it into a system to deploy it on the real broadband Internet. Transmission experiment demonstrates availability of developed system deployed on the network.

  • Geometrically Invariant Watermarking Based on Gravity Center

    Ke DING  Chen HE  Ling-ge JIANG  Hong-xia WANG  

     
    LETTER-Information Security

      Vol:
    E87-A No:2
      Page(s):
    513-515

    A novel geometrically invariant watermarking scheme based on gravity center is presented which treating the geometrically invariant gravity centers of host image and its supplement image as reference points. Thus watermark synchronization is obtained. Simulation results show the effectiveness of our scheme to the geometrical distortion including rotation and/or scaling.

  • Robust Extended Kalman Filtering via Krein Space Estimation

    Tae Hoon LEE  Won Sang RA  Seung Hee JIN  Tae Sung YOON  Jin Bae PARK  

     
    PAPER-Systems and Control

      Vol:
    E87-A No:1
      Page(s):
    243-250

    A new robust extended Kalman filter is proposed for the discrete-time nonlinear systems with norm-bounded parameter uncertainties. After linearization of the nonlinear systems, the uncertainties described by the energy bounded constraint can be converted into an indefinite quadratic cost function to be minimized. The solution to the minimization problem is given by the extended Kalman filter derived in a Krein space, which leads to a robust version of the extended Kalman filter. Since the resulting robust filter has the same structure as a standard extended Kalman filter, the proposed filter can be readily designed by simply including the uncertainty terms in its formulas. The results of simulations are presented to demonstrate that the proposed filter achieves the robustness against parameter variation and performs better than the standard extended Kalman filter.

  • Robust Projection onto Normalized Eigenspace Using Relative Residual Analysis and Optimal Partial Projection

    Fumihiko SAKAUE  Takeshi SHAKUNAGA  

     
    PAPER-Reconstruction

      Vol:
    E87-D No:1
      Page(s):
    34-41

    The present paper reports a robust projection onto eigenspace that is based on iterative projection. The fundamental method proposed in Shakunaga and Sakaue and involves iterative analysis of relative residual and projection. The present paper refines the projection method by solving linear equations while taking noise ratio into account. The refinement improves both the efficiency and robustness of the projection. Experimental results indicate that the proposed method works well for various kinds of noise, including shadows, reflections and occlusions. The proposed method can be applied to a wide variety of computer vision problems, which include object/face recognition and image-based rendering.

  • Irredundant Low Power Address Bus Encoding Techniques Based on Adaptive Codebooks

    Satoshi KOMATSU  Masahiro FUJITA  

     
    PAPER-Power Optimization

      Vol:
    E86-A No:12
      Page(s):
    3001-3008

    The power dissipation at the off-chip bus has become a significant part of the overall power dissipation in micro-processor based digital systems. This paper presents irredundant address bus encoding methods which reduce signal transitions on the instruction address buses by using adaptive codebook methods. These methods are based on the temporal locality and spatial locality of instruction address. Since applications tend to JUMP/BRANCH to limited sets of addresses, proposed encoding methods assign the least signal transition codes to the addresses of JUMP/BRANCH operations in the past. In addition, our methods can be easily applicable for conventional digital systems since they are irredundant encoding methods. Our encoding methods reduce the signal transitions on the instruction address buses, which results in the reduction of total power dissipation of digital systems. Experimental results show that our methods can reduce the signal transition by an average of 88%.

  • The Stability Issues of Linear Perturbed Systems with Projection Approach

    Chih-Peng HUANG  Shi-Ting WANG  Yau-Tarng JUANG  

     
    PAPER-Systems and Control

      Vol:
    E86-A No:11
      Page(s):
    2830-2835

    This paper presents a distinct approach to the robustness stability analysis and design of linear uncertain systems. Based on the extension version of the projection method, the specific stability issue, which ensures the poles within a specific region, can be efficiently analyzed. Furthermore, we derive a simple design scheme for a class of uncertain systems. By the proposed numerical algorithm, some examples are given to demonstrate the validity and effectiveness.

  • Loosely-Consistency Management Technology in Distributed Database Systems for Assurance

    Carlos PEREZ LEGUIZAMO  Dake WANG  Kinji MORI  

     
    PAPER-Agent-Based Systems

      Vol:
    E86-D No:10
      Page(s):
    2104-2113

    To meet the highly competitive and dynamic needs in the market, an e-Business company needs to flexibly integrate its heterogeneous database systems together, e.g., the integration of makers and retailers in a Supply Chain Management System (SCM). The customers demand one-click response and also their access requirements change too frequently. Moreover, different retailers and makers in a SCM, being the autonomous entities, have their own specific requirements for stock-cost and opportunity-loss, depending on their local situation that is also changing with time. Under this background, the integrated DBs of the SCM are required to provide real-time response, heterogeneity satisfaction and flexibility to adapt to changing requirements. The conventional approach of strict consistency leads to low response and less flexibility due to the strong interdependence of the systems. In this paper, Autonomous Decentralized Database System has been proposed as an application-oriented database technology based on the concept of autonomy and loose-consistency among the distributed DB systems thus providing real-time, flexibility and high availability. The autonomy in the system has been achieved by defining a data attribute, Allowable Volume, within which each component DB has autonomy to update the data in real-time. Moreover, the system adapts to the dynamically changing heterogeneous access requirements at each DB by managing the distribution of AV among different DBs through an active coordination mechanism. Due to the dynamic and unpredictable environment, the component DBs are provided with complete autonomy for their local and coordination decisions, thus diminishing the interdependency and improving the response time. As the system consists of loosely-connected subsystems, it also has high availability. Therefore, the proposed system provides highly decentralized architecture with flexibility and high availability. The performance of the system has been shown significantly effective by simulating the internet based SCM system, from the communication-cost and response time point of view.

  • Robustness of Morphological Filters

    Sari PELTONEN  Pauli KUOSMANEN  

     
    PAPER-Nonlinear Signal Processing and Coding

      Vol:
    E86-A No:9
      Page(s):
    2222-2228

    In this paper our recently introduced method called output distributional influence function (ODIF) is used for the evaluation of the robustness properties of the nonlinear filter class of morphological filters. Several examples of the ODIFs for the dilation, closing and clos-opening are given and explained carefully. For each of these morphological filters the effect of filter length is examined by using the ODIFs for the expectation and variance. The robustness properties of the filters are also compared to each other and the effect of the distribution of the contamination is investigated for the closing as an example of realistic filtering conditions.

  • Visualization of Brain Activities of Single-Trial and Averaged Multiple-Trials MEG Data

    Yoshio KONNO  Jianting CAO  Takayuki ARAI  Tsunehiro TAKEDA  

     
    PAPER-Neuro, Fuzzy, GA

      Vol:
    E86-A No:9
      Page(s):
    2294-2302

    Treating an averaged multiple-trials data or non-averaged single-trial data is a main approach in recent topics on applying independent component analysis (ICA) to neurobiological signal processing. By taking an average, the signal-to-noise ratio (SNR) is increased but some important information such as the strength of an evoked response and its dynamics will be lost. The single-trial data analysis, on the other hand, can avoid this problem but the SNR is very poor. In this study, we apply ICA to both non-averaged single-trial data and averaged multiple-trials data to determine the properties and advantages of both. Our results show that the analysis of averaged data is effective for seeking the response and dipole location of evoked fields. The non-averaged single-trial data analysis efficiently identifies the strength and dynamic component such as α-wave. For determining both the range of evoked strength and dipole location, an analysis of averaged limited-trials data is better option.

  • Robust Regularization for Enhanced Virtual Sound Imaging

    Jun YANG  Yew-Hin LIEW  Woon-Seng GAN  

     
    LETTER

      Vol:
    E86-A No:8
      Page(s):
    2061-2062

    This letter outlines a scheme to produce a wider robust bandwidth, with better approximations to the perfect reproduction of pre-recorded acoustic signals. Multi-parameter inverse filtering method is proposed in the virtual sound imaging system for improving the robustness performance. The superiority of this new type of inverse filter is demonstrated on a 3-speaker system.

  • Outlier Removal for Motion Tracking by Subspace Separation

    Yasuyuki SUGAYA  Kenichi KANATANI  

     
    PAPER-Image Processing, Image Pattern Recognition

      Vol:
    E86-D No:6
      Page(s):
    1095-1102

    Many feature tracking algorithms have been proposed for motion segmentation, but the resulting trajectories are not necessarily correct. In this paper, we propose a technique for removing outliers based on the knowledge that correct trajectories are constrained to be in a subspace of their domain. We first fit an appropriate subspace to the detected trajectories using RANSAC and then remove outliers by considering the error behavior of actual video tracking. Using real video sequences, we demonstrate that our method can be applied if multiple motions exist in the scene. We also confirm that the separation accuracy is indeed improved by our method.

  • Robust Bandpass Sampling for Frequency Instability

    Miheung CHOE  Hyunduk KANG  Kiseon KIM  

     
    LETTER-Wireless Communication Technology

      Vol:
    E86-B No:5
      Page(s):
    1685-1688

    To sample a band-limited analog signal directly from the high frequency down to the baseband for the digital signal processing with significantly reduced computation, several concepts of the bandpass sampling are introduced. In this paper, a robust bandpass sampling scheme when there exist frequency deviations due to the channel effect and hardware instability is proposed for practical use, and the effects of the frequency deviations are discussed to select a proper sampling frequency.

  • Convergence of Alternative C-Means Clustering Algorithms

    Kiichi URAHAMA  

     
    LETTER-Pattern Recognition

      Vol:
    E86-D No:4
      Page(s):
    752-754

    The alternative c-means algorithm has recently been presented by Wu and Yang for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.

  • Noise and Channel Distortion Robust ASR System for DARPA SPINE2 Task

    Konstantin MARKOV  Tomoko MATSUI  Rainer GRUHN  Jinsong ZHANG  Satoshi NAKAMURA  

     
    PAPER-Robust Speech Recognition and Enhancement

      Vol:
    E86-D No:3
      Page(s):
    497-504

    This paper presents the ATR speech recognition system designed for the DARPA SPINE2 evaluation task. The system is capable of dealing with speech from highly variable, real-world noisy conditions and communication channels. A number of robust techniques are implemented, such as differential spectrum mel-scale cepstrum features, on-line MLLR adaptation, and word-level hypothesis combination, which led to a significant reduction in the word error rate.

  • A Hierarchical Cost Estimation Technique for High Level Synthesis

    Mahmoud MERIBOUT  Masato MOTOMURA  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E86-A No:2
      Page(s):
    444-461

    The aim of this paper is to present a new cost estimation technique to synthesis hardware from high level circuit description. The scheduling and allocation processes are performed in alternative manner, while using realistic cost measurements models that account for Functional Unit (FU), registers, and multiplexers. This is an improvement over previous works, were most of them use very simple cost models that primarily focus on FU resources alone. These latest, however, are not accurate enough to allow effective design space exploration since the effects of storage and interconnect resources can indeed dominates the cost function. We tested our technique on several high-level synthesis benchmarks. The results indicate that the tool can generate near-optimal bus-based and multiplexer-based architectural models with lower number of registers and buses, while presenting high throughput.

261-280hit(380hit)