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

Keyword Search Result

[Keyword] IN(26286hit)

25641-25660hit(26286hit)

  • Characterization of Microstrip Lines Near Edge of Dielectric Substrate with Rectangular Boundary Division Method

    Keren LI  Kazuhiko ATSUKI  Hitoshi YAJIMA  Eikichi YAMASHITA  

     
    PAPER

      Vol:
    E76-C No:6
      Page(s):
    977-984

    In this paper, the characteristics of microstrip lines near the edge of dielectric substrate are analyzed by improving the rectangular boundary division method. The numerical results indicate the changes of the characteristics of a microstrip line when the strip conductor is closely located to the edge. When the distance the dielectric substrate edge to the strip conductor is less than the thickness of dielectric substrate, the effects of the edge on the line characteristics are no longer negligible. The numerical results in this paper show high computation accuracy without increasing computation time. Our improvement is effective for the analysis of the microstrip lines both for the narrow strip conductor and the strip conductor close to the edge. The relative errors between the numerical results and the measured values are less than 1.2%.

  • Error Probability Analysis in Reduced State Viterbi Decoding

    Carlos VALDEZ  Hiroyuki FUJIWARA  Ikuo OKA  Hirosuke YAMAMOTO  

     
    PAPER-Communication Theory

      Vol:
    E76-B No:6
      Page(s):
    667-676

    The performance evaluation by analysis of systems employing Reduced State Viterbi decoding is addressed. This type of decoding is characterized by an inherent error propagation effect, which yields a difficulty in the error probability analysis, and has been usually neglected in the literature. By modifying the Full State trellis diagram, we derive for Reduced State schemes, new transfer function bounds with the effects of error propagation. Both the Chernoff and the tight upper bound are applied to the transfer function in order to obtain the bit error probability upper bound. Furthermore, and in order to get a tighter bound for Reduced State decoding schemes with parallel transitions, the pairwise probability of the two sequences involved in an error event is upper bounded, and then the branch metric of a sequence taken from that bound is associated with a truncated instead of complete Gaussian noise probability density function. To support the analysis, particular assessment is done for a Trellis Coded Modulation scheme.

  • ClearBoard: A Novel Shared Drawing Medium that Supports Gaze Awareness in Remote Collaboration

    Minoru KOBAYASHI  Hiroshi ISHII  

     
    PAPER

      Vol:
    E76-B No:6
      Page(s):
    609-617

    The goal of visual telecommunication has been to create a sense of "being there" or "telepresence." This paper introduces a novel shared drawing medium called ClearBoard that goes beyond "being there" by providing virtual shared workspace. It realizes (1) a seamless integration of shared drawing space and partner's image, and (2) eye contact to support real-time and remote collaboration by two users. We devised the key metaphor: "talking through and drawing on a transparent glass window" to design ClearBoard. A prototype, ClearBoard-1 is implemented based on the "Drafter-Mirror" architecture. This paper first reviews previous work on shared drawing support to clarify our design goals. We then examine three metaphors that fulfill these goals. The design requirements and the two possible system architectures of ClearBoard are described. Finally, some findings gained through the experimental use of the prototype, including the feature of "gaze awareness," are discussed.

  • Unified Scheduling of High Performance Parallel VLSI Processors for Robotics

    Bumchul KIM  Michitaka KAMEYAMA  Tatsuo HIGUCHI  

     
    PAPER-Parallel Processor Scheduling

      Vol:
    E76-A No:6
      Page(s):
    904-910

    The performance of processing elements can be improved by the progress of VLSI circuit technology, while the communication overhead can not be negligible in parallel processing system. This paper presents a unified scheduling that allocates tasks having different task processing times in multiple processing elements. The objective function is formulated to measure communication time between processing elements. By employing constraint conditions, the scheduling efficiently generates an optimal solution using an integer programming so that minimum communication time can be achieved. We also propose a VLSI processor for robotics whose latency is very small. In the VLSI processor, the data transfer between two processing elements can be done very quickly, so that the communication cycle time is greatly reduced.

  • Antenna Gain Measurements in the Presence of Unwanted Multipath Signals Using a Superresolution Technique

    Hiroyoshi YAMADA  Yasutaka OGAWA  Kiyohiko ITOH  

     
    PAPER-Antennas and Propagation

      Vol:
    E76-B No:6
      Page(s):
    694-702

    A superresolution technique is considered for use in antenna gain measurements. A modification of the MUSIC algorithm is employed to resolve incident signals separately in the time domain. The modification involves preprocessing the received data using a spatial scheme prior to applying the MUSIC algorithm. Interference rejection in the antenna measurements using the fast Fourier transform (FFT) based techniques have been realized by a recently developed vector network analyzer, and its availability has been reported in the literature. However, response resolution in the time domain of these conventional techniques is limited by the antenna bandwidth. The MUSIC algorithm has the advantage of being able to eliminate unwanted responses when performing antenna measurements in situations where the antenna band-width is too narrow to support FFT based techniques. In this paper, experimental results of antenna gain measurements in a multipath environment show the accuracy and resolving power of this technique.

  • An Experimental Study on Frequency Synthesizers Using Push-Push Oscillators

    Hiroyuki YABUKI  Morikazu SAGAWA  Mitsuo MAKIMOTO  

     
    PAPER

      Vol:
    E76-C No:6
      Page(s):
    932-937

    This paper describes the fundamental principle of novel push-push oscillators using hairpin-shaped split-ring resonators and their application to voltage controlled and injection locked oscillators for frequency synthesizers. The experimental results make it clear that the synthesizer systems discussed here have the advantages of high frequency operation, compact size and low power consumption. Experimental work has been carried out in the L band, but these systems can be applied to much higher frequencies.

  • A 156-Mb/s Interface CMOS LSI for ATM Switching Systems

    Takahiko KOZAKI  Kiyoshi AIKI  Makoto MORI  Masao MIZUKAMI  Ken'ichi ASANO  

     
    PAPER-Communication Device and Circuit

      Vol:
    E76-B No:6
      Page(s):
    684-693

    This paper describes a 0.8-µm CMOS LSI developed for a 156-Mb/s serial interface in ATM switching systems. Recently, there have been increasing problems of connector pin neck and higher power consumption when enhancing switching system capacity. To overcome these problems, we have developed an LSI with a high-speed interface by using CMOS technology to achieve low power consumption. A low-swing differential signal level is used to achieve 156-Mb/s data transmission. We named this new circuit technique ALTS (Advanced Low-level Transmission circuit System). Using the LSI, transmission can be achieved between boards or racks through a 10-meter twisted pair cable. The LSI has a 156-Mb/s transmitter-receiver, a serial-to-parallel converter and a parallel-to-serial converter. It performs 19.5-Mb/s parallel data/156-Mb/s serial data conversion and 156-Mb/s serial data transmission. In addition, it has a bit phase synchronizer and cell synchronizer, which enables it to transmit and synchronize serial data without a paralleled clock or a paralleled cell top signal, by distributing a common 156-MHz clock and a common cell top signal to the whole system. We evaluated the bit error rate and timing margin on data transmission under several conditions. The results show that we can apply this LSI to commercially available ATM switching systems. This paper also describes methods of expanding switch capacity and transmitting 624-Mb/s data using this LSI.

  • A Method for Contract Design and Delegation in Object Behavior Modeling

    Hirotaka SAKAI  

     
    PAPER-Software Theory

      Vol:
    E76-D No:6
      Page(s):
    646-655

    Behavior modeling of objects is critical in object-oriented design. In particular, it is essential to preserve integrity constraints on object behavior in application environments where objects of various classes dynamically interact with each other. In order to provide a stable design technique, a behavior model using the notion of the life cycle schema of a class is proposed. To model the aspect of behavioral abstraction of objects, the notion of schema refinement together with a diagrammatic representation technique is also defined. In this framework, a formalization of behavior constraints on objects which interact with each other is proposed together with its graphical representation. Verification rules of consistency of behavior constraints are also discussed. In order to perform certain functions, several partner objects of the same or different classes should collaborate establishing client-server relationships. The contract of a class is defined as a collection of responsibilities of a server class to a client class where each responsibility is specified in the form of the script. To achieve a high degree of systems integrity, a procedure to derive scripts from behavior constraints on collaborating partners is developed. It is also critical to evenly distribute responsibilities to partner objects. A delegation is placing a whole or a part of responsibilities of an object in charge of other objects. Based on the design principle delegation along the aggregation hierarchy,' a unified design approach to delegation that enables to reorganize scripts in constraints preserving way is proposed.

  • Characterization and Application of Lumped Double Crosstie Slow-Wave Transmission Lines

    Hideki KAMITSUNA  Hiroyo OGAWA  

     
    PAPER

      Vol:
    E76-C No:6
      Page(s):
    968-976

    This paper describes the characteristics and application of lumped double crosstie slow-wave transmission lines (DCT-SLWs) which we previously proposed. Firstly, the relationship between the DCT-SLW's characteristics and their parameters, i. e. triplate stripline widths and inductor resistances, are numerically and experimentally investigated. Excellent slow-wave lines with both high slow-wave factors (1240) and a wide characteristic impedance range (35100Ω) are achieved in good agreement with calculated results. A 50-Ω DCT-SLW that reduces circuit area more than 80%, and has an insertion loss less than that of 22-µm-wide TFMS lines is achieved by adapting a low-loss inductor in the frequencies below 14.5 GHz. Secondly, the application of DCT-SLW to non-dispersive, dispersive delay lines and branch-line hybrids is discussed. Specifically, very small 4-GHz-band branch-line hybrids are fabricated in a chip area of 0.7 mm2. Fundamental microwave circuits utilizing slow-wave lines in MMICs are demonstrated for the first time.

  • Time Domain Synthesis of Recursive Digital Filters for Finite Interval Response

    Thanapong JATURAVANICH  Akinori NISHIHARA  

     
    PAPER-Digital Signal Processing

      Vol:
    E76-A No:6
      Page(s):
    984-989

    A least squares approximation method of recursive digital filters for finite interval response with zero value outside the interval is presented. According to the characteristic of the method, the modified Gauss Method is utilized in iteratively determining design parameters. Convergence, together with the stability of the resulting filter, are guaranteed.

  • Overlapped Partitioning Algorithm for the Solution of LSEs with Fixed Size Processor Array

    Ben CHEN  Mahoki ONODA  

     
    PAPER-Modeling and Simulation

      Vol:
    E76-A No:6
      Page(s):
    1011-1018

    In this paper we present an Overlapped Block Gauss-Seidel (OBGS) algorithm for the solution of large scale LSEs (Linear System of Equations) based on array architecture which we have already proposed. Better partitioning for processor array usually requires (1) balanced block size, and (2) minimum coupling between blocks for better convergence. These conditions can well be satisfied by overlapping some variables in computation algorithm. The mathematical implication of overlapped partitioning is discussed at first, and some examples show the effectiveness of OBGS algorithm. Conclusion points out that the convergence properties can well be improved by proper choice of overlapped variables. An efficient algorithm is given for choosing block and variables in order to realize above conditions.

  • Parallel Viterbi Decoding Implementation by Multi-Microprocessors

    Hui ZHAO  Xiaokang YUAN  Toru SATO  Iwane KIMURA  

     
    PAPER-Communication Theory

      Vol:
    E76-B No:6
      Page(s):
    658-666

    The Viterbi algorithm is a well-established technique for channel and source decoding in high performance digital communication systems. However, excessive time consumption makes it difficult to design an efficient high-speed decoder for practical application. This paper describes the implementation of parallel Viterbi algorithm by multi-microprocessors. Internal computations are performed in a parallel fashion. The use of microprocessors allows low-cost implementation with moderate complexity. The software and hardware implementations of the Viterbi algorithm on parallel multi-microprocessors for real-time decoding are presented. The implemented method is based on a combination of forming a set of tables and calculations. For efficient operation under fully parallel Viterbi decoding by microprocessors, we considered: (1) branch metrics processing, path metrics updating, path memory updating and decoding output for microprocessor, (2) efficient decomposition of the sequential Viterbi algorithm into parallel algorithms, (3) minimization of the communication among the microprocessors. The practical solutions for the problems of synchronization among the miroprocessors, interconnection network for communication among the microprocessors and memory management are discussed. Furthermore the performance and the speed of the parallel Viterbi decoding are given. For a fixed processing speed of given hardwares, parallel Viterbi decoding allows a linear speed up in the throughput rate with a linear increase in hardware complexity.

  • Template Based Method of Edge Linking with Low Distortion

    Fredrick L. MILLER  Junji MAEDA  Hiroshi KUBO  

     
    LETTER-Image Processing, Computer Graphics and Pattern Recognition

      Vol:
    E76-D No:6
      Page(s):
    711-716

    In the field of computer vision the detection of edges in an image serves to simplify the date in the early stages, into a form which is more easily processed by the computer. But because of noise or due to the inherent weaknesses of the chosen edge detector, gaps or interruptions in the edges may be formed. In order for further processing to proceed with accuracy and confidence, these gaps must be filled or linked to form a more continuous edge. Proposed in this paper is a unique method of edge linking. This method consists of three steps, labelling, linking and merging. The procedure makes use of global information in the labelling process and local information with the use of templates in the linking and merging processes. As a result of the unique way in which the gaps between edge segments are filled, distortion of the edge image is kept minimal. One other advantage of the proposed edge linker is that it can be used in combination with different edge detection schemes. To show the effectiveness of the proposed method, comparisons are given. These include the linear feature extraction method of Zhou et.al., upon which the proposed method is based and also outputs from a method described by Nevatia.

  • Toward the New Era of Visual Communication

    Masahide KANEKO  Fumio KISHINO  Kazunori SHIMAMURA  Hiroshi HARASHIMA  

     
    INVITED PAPER

      Vol:
    E76-B No:6
      Page(s):
    577-591

    Recently, studies aiming at the next generation of visual communication services which support better human communication have been carried out intensively in Japan. The principal motive of these studies is to develop new services which are not restricted to a conventional communication framework based on the transmission of waveform signals. This paper focuses on three important key words in these studies; "intelligent," "real," and "distributed and collaborative," and describes recent research activities. The first key word "intelligent" relates to intelligent image coding. As a particular example, model-based coding of moving facial images is discussed in detail. In this method, shape change and motion of the human face is described by a small number of parameters. This feature leads to the development of new applications such as very low bit-rate transmission of moving facial images, analysis and synthesis of facial expression, human interfaces, and so on. The second key word "real" relates to communication with realistic sensations and virtual space teleconferencing. Among various component technologies, real-time reproduction of 3-D human images and a cooperative work environment with virtual space are discussed in detail. The last key word "distributed and collaborative" relates to collaborative work in a distributed work environment. The importance of visual media in collaborative work, a concept of CSCW, and requirements for realizing a distributed collaborative environment are discussed. Then, four examples of CSCW systems are briefly outlined.

  • Environment-Dependent Self-Organization of Positional Information in Coupled Nonlinear Oscillator System--A New Principle of Real-Time Coordinative Control in Biological Distributed System--

    Yoshihiro MIYAKE  Yoko YAMAGUCHI  Masafumi YANO  Hiroshi SHIMIZU  

     
    LETTER-Neural Nets--Theory and Applications--

      Vol:
    E76-A No:5
      Page(s):
    780-785

    The mechanism of environment-dependent self-organization of "positional information" in a coupled nonlinear oscillator system is proposed as a new principle of realtime coordinative control in biological distributed system. By modeling the pattern formation in tactic response of Physarum plasmodium, it is shown that a global phase gradient pattern self-organized by mutual entrainment encodes not only the positional relationship between subsystems and the total system but also the relative relationship between internal state of the system and the environment.

  • A Sufficient Condition of A Priori Estimation for Computational Complexity of the Homotopy Method

    Mitsunori MAKINO  Masahide KASHIWAGI  Shin'ichi OISHI  Kazuo HORIUCHI  

     
    PAPER-Numerical Homotopy Method and Self-Validating Numerics

      Vol:
    E76-A No:5
      Page(s):
    786-794

    A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present papers, a condition is presented for a certain class of uniquely solvable equations, under which an upper bound of a computational complexity of the Newton type homotopy method can be a priori estimated. In this paper, a condition is considered in a case of linear homotopy equations including the Newton type homotopy equations. In the first place, the homotopy algorithm based on the simplified Newton method is introduced. Then by using Urabe type theorem, which gives a sufficient condition guaranteeing the convergence of the simplified Newton method, a condition is presented under which an upper bound of a computational complexity of the algorithm can be a priori estimated, when it is applied to a certain class of strongly monotone nonlinear equations. The presented condition is demonstrated by numerical experiments.

  • A Feedback-Loop Type Transmission Power Control for TDMA Satellite Communication Systems

    Hiroshi KAZAMA  Takeo ATSUGI  Shuzo KATO  

     
    PAPER

      Vol:
    E76-B No:5
      Page(s):
    529-535

    This paper proposes a feedback-loop type transmission power control (TPC) scheme coupled with first and second order prediction methods and analyzes the optimum control period and residual control error. In order to minimize residual control error, the three main factors contributing to residual control error are analyzed. First, to detect accurately up-link rain attenuation, a channel quality detection method is proposed and analyzed experimentally for puseudo-error detection. Second, rain attenuation rates in Ka band are measured and analyzed statistically. Finally, the optimum control period of the proposed TPC scheme is analyzed. The simulation results on the prototype TPC system show a maximum of 4.5 dB residual control error is achievable with an optimum control period of about 1 second to 1.5 seconds.

  • Intermittency of Recurrent Neuron and Its Network Dynamics

    Toshihide TSUBATA  Hiroaki KAWABATA  Yoshiaki SHIRAO  Masaya HIRATA  Toshikuni NAGAHARA  Yoshio INAGAKI  

     
    PAPER-Chaos and Related Topics

      Vol:
    E76-A No:5
      Page(s):
    695-703

    Various models of a neuron have been proposed and many studies about them and their networks have been reported. Among these neurons, this paper describes a study about the model of a neuron providing its own feedback input and possesing a chaotic dynamics. Using a return map or a histogram of laminar length, type-I intermittency is recognized in a recurrent neuron and its network. A posibility of controlling dynamics in recurrent neural networks is also mentioned a little in this paper.

  • A Link Study of a Low-Earth Orbit Satellite Communications System Using Optical Intersatellite Links

    Mitsuo NOHARA  Yoshinori ARIMOTO  Wataru CHUJO  Masayuki FUJISE  

     
    PAPER

      Vol:
    E76-B No:5
      Page(s):
    536-543

    Link conditions of a low-earth orbit (LEO) satellite communications system were evaluated, to provide the information necessary for designing a broadband LEO-SAT communications system. The study was made both for optical intersatellite and user/satellite links. For the optical intersatellite link (ISL), we examined several ISL configurations in a circular polar orbit, and found that when the satellites are in the same orbital plane, the link parameters are quite stable, that is, the link between adjacent satellites can be regarded as fixed and, therefore, suitable for broadband transmission via an optical link. However, the link conditions between adjacent orbits change very quickly and over a wide range. To overcome this and extend the network path between satellites in adjacent orbital planes, we proposed intermittent use of the link between satellites in co-rotating adjacent orbital planes at the low latitude region, i.e., only during the period of stable conditions. The optical intersatellite link budget also sets link parameters that are realistic, given present optoelectronic technologies. From quantitative evaluations of the user/satellite link, we believe that both the satellite altitude and minimum elevation angle are critical, both in defining the quality of the service of the LEO-SAT system and in their impact on the other transmission parameters. The link loss, the visible period and the required number of satellites vs. satellite altitude and elevation angle are also indicated. These are important considerations for future system design.

  • Fault Tolerant Properties and a Fault-Checking Method of Fuzzy Control

    Hiroshi ITO  Takashi MATSUBARA  Takakazu KUROKAWA  Yoshiaki KOGA  

     
    PAPER-Fail-Safe/Fault Tolerant

      Vol:
    E76-D No:5
      Page(s):
    586-593

    Generally it is said that a fuzzy control system has fault tolerant properties, but it is not clearly studied. In this paper, first, the influence of faults in fuzzy control systems is examined. Errors given by fault simulation are not negligible. However, no fault detecting method is applied in the realized fuzzy control systems. Then a fault-checking method to detect faults is proposed in this paper.

25641-25660hit(26286hit)