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

Keyword Search Result

[Keyword] Al(20498hit)

18861-18880hit(20498hit)

  • A Modified Normalized LMS Algorithm Based on a Long-Term Average of the Reference Signal Power

    Akihiro HIRANO  Akihiko SUGIYAMA  

     
    PAPER

      Vol:
    E78-A No:8
      Page(s):
    915-920

    This paper proposes a modified normalized LMS algorithm based on a long-term average of the reference input signal power. The reference input signal power for normalization is estimated by using two leaky integrators with a short and a long time constants. Computer simulation results compare the performance of the proposed algorithm with some previosuly proposed adaptive-step algorithms. The proposed algorithm converges faster than the conventional adaptive-step algorithms. Almost 30dB of the ERLE (Echo Return Loss Enhancement), which is comparable to the conventional algorithms, is achieved in noisy environments.

  • Minimax Approach for Logical Configuration in Reconfigurable Virtual Circuit Data Networks

    Chang Sup SUNG  Sung Ki PARK  

     
    PAPER-Graphs and Networks

      Vol:
    E78-A No:8
      Page(s):
    1029-1033

    This paper condiders a problem of logecal configuration in reconfigurable VCDN (Virtual Circuit Data Networks) which is analyzed through a mimimax approach, and its objective is to minimize the largest delay on any logical link, measured in both queueing delay and propagation delay. The problem is formulated as a 0/1 mixed integer programming and analyzed by decomposing it into two subproblems, called routing and dimensioning problems, for which an efficient hauristic algorithm is proposed in an iterating process made beween the two subproblems for solution improvement. The algorithm is tested for its performance eveluation.

  • Spectrum Broadening of Telephone Band Signals Using Multirate Processing for Speech Quality Enhancement

    Hiroshi YASUKAWA  

     
    LETTER

      Vol:
    E78-A No:8
      Page(s):
    996-998

    This paper describes a system that can enchance the speech quality degradation due to severe band limitation during speech transmission. We have already proposed a spectrum widening method that utilizes aliasing in sampling rate conversion and digital filtering for spectrum shaping. This paper proposes a new method that offers improved performance in terms of the spectrum distortion characteristics. Implementation procedures are clarified, and its performance is discussed. The proposed method can effectively enhance speech quality.

  • Design of Discrete Coefficient FIR Linear Phase Filters Using Hopfield Neural Networks

    Xi ZHANG  Hiroshi IWAKURA  

     
    PAPER

      Vol:
    E78-A No:8
      Page(s):
    900-904

    A novel method is presented for designing discrete coeffcient FIR linear phase filters using Hopfield neural networks. The proposed method is based on the minimization of the energy function of Hopfield neural networks. In the proposed method, the optimal solution for each filter gain factor is first searched for, then the optimal filter gain factor is selected. Therefore, a good solution in the specified criterion can be obtained. The feature of the proposed method is that it can be used to design FIR linear phase filters with different criterions simultaneously. A design example is presented to demonstrate The effectiveness of the proposed method.

  • Network Issues for Universal Mobility

    Masami YABUSAKI  Akihisa NAKAJIMA  

     
    INVITED PAPER

      Vol:
    E78-A No:7
      Page(s):
    764-772

    The advance of mobile network and radio techniques has been rapidly expanding the service area for mobile terminals. Thus, mobile communications have been devoted to the improvement of terminal mobility (TM). Recently, the personal mobility (PM) concept appeared which gives a freedom to use personal telecommunication numbers at any terminal. Therefore, mobile network must next enable a user to access telecommunication services with his/her personal telecommunication number from any terminal at any geographic location. In other words, the mobile network must implement universal mobility (UM) that integrates TM and PM. This paper first provides a definition of UM. Next, it describes the identity and number configurations for UM and then presents network techniques for UM, i.e., the network architecture and UM management procedures. It also presents the current status of standardization on UM in the Personal Digital Cellular system (PDC) and Future Public Land Mobile Telecommunication Systems (FPLMTS).

  • A Conceptual Study of a Navigation and Communication Satellite System

    Kenichi INAMIYA  Katsumi SAKATA  

     
    PAPER-Satellite Communication

      Vol:
    E78-B No:7
      Page(s):
    1065-1074

    A new concept for a navigation and communication satellite system has been proposed. The navigation satellite system that forms the basis of the proposed system has been studied by one of the authors and extended to add a mobile communication function to the system. The satellite system consists of 15 satellites in quasi-geostationary orbit (QGEO) that have a geostationary altitude and high inclination and provide global coverage and positioning capability to the observer through only reception of the range measurement signals generated at the satellites, which are in the same configuration as the satellites in Global Positioning System (GPS), Three satellites out of the 15 satellite are designated to install a subsystem for mobile satellite communication in order to satisfy mobile communication convenience as required in a Future Air Navigation System's (FANS) concept of International Civil Aviation Organization (ICAO). The case studies of 15-satellites constellations demonstrate not only an acceptable positioning accuracy over the whole globe, but also an accuracy distribution weighted on the north pole region as an example of a weighted accuracy distribution. The addition of a mobile communication function suggests a unified system of satellite navigation and communication, which might provide convenience for the civil aviation industry, because the two functions currently depend on different systems.

  • Dynamic Neural Network Derived from the Olfactory System with Examples of Applications

    Koji SHIMOIDE  Walter J. FREEMAN  

     
    PAPER-Neural Networks

      Vol:
    E78-A No:7
      Page(s):
    869-884

    The dynamics of an artificial neural network derived from a biological system, and its two applications to engineering problems are examined. The model has a multi-layer structure simulating the primary and secondary components in the olfactory system. The basic element in each layer is an oscillator which simulates the interactions between excitatory and inhibitory local neuron populations. Chaotic dynamics emerges from interactions within and between the layers, which are connected to each other by feedforward and feedback lines with distributed delays. A set of electroencephalogram (EEG) obtained from mammalian olfactory system yields aperiodic oscillation with 1/f characteristics in its FFT power spectrum. The EEG also reveals abrupt state transitions between a basal and an activated state. The activated state with each inhalation consists of a burst of oscillation at a common time-varying instantaneous frequency that is spatially amplitude-modulated (AM). The spatial pattern of the activated state seems to represent the class of the input ot the system, which simulates the input from sensory receptors. The KIII model of the olfactory system yields sustained aperiodic oscillation with "1/f" spectrum by adjustment of its parameters. Input in the form of a spatially distributed step funciton induces a state transition to an activated state. This property gives the model its utility in pattern classification. Four different methods (SD, RMS, PCA and FFT) were applied to extract AM patterns of the common output wave forms of the model. The pattern classification capability of the model was evaluated, and synchronization of the output wave form was shown to be crucial in PCA and FFT methods. This synchronization has also been suggested to have an important role in biological systems related to the information extraction by spatiotemporal integration of the output of a transmitting area of cortex by a receiving area.

  • Frequency-Dependent Finite-Difference Time-Domain Analysis of High-Tc Superconducting Asymmetric Coplanar Strip Line

    Masafumi HIRA  Yasunobu MIZOMOTO  Sadao KURAZONO  

     
    PAPER-Superconductive Electronics

      Vol:
    E78-C No:7
      Page(s):
    873-877

    This paper describes analytical results of high-Tc superconducting asymmetric coplanar strip lines using the frequency-dependent finite-difference time-domain method. The propagation constants of the YBa2Cu3O7-x asymmetric coplanar strip line fabricated on the LiNbO3 substrate are reported. The effect of the SiO2 buffer layer is also investigated.

  • The Firing Squad Synchronization Problem in Defective Cellular Automata

    Martin KUTRIB  Roland VOLLMAR  

     
    PAPER-Automata, Languages and Theory of Computing

      Vol:
    E78-D No:7
      Page(s):
    895-900

    The firing squad synchronization problem is considered for defective cellular automata. A lower bound of time tf for the problem is derived. The state complexity to solve the problem is investigated and it is shown that the state set has to be arbitrary large to obtain solutions of time complexity (n). For memory-augmented defective cellular automata a tf-time solution is given.

  • Design of Autonomous TPG Circuits for Use in Two-Pattern Testing

    Kiyoshi FURUYA  Seiji SEKI  Edward J. McCLUSKEY  

     
    PAPER

      Vol:
    E78-D No:7
      Page(s):
    882-888

    A method to design one-dimensional cellular arrays to be used as TPG circuits of BIST is described. The interconnections between cells are not limited to adjacent ones but allowed to some neighbors. Completely regular structures that have full-transition coverages for every k-dimensional subspace of state variables are first shown. Then, almost regular arrays which can operate on maximum cycles are derived based on fast parallel implementations of LFSRs.

  • A New Conformance Testing Technique for Localization of Multiple Faults in Communication Protocols

    Yoshiaki KAKUDA  Hideki YUKITOMO  Shinji KUSUMOTO  Tohru KIKUNO  

     
    PAPER

      Vol:
    E78-D No:7
      Page(s):
    802-810

    Conformance testing techniques are required for the efficient production of reliable communication protocols. A lot of conformance testing techniques have been developed. However, most of them can only decide whether an implemented protocol conforms to its specification. That is, the exact locations of faults are not determined by them. This paper presents some conditions that enable to find locations of multiple faults, and then proposes a test sequence generation technique under such conditions. The correctness proof and complexity analysis of the proposed technique are also given. The characteristics of this technique are to generate test sequences based on protocol specifications and interim test results, and to find locations of multiple faults in protocol implementations. Although the length of the test sequence generated by the proposed technique is a little longer than the one generated by the previous one, the class to which the proposed technique can be applied is larger than that to which the previous one can be applied.

  • Error Probability of ALOHA Systems with Controlled Output Power

    Mitsuyuki KISHIMOTO  Ikuo OKA  Chikato FUJIWARA  

     
    PAPER

      Vol:
    E78-A No:7
      Page(s):
    805-811

    We consider slotted ALOHA systems with a controlled output power level. The systems were proposed to improve the throughput performance by the capture effect. However widely used linear modulation systems have no capture effect, and a power level distribution dominates the performance in those systems. In this paper we consider linear modulation systems employing PSK. We introduce an average error probability of the highest power signal as a performance measure, and a uniform distribution is applied to the error probability analysis. Numerical results show the superiority of the systems with uniform distribution to a conventional slotted ALOHA in a heavy traffic condition. On the other hand, in a light traffic condition, the optimal power distribution which minimizes the error probability is obtained for 2-level ALOHA. We also propose the power level selection method to search the optimal power level. The validity of analytical results are confirmed by simulations.

  • Use of a Monte Carlo Wiring Yield Simulator to Optimize Design of Random Logic Circuits for Yield Enhancement

    Hideyuki FUKUHARA  Takao KOMATSUZAKI  Katsushi BOKU  Yoichi MIYAI  

     
    PAPER

      Vol:
    E78-C No:7
      Page(s):
    852-857

    There is general trend toward larger chip size and tighter layout due to customer requests of loading more and more functions on single chip. This trend makes yield difficult to be maintained high enough, since larger amount of defects are distributed on such large and tight-ruled chips. To overcome such a situation, RADLYS (RAnDom Logic Yield Simulator) and DD-TEG (Defect Density TEG) have been developed. DD-TEG extracts defect size distribution and its amount automatically, while RADLYS simulates defects on any layout and outputs yield based on the extracted defect size distribution. Critical layout from yield point of view can be found in this procedure. DD-TEG and RADLYS are used as a set of parameter extraction and simulation of the SPICE. In this paper, we introduce these tools and showed two application results. The predicted yield showed a good agreement with the actual yield in the first application (Optical Device A). Critical layout at the Local I/O portion was found in the second application (Random Logic portion of Memory Device B) and the layout was changed based on the RADLYS results.

  • Retiming for Sequential Circuits with a Specified Initial State and Its Application to Testability Enhancement

    Hiroyuki YOTSUYANAGI  Seiji KAJIHARA  Kozo KINOSHITA  

     
    PAPER

      Vol:
    E78-D No:7
      Page(s):
    861-867

    Retiming is a technique to resynthesize a synchronous sequential circuit by rearranging flip-flops. In view of logic optimization, retiming can potentially derive a circuit which is more simplified and testable because retiming can convert several sequential redundancies into combinational redundancies. Retiming methods proposed before have no guarantee to generate the same output sequences when the circuit start from a specified initial state such as the reset state. If the circuit with a specified initial state must have the same output sequences after retiming, rearrangement of flip-flops should be restricted. This paper presents a retiming method for circuits with a specified initial state so that retimed circuits give the same output sequences of the original circuits for any input sequences. In the proposed method, during the procedure of retiming each flip-flop keeps a value corresponding to the initial state and unification of flip-flops with different value is avoided. Our procedures uses 5-valued logic on gate level implementation to describe and calculate the values of flip-flops. Therefore after optimization using our method, the circuit has completely the same behavior as that of the original. Experimental results for ISCAS'89 benchmark circuits show the method can be used to optimize the circuits as well as a method without considering the initial state. And testability of the retimed circuit is more enhanced than that of the original circuit.

  • A Design Method of All-Pass Networks Based on the Eigen Filter Method with Consideration of the Stability

    Yasuhiro TOGURI  Masaaki IKEHARA  

     
    LETTER-Digital Signal Processing

      Vol:
    E78-A No:7
      Page(s):
    885-889

    In this paper we present a design method for all-pass networks with consideration of the stability. It is based on the eigen filter method and Remez exchange algorithm is used to obtain the equiripple phase error solution. In the iteration of the proposed algorithm, the eigen values besides maximum eigen value are used in order to obtain a stable all-pass networks.

  • Design of a 3.3 V Single Power-Supply 64 Mbit Flash Memory with Dynamic Bit-Line Latch (DBL) Programming Scheme

    Hiroshi SUGAWARA  Toshio TAKESHIMA  Hiroshi TAKADA  Yoshiaki S. HISAMUNE  Kohji KANAMORI  Takeshi OKAZAWA  Tatsunori MUROTANI  Isao SASAKI  

     
    PAPER

      Vol:
    E78-C No:7
      Page(s):
    825-831

    A 3.3 V single power-supply 64 Mb flash memory with a DBL programming scheme has been developed and fabricated with 0.4 µm CMOS technology. 50 ns access time and 256 b erase/programming unit-capacity have been achieved by using hierarchical word- and bit-line structures and DBL programming scheme. Furthermore in order to lower operating voltage the HiCR cell is used. The chip size is 19.3 mm13.3 mm.

  • Analysis of an Alternating-Service Tandem Queue with Server Vacations and Conversion Relationships between the Performance Measures

    Tsuyoshi KATAYAMA  

     
    LETTER-Communication Networks and Service

      Vol:
    E78-B No:7
      Page(s):
    1075-1079

    This paper gives several explicit formulas for the waiting times in each stage in an alternating-service, two-stage tandem queue (M/G/1 type queue) with a gate in the first stage and server vacations (or setup time). These formula are obtained by using simple conversion relationships between the performance measures. This study has been motivated by the performance evaluation of call (packet or message) processing in telecommunication switching systems.

  • Multi-Point Virtual Space Teleconferencing System

    Haruo NOMA  Yasuichi KITAMURA  Tsutomu MIYASATO  Fumio KISHINO  

     
    PAPER

      Vol:
    E78-B No:7
      Page(s):
    970-979

    This paper discussed a distributed processing architecture for a virtual space teleconferencing system. Virtual space teleconferencing is a promising application field for networked virtual environments. People in different places will be able to meet each other in a virtual teleconferencing room and proceed with various cooperative tasks. When such a system creates a realistic virtual environment, it can be referred to as a "Teleconferencing with realistic sensations" system. Further more, as the conference environment can be shared by a number of users, it is possible to perform various kinds of cooperative work using the system. In this paper, the architecture for networked multi-user virtual space systems are classified, and then a case study is described for building a proposed teleconferencing system. The system reproduces a 3D image of each conference participant in a virtual meeting room. Compared with the former system, the new system can deal with more than three participants at the same time and can connect them through commercial telephone lines. Based on the virtual world database management structure, the system was classified as a central server system. However, a central server architecture limits the number of conference sites. We confirmed that the system can serve up to 14 sites using multi-modal interaction without significant latency in operation from summational experiments. Then, introducing some assumptions to the results, we have proposed processing model of the system. The results of model could describe the experimental results and we could indicate roughy estimated system capacity to realize a requaied system performance.

  • A Fast Dynamic Algorithm for Storage Allocation in Telecommunication Networks

    Yoshiaki TANAKA  Olivier BERLAGE  

     
    PAPER-Communication Networks and Service

      Vol:
    E78-B No:7
      Page(s):
    1025-1032

    This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.

  • Design of Highly Reliable Optical Fiber Cable Network in Access Networks

    Motoi IWASHITA  Hisao OIKAWA  Hideo IMANAKA  Ryuji TOYOSHIMA  

     
    PAPER-Communication Networks and Service

      Vol:
    E78-B No:7
      Page(s):
    1033-1042

    Currently there is considerable world-wide speculation regarding the introduction of optical fiber cable into access networks, because optical fiber has a big potential for providing attractive multimedia services. Since optical fiber cable can provide a variety of grade of services, high-reliability of cable networks would be required compared with the conventional copper cable networks. To develop multimedia telecommunication networks as an infrastructure, it is urgent to clarify the highly reliable optical fiber cable network architecture. Since cable network architecture deeply depends on regional conditions such as demand, area size, duct layer networks (consisting of ducts, manholes, tunnels, feeder points etc.), it is necessary to develop a cable network designing tool with user-friendly interfaces for efficiently evaluating cable network architectures. This paper firstly proposes the heuristic algorithms enhanced by the disjoint-shortest-path and the depth-first-search methods that would be applicable for real access networks. Secondly, the design method of highly reliable optical fiber cable network based on the heuristic algorithms in terms of network cost and unavailability caused by cable breakdown is proposed. It can design the combination of star- and loop-shaped (where two diversified routes exist between a feeder point and central office) cable network. Furthermore, comparison with the conventional design method which simply applies star- or loop-shaped cable network is done in terms of economy and reliability on real access networks in the Tokyo metropolitan area. It is concluded that the proposed method can reduce the network cost further and realize a short unavailability value compared with the conventional method.

18861-18880hit(20498hit)