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

Keyword Search Result

[Keyword] (42756hit)

39701-39720hit(42756hit)

  • FOREWORD

    Akira MARUOKA  Yasubumi SAKAKIBARA  Osamu WATANABE  

     
    FOREWORD

      Vol:
    E75-D No:4
      Page(s):
    403-404
  • Periodic Solutions in the Hodgkin-Huxley Equations for Muscle

    Kazuko TERADA  Shuji YOSHIZAWA  Chiaki NISHIMURA  

     
    LETTER

      Vol:
    E75-A No:7
      Page(s):
    928-930

    Bifurcations of the periodic solutions of the space-clamped Hodgkin-Huxley equations for the muscle membrane are studied regarding the chloride conductance as a parameter. A limit cycle appears at a Hopf bifurcation and disappears at a homoclinic orbit. With high sodium permeability, a subcritical period doubling bifurcation occurs before it disappears.

  • Intelligent Network Service Operation Architecture

    Hiroshi TOKUNAGA  Yukuo KIRIHARA  

     
    PAPER

      Vol:
    E75-B No:7
      Page(s):
    617-623

    The establishment of an intelligent network service operation architecture is important for facilitating development and integration of service operation systems. To do this, the basic concepts and goals of service operation items must first be clarified. Then, the necessary procedures as well as the required data on the behaviors of customers, operators and operation systems must be described. These various points are discussed based on an operation study methodology.

  • FOREWORD

    Tadao SAITO  Tetsuya MIKI  Kazuo MURANO  Hiroyuki OKAZAKI  

     
    FOREWORD

      Vol:
    E75-B No:7
      Page(s):
    539-540
  • Design of Three-Dimensional Digital Filters for Video Signal Processing via Decomposition of Magnitude Specifications

    Masayuki KAWAMATA  Takehiko KAGOSHIMA  Tatsuo HIGUCHI  

     
    PAPER-Design and Implementation of Multidimensional Digital Filters

      Vol:
    E75-A No:7
      Page(s):
    821-829

    This paper proposes an efficient design method of three-dimensional (3-D) recursive digital filters for video signal processing via decomposition of magnitude specifications. A given magnitude specification of a 3-D digital filter is decomposed into specifications of 1-D digital filters with three different (horizontal, vertical, and temporal) directions. This decomposition can reduce design problems of 3-D digital filters to design problems of 1-D digital filters, which can be designed with ease by conventional methods. Consequently, design of 3-D digital filters can be efficiently performed without complicated tests for stability and large amount of computations. In order to process video signal in real time, the 1-D digital filters with temporal direction must be causal, which is not the case in horizontal and vertical directions. Since the proposed method can approximate negative magnitude specifications obtained by the decomposition with causal 1-D R filters, the 1-D digital filters with temporal direction can be causal. Therefore the 3-D digital filters designed by the proposed method is suitable for real time video signal processing. The designed 3-D digital filters have a parallel separable structure having high parallelism, regularity and modularity, and thus is suitable for high-speed VLSI implementation.

  • The Use of the Fornasini-Marchesini Second Model in the Frequency-Domain Design of 2-D Digital Filters

    Takao HINAMOTO  Hideki TODA  

     
    INVITED PAPER

      Vol:
    E75-A No:7
      Page(s):
    759-766

    Based on the Fornasini-Marchesini second model, an efficient algorithm is developed to derive the characteristic polynomial and the inverse of the system matrix from the state-space parameters. As a result, the external description of the Fornasini-Marchesini second model is clarified. A technique for designing 2-D recursive digital filters in the frequency domain is then presented by using the Fornasini-Marchesini second model. The resulting filter approximates both magnitude and group delay specifications and its stability is always guaranteed. Finally, three design examples are given to illustrate the utility of the proposed technique.

  • Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks

    Hisao KAMEDA  Yongbing ZHANG  

     
    PAPER-Computer Networks

      Vol:
    E75-D No:4
      Page(s):
    535-542

    Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.

  • FOREWORD

    Rokuya ISHII  

     
    FOREWORD

      Vol:
    E75-A No:7
      Page(s):
    897-897
  • A Method of Generating Tests for Combinational Circuits with Multiple Faults

    Hiroshi TAKAHASHI  Nobukage IUCHI  Yuzo TAKAMATSU  

     
    PAPER-Fault Tolerant Computing

      Vol:
    E75-D No:4
      Page(s):
    569-576

    The single fault model is invalid in many cases. However, it is very difficult to generate tests for all multiple faults since an m-line circuit may have 3m --1 multiple faults. In this paper, we describe a method for generating tests for combinational circuits with multiple stuck-at faults. An input vector is a test for a fault on a target line, if it find the target line to be fault-free in the presence of undetected or undetectable lines. The test is called a robust test for fault on a target line. It is shown that the sensitizing input-pair for a completely single sensitized path can be a robust test-pair. The method described here consists of two procedures. We label these as SINGLE_SEN" procedure and DECISION" procedure. SINGLE_SEN generates a single sensitized path including a target line on it by using a PODEM-like method which uses a new seven-valued calculus. DECISION determines by utilizing the method proposed by H. Cox and J. Rajski whether the single sensitizing input-pair generated by the SINGLE_SEN is a robust test-pair. By using these two procedures the described method generates robust test-pairs for the combinational circuit with multiple stuck-at faults. Finally, we demonstrate by experimental results on the ISCAS85 benchmark circuits that SINGLE_SEN is effective for an algorithmic multiple fault test generation for circuits not including many XOR gates.

  • An Efficient One-Pass Search Algorithm for Parsing Spoken Language

    Michio OKADA  

     
    PAPER-Speech

      Vol:
    E75-A No:7
      Page(s):
    944-953

    Spoken language systems such as speech-to-speech dialog translation systems have been gaining more attention in recent years. These systems require full integration of speech recognition and natural language understanding. This paper presents an efficient parsing algorithm that integrates the search problems of speech processing and language processing. The parsing algorithm we propose here is regarded as an extension of the finite-state-network directed, one-pass search algorithm to one directed by a context-free grammar with retention of the time-synchronous procedure. The extended search algorithm is used to find approximately globally optimal sentence hypotheses; it does not have overhead which exists in, for example, hierarchical systems based on the lattice parsing approach. The computational complexity of this search algorithm is proportional to the length of the input speech. As the search process in the speech recognition can directly take account of the predictive information in the sentence parsing, this framework can be extended to sopken language systems which deal with dynamically varying constraints in dialogue situations.

  • Wavelet Picture Coding with Transform Coding Approach

    Mutsumi OHTA  Mitsuharu YANO  Takao NISHITANI  

     
    INVITED PAPER

      Vol:
    E75-A No:7
      Page(s):
    776-785

    A novel coding scheme using orthonormal wavelet transform is proposed. Various forms of transform coding and subband coding are first reviewed. Then a wavelet coding method is proposed adopting a new approach similar to the one used for transform coding. The approach differs to conventional ones which considers wavelet coding as a class of subband coding. Simulation work is carried out to evaluate the proposed coding method. Significant improvement is obtained in subjective quality, and some improvement is also obtained in signal to noise ratio. Wavelet coding is still in its early stage of development, but can be considered to be a promising technique for image coding.

  • Native Oxide Growth on Hydrogen-Terminated Silicon Surfaces

    Tatsuhiro YASAKA  Masaru TAKAKURA  Kenichi SAWARA  Shigeo UENAGA  Hiroshi YASUTAKE  Seiichi MIYAZAKI  Masataka HIROSE  

     
    PAPER

      Vol:
    E75-C No:7
      Page(s):
    764-769

    Hydrogen termination of HF-treated Si surfaces and the oxidation kinetics have been studied by x-ray photoelectron spectroscopy (XPS) and Fourier Transform Infrared Spectroscopy (FT-IR) Attenuated Total Reflection (ATR). The oxidation of hydrogen-terminated Si in air or in pure water proceeds parallel to the surface presumably from step edges, resulting in the layer-by-layer oxidation. The oxide gryowth rate on an Si(100) surface is faster than (110) and (111) when the wafer is stored in pure water. This is interpreted in terms of the steric hindrance against molecular oxygen penetration throughth the (110) and (111) surfaces where the atom void size is equal to or smaller than O2 molecule. The oxide growth rate in pure water for heavily doped n-type Si is significantly high compared to that of heavily doped p-type Si. This is explained by the conduction electron tunneling from Si to absorbed O2 molecule to form the O2- state. O2- ions easily decompose and induce the surface electric field, enhancing the oxidation rate. It is found that the oxidation of heavily doped n-type Si in pure water is effectively suppressed by adding a small amount (1003600 ppm) of HCl.

  • A 15 GFLOPS Parallel DSP System for Super High Definition Image Processing

    Tomoko SAWABE  Tetsurou FUJII  Hiroshi NAKADA  Naohisa OHTA  Sadayasu ONO  

     
    INVITED PAPER

      Vol:
    E75-A No:7
      Page(s):
    786-793

    This paper describes a super high definition (SHD) image processing system we have developed. The computing engine of this system is a parallel processing system with 128 processing elements called NOVI- HiPIPE. A new pipelined vector processor is introduced as a backend processor of each processing element in order to meet the great computing power required by SHD image processing. This pipelined vector processor can achieve 120 MFLOPS. The 128 pipelined vector processors installed in NOVI- HiPIPE yield a total system peak performance of 15 GFLOPS. The SHD image processing system consists of an SHD image scanner, and SHD image storage node, a full color printer, a film recorder, NOVI- HiPIPE, and a Super Frame Memory. The Super Frame Memory can display a ful color moving image sequence at a rate of 60 fps on a CRT monitor at a resolution of 2048 by 2048 pixels. Workstations, interconnected through an Ethernet, are used to control these units, and SHD image data can be easily transfered among the units. NOVI- HiPIPE has a frame memory which can display SHD still images on a color monitor, therefore, one processed frame can be directly displayed. We are developing SHD image processing algorithms and parallel processing methodologies using this system.

  • FOREWORD

    Kotaro HIRANO  

     
    FOREWORD

      Vol:
    E75-A No:7
      Page(s):
    757-758
  • Multidimensional Signal Processing for NTSC TV Signals

    Takahiko FUKINUKI  Norihiro SUZUKI  

     
    INVITED PAPER

      Vol:
    E75-A No:7
      Page(s):
    767-775

    Multidimensional signal processing has recently been attracting attention in various fields, and has been studied theoretically. TV receives using 3-D (3-Dimensional: horizontal, vertical and temporal) processing, such as IDTV (ImproveD TV), are already available. In addition, television systems with high quality video and mostly with wide-aspect ratio are being studied worldwide. All the proposed systems adopt 3-D signal processing. 3-D processing can fully utilize the transmitted signal, and can take full advantage of the available bandwidth. This results in improved picture quality. This paper reviews the 3-D signal processing used in IDTV and EDTV (EnhanceD TV) in Japan. Video signals are analyzed in the 3-D frequency domain, and 3-D filter design is also studied.

  • Evaluation of Statistical Cell Multiplexing Effects and Path Capacity Design in ATM Networks

    Youichi SATO  Ken-ichi SATO  

     
    PAPER-Communication Networks and Service

      Vol:
    E75-B No:7
      Page(s):
    642-648

    This paper provides an analytical method to evaluate the cell loss probability in ATM (Asyncronous Transfer Mode) networks employing statistical cell multiplexing. A fairly simple design procedure for path/link capacity is also developed. It is demonstrated that the proposed method yields a conservative capacity value over the entire range examined. This was confirmed by comparing the results obtained through the proposed method with computer simulation results. The method yields a link capacity design approach that can effectively handle different bandwidth and types of VPs within the same link. Evaluations show that the method allows 10% to 1400% more traffic than possible with the peak bandwidth allocation scheme in the parameter range we examined; the specified cell loss probability is set at 10-9. As a result, it is shown that the proposed analytical procedure to evaluate the cell loss probability in statistical cell multiplexing, and the path/link capacity design method are effective and practical even though they use fairly simple procedures.

  • Property of Circular Convolution for Subband Image Coding

    Hitoshi KIYA  Kiyoshi NISHIKAWA  Masahiko SAGAWA  

     
    PAPER-Image Coding and Compression

      Vol:
    E75-A No:7
      Page(s):
    852-860

    One of the problems with subband image coding is the increase in image sizes caused by filtering. To solve this, it has been proposed to process the filtering by transforming input sequence into a periodic one. Then filtering is implemented by circular convolution. Although this technique solves the problem, there are very strong restrictions, i.e., limitation on the filter type and on the filter bank structure. In this paper, development of this technique is presented. Consequently, any type of linear phase FIR filter and any structure of filter bank can be used.

  • Reaction of H-Terminated Si(100) Surfaces with Oxidizer in the Heating and Cooling Process

    Norikuni YABUMOTO  Yukio KOMINE  

     
    PAPER

      Vol:
    E75-C No:7
      Page(s):
    770-773

    Thermal desorption spectroscopy (TDS) is applied to analyze the oxidation reactions of hydrogen-terminated Si(100) surfaces in both the heating and cooling processes after hydrogen desorption. The oxidation reaction of oxygen and water with a silicon surface after hydrogen desorption shows hysteresis in the heating and cooling processes. In the cooling process, oxidation finishes when the silicon surface is adequately oxidized to about a 10 thickness. Oxidation continues to occur at lower temperatures when the total volume of oxygen and water is too small to saturate the bare silicon surface. The reaction of water with silicon releases hydrogen at more than 500. Hydrogen does not adsorb on the silicon oxide surface. A trace amount of oxygen, less than 110-6 Torr, roughens the surface.

  • Chemical Structures of Native Oxides Formed during Wet Chemical Treatments of Silicon Surfaces

    Hiroki OGAWA  Takeo HATTORI  

     
    PAPER

      Vol:
    E75-C No:7
      Page(s):
    774-780

    Chemical structures of native oxides formed during wet chemical treatments of silicon surfaces were investigated using X-ray Photoelectron Spectroscopy (XPS) and Fourier Transformed Infrared. Attenuated Total Reflection (FT-IR-ATR). It was found that the amounts of Si-H bonds in native oxide and at native oxide/ silicon interface are negligibly small in the case of native oxides formed in H2SO4-H2O2 solution. Based on this discovery, it was found that native oxides can be characterized by the amount of Si-H bonds in the native oxide and the combination of various wet chemical treatments with the treatment in NH4OH-H2O2-H2O solution results in the drastic decrease in the amount of Si-H bonds in the native oxides.

  • Dynamic Path Assignment for Broadband Networks Based on Neural Computation

    Akira CHUGO  Ichiro IIDA  

     
    PAPER

      Vol:
    E75-B No:7
      Page(s):
    634-641

    This paper describes the application of a neural network to the optimal routing problem in broadband multimedia networks, where the objective is to maximize network utilization while considering the performance required for each call. In a multimedia environment, the performance required for each call is different, and an optimal path must be found whenever a call arrives. A neural network is appropriate for the computation of an optimal path, as it provides real-time solutions to difficult optimization problems. We formulated optimal routing based on the Hop field neural network model, and evaluated the basic behavior of neural networks. This evaluation confirmed the validity of the neural network formulation, which has a small computation time even if there are many nodes. This characteristic is especially suitable for a large-scale system. In addition, we performed a computer simulation of the proposed routing scheme and compared it with conventional alternate routing schemes. The results show the benefit of neural networks for the routing problem, as our scheme always balances the network load and attains high network utilization.

39701-39720hit(42756hit)