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

Keyword Search Result

[Keyword] AF(873hit)

761-780hit(873hit)

  • Direct Wafer Bonding Technique Aiming for Free-Material and Free-Orientation Integration of Semiconductor Materials

    Yae OKUNO  Kazuhisa UOMI  Masahiro AOKI  Tomonobu TSUCHIYA  

     
    PAPER

      Vol:
    E80-C No:5
      Page(s):
    682-688

    This paper describes the use of direct wafer bonding technique to implement the novel concept of "free-material and free-orientation integration" which we propose. The technique is applied for various wafer combinations of an In-Ga-As-P material system with lattice- and orientation-mismatches. The properties of the bonded structures are studied in terms of the crystalline and electrical characterization. The high crystalline quality of the bonded structures with those mismatches is proved by transmission electron microscopy, and good electrical conduction was attained in some bonded structures of InP and GaAs. (001) InP-based 1.55-µm wavelength lasers are fabricated on (110) GaAs substrate by direct wafer bonding. The light-current characteristics of the lasers are almost identical to those of lasers fabricated on (001) InP and (001) GaAs substrates, while the turn-on voltage is a little bit higher due to the higher barrier height at the bonded interface. The practicability in those lasers are also examined. Furthermore, we show direct wafer bonding of a (001) InP-based structure and a (110) Si substrate with a GaAs buffer layer, aligning the cleavage planes of the InP and the Si. The results demonstrate the remarkable feasibility of using the direct wafer bonding technique to obtain integrated structures of material- and orientation-mismatched wafers with satisfactory quality.

  • Dosimetric Evaluation of Handheld Mobile Communications Equipment with Known Precision

    Niels KUSTER  Ralph KASTLE  Thomas SCHMID  

     
    INVITED PAPER

      Vol:
    E80-B No:5
      Page(s):
    645-652

    Recently several dosimetric assessment procedures have been proposed to demonstrate the compliance of handheld mobile telecommuications equipment (MTE) with safety limits. However, for none of these procedures has an estimation of the overall uncertainty in assessing the maximum exposure been provided for a reasonable cross-section of potential users. This paper presents a setup and procedure based on a high-precision dosimetric scanner combined with a new phantom derived from an anatomical study. This allows the assessment of the maximum spatial peak SAR values occurring in approximately 90% of all MTE users, including children, with a precision of better than 25%. This setup and procedure therefore satisfies the requirements of the FCC, as well as those drafted by a CENELEC working group mandated by the European Union.

  • Isolator-Free DFB-LD Module with TEC Control Using Silicon Waferboard

    Koji TERADA  Seimi SASAKI  Kazuhiro TANAKA  Tsuyoshi YAMAMOTO  Tadashi IKEUCHI  Kazunori MIURA  Mitsuhiro YANO  

     
    LETTER-Optoelectronic Packaging

      Vol:
    E80-C No:5
      Page(s):
    703-706

    This letter describes our DFB-LD module for use in WDM optical access networks. We realized an isolator-free DFB-LD module with a thermo-electric cooler in aim of stabilizing the emission wavelength for WDM systems. Silicon waferboard technology was employed to achieve simple assembly and small size of the module. This small size contributed to low TEC power. Our fabricated module demonstrated low-noise and stable emission wavelength characteristics under 156 Mbit/s pseudo random modulation.

  • A Comparative Study on Multiple Registration Schemes in Cellular Mobile Radio Systems Considering Mobile Power Status

    Kwang-Sik KIM  Kyoung-Rok CHO  

     
    PAPER-Radio Communication

      Vol:
    E80-B No:4
      Page(s):
    589-597

    The multiple registration schemes (MRSs) proposed here are classified into 3 cases by combining five registration schemes which are power up registration scheme (PURS), power down registration scheme (PDRS), zone based registration scheme (ZBRS), distance based registration scheme (DBRS), and implicit registration scheme (IRS) as follows: the first is MRS1 which covers PURS, PDRS, and ZBRS; the second is MRS2 which covers PURS, PDRS, and DBRS; the third is MRS3 which covers PURS, PDRS, IRS, and DBRS. The three proposed schemes are compared each other by analyzing their combined signaling traffic of paging and registration with considering various parameters of a mobile station behavior (unencumbered call duration, power up and down rate, velocity, etc.). Also, we derive allowable location areas from which the optimal location area is obtained. Numerical results show that MRS3 yields better performance than ZBRS, DBRS, MRS1, and MRS2 in most cases of a mobile station behavior, and it has an advantage of distributing the load of signaling traffic into every cell, which is important in personal communication system.

  • Reproducing the Behavior of a Parallel Program by Using Dataflow Execution Models

    Naohisa TAKAHASHI  Takeshi MIEI  

     
    PAPER

      Vol:
    E80-D No:4
      Page(s):
    495-503

    We present a general framework with which we can evaluate the flexibility and efficiency of various replay systems for parallel programs. In our approach, program monitoring is modeled by making a virtual dataflow program graph, referred to as a VDG, that includes all the instructions executed by the program. The behavior of the program replay is modeled on the parallel interpretation of a VDG based on two basic parallel execution models for dataflow program graphs: a data-driven model and a demand-driven model. Previous attempts to replay parallel programs, known as Instant Replay and P-Sequence, are also modeled as variations of the data-driven replay, i.e. the datadriven interpretation of a VDG. We show that the demand-driven replay, i.e. the demand-driven interpretation of a VDG, is more flexible in program replay than the data-driven replay since it allows better control of parallelism and a more selective replay. We also show that we can implement a demand-driven replay that requires almost the same amount of data to be saved during program monitoring as does the data-driven replay, and which eliminates any centralized bottleneck during program monitoring by optimizing the demand propagation and using an effective data structure.

  • Size-Based Resource Scheduling for Wireless Message Transport

    Masugi INOUE  Hiroyuki MORIKAWA  Moriyuki MIZUMACHI  

     
    PAPER-Signaling System and Communication Protocol

      Vol:
    E80-B No:3
      Page(s):
    466-475

    This paper presents severl radio resource scheduling algorithms which aim to provide best-effort service for non-real-time unit-oriented, or message traffic. The objective of resource scheduling algorithm is to distribute radio resources between competing message traffic sources while attaining throughput as high and fair as possible for each source without any explicit quality-of-service (QoS) guarantee. Computer simulations are carried out to evaluate the performance in terms of the average of allocation plus transfer delay, the average of throughput, the variance of throughput, and the usage of resources. The message-size distributions of homepages in World-Wide-Web and e-mails obtained by actual measurement are used. Message size-based resource scheduling algorithms are found to provide high and fair throughput as well as efficient use of the resources.

  • A Traffic Measurement-Based Modeling of Superposed ATM Cell Streams

    Sang H. KANG  Changhwan OH  Dan K.SUNG  

     
    PAPER-Communication Networks and Services

      Vol:
    E80-B No:3
      Page(s):
    434-441

    Superposed ATM cell streams have burstiness and strong autocorrelation properties. This paper investigates traffic measurement-based modeling method for superposed ATM cell streams. We develop a new measurement method based on monitoring both the waiting time distribution in a monitoring queue and the autocorrelation of cell interarrival times. Through the monitoring queue, we directly observe the queueing effect of superposed cell flows on ATM multiplexers. The measured traffic is modeled as the two-state MMPP. With the measured traffic, we estimate the cell loss probability in ATM multiplexers from the MMPP/D/1/K queue. Our method successfully works with homogeneous and heterogeneous superposition of traffic sources including voice, data, and video. These results can be applied to the evaluation of ATM multiplexers, traffic engineering, and network performance monitoring.

  • SMART-CUT(R): The Basic Fabrication Process for UNIBOND(R) SOI Wafers

    A.J. AUBERTON-HERVE  Michel BRUEL  Bernard ASPAR  Christophe MALEVILLE  Hubert MORICEAU  

     
    INVITED PAPER-Wafer Technologies

      Vol:
    E80-C No:3
      Page(s):
    358-363

    The advantage of SOI wafers for device manufacture has been widely studied. To be a real challenger to bulk silicon, SOI producers have to offer SOI wafers in large volume and at low cost. The new Smart-Cut(R) SOI process used for the manufacture of the Unibond(R) SOI wafers answers most of the SOI wafer manufacturability issues. The use of Hydrogen implantation and wafer bonding technology is the best combination to get good uniformity and high quality for both the SOI and buried oxide layer. In this paper, the Smart-Cut(R) process is described in detail and material characteristics of Unibond(R) wafers such as crystalline quality, surface roughness, thin film thickness homogeneity, and electric behavior.

  • A Model for Stream Overflows in Circuit-Switched Communication Networks

    Ramesh BHANDARI  

     
    PAPER-Network performance and traffic theory

      Vol:
    E80-B No:2
      Page(s):
    324-331

    In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.

  • Planning and Design Issues for Information Delivery Using Idle Periods in Telecommunication Networks

    Kenichi MASE  Suwan RUNGGERATIGUL  

     
    INVITED PAPER

      Vol:
    E80-B No:2
      Page(s):
    230-239

    Significant traffic variations occur in telecommunication networks. This paper focuses on hour-to-hour traffic variations during 24 hours and investigates the possibility of using idle periods effectively by introducing non-realtime service at a discount rate. In order to provide non-realtime service, memory is placed at each telecom center. When immediate service is not available, messages of non-realtime calls are stored in the memory and served later when network resources are available. Realtime calls are served with preference. A basic model and a method of dimensioning the memory capacity are presented. The basic model is extended to the network model, and methods of designing a minimum cost network and pricing and profit issues are presented. The results for a basic model are verified by traffic simulation. Numerical examples are given to show the effectiveness of non-realtime service.

  • New Performance Measure and Overload Control for Switching Systems with Focused Traffic

    Shinichi NAKAGAWA  Shuichi SUMITA  

     
    PAPER-Switching and Communication Processing

      Vol:
    E80-B No:2
      Page(s):
    339-344

    Narrow-band ISDN services may experience nonstationary traffic conditions. Therefore, switch design should take account of these conditions. We propose new performance measures for switching systems and describe a traffic model, which is a mixture of stationary Poissonian traffic and momentarily focused traffic. On the basis of this model, performance measures are determined so as to satisfy grade of service requirements that are in effect during some short interval after the momentarily focused traffic enters the system. We also propose an overload control scheme that uses these new performance measures. Finally, we show practical and numerical examples for the performance measures and overload control scheme.

  • Stiffness of Measurement System and Significant Figures of Displacement which are Required to Interpret Adhesional Force Curves

    Kunio TAKAHASHI  Nancy A. BURNHAM  Hubert M. POLLOCK  Tadao ONZAWA  

     
    PAPER-Actuator

      Vol:
    E80-C No:2
      Page(s):
    255-262

    Force curves obtained from an elastic contact theory are shown and compared with experimental results. In the elastic contact theory, a pin-on-disk contact is assumed and the following interaction are taken into consideration; (i) elastic deformation, (ii) the specific energy of adhesion in the area of the contact, which is expressed as the difference between the surface energies and the interface energy, (iii) the long-range interaction outside the area of contact, assuming the additivity of the Lennard-Jones type potential, and (iv) another elastic term for the measurement system such as the cantilever stiffness of an atomic force microscope (AFM). In the limit when the stiffness is infinite, the theory conforms to Muller-Yushchenko-Derjaguin (MYD) theory. In the limit when the surface-surface interaction is negligible, the theory conforms to the analytical theory by Takahashi-Mizuno-Onzawa. In the limit when the stiffness is infinite and the long-range interaction outside the area of contact is negligible, the theory conforms to Johnson-Kendall-Roberts (JKR) theory. All parameters and all equations are normalized and the normalized force curve is obtained as the functional of only two parameters; (1) the normalized stiffness of the measurement system, and (2) the normalized distance which is used in the expression of the Lennard-Jones potential. The force-displacement plots are converted into force-penetration plots.

  • A New AFC Circuit Employing Double-Product Type Frequency Discriminator in Very-Low CNR Environments

    Nobuaki MOCHIZUKI  Takatoshi SUGIYAMA  Masahiro UMEHIRA  

     
    PAPER-Modem and Coding

      Vol:
    E80-B No:1
      Page(s):
    25-32

    This paper proposes a new AFC (automatic frequency control) circuit employing a double-product type frequency discriminator to enable fast acquisition in very-low CNR (carrier to noise power ratio) environments. The frequency step responses of the proposed AFC circuit are theoretically analyzed. In addition this paper evaluates the performance of the proposed AFC circuit by computer simulation in very-low CNR environments. The simulation results confirm that click noise at the frequency discriminator causes large frequency tracking error and that this error can be improved by increasing the delay time of the double-product type frequency discriminator. The frequency error can be also reduced by introducing the proposed frequency discriminator to modify the frequency error detection performance. The acquisition time of the proposed AFC circuit can be reduced by about 100 symbols compared to the conventional cross-product type AFC circuit.

  • A Simple Cell Spacer Architecture Regenerating Source Cell Interval for Multiple Traffic Classes

    Kohei SHIOMOTO  Naoaki YAMANAKA  

     
    LETTER-Switching and Communication Processing

      Vol:
    E80-B No:1
      Page(s):
    187-191

    A new simple cell spacing architecture that guarantees the peak cell interval and realizes preferential contention resolution is proposed. Scheduling the cell emission on departure of the previous cell, not arrival, allows the source peak cell interval to be regenerated without clumping. Priority control is also realized in the proposed spacer. A connection is scheduled either at the head or tail of the contention chain depending on its priority. The proposed method is applied to realize the UPC function. The proposed cell spacer eliminates the clumping effects of CDV completely and achieves high bandwidth efficiency.

  • On Multi-Inkdot Two-Way Alternating Turing Machines and Pushdown Automata with Sublogarithmic Space and Constant Leaf-Size

    Jianliang XU  Katsushi INOUE  Yue WANG  Akira ITO  

     
    LETTER-Automata,Languages and Theory of Computing

      Vol:
    E80-D No:1
      Page(s):
    86-90

    This paper investigates the accepting powers of multi-inkdot two-way alternating pushdown automata (Turing machines) with sublogarithmic space and constant leaf-size. For each k1, and each m0, let weak-ASPACEm [L(n),k] denote the class of languages accepted by simultaneously weakly L(n) space-bounded and k leaf-bounded m-inkdot two-way alternating Turing machines, and let strong-2APDAm[L(n),k] denote the class of languages accepted by simultaneously strongly L(n) space-bounded and k leaf-bounded m-inkdot two-way alternating pushdown automata. We show that(1) strong-2APDAm [log log n,k+1]weak-ASPACEm[o(log n),k]φfor each k1 and each m1, and(2) strong-2APDA(m+1) [log log n,k]weak-ASPACEm[o(log n),k]φfor each k1 and each m0.

  • A New Verification Framework of Object-Oriented Design Specification for Small Scale Software

    Eun Mi KIM  Shinji KUSUMOTO  Tohru KIKUNO  

     
    PAPER-Verification

      Vol:
    E80-D No:1
      Page(s):
    51-56

    In this paper, we present a first step for developing a method of verifying both safety and correctness of object-oriented design specification. At first, we analyze the discrepancies, which can occur between requirements specification and design specification, to make clear target faults. Then, we propose a new design review method which aims at detecting faults in the design specification by using three kinds of information tables. Here, we assume that component library, standards for safety and design specification obtained from the Booch's object-oriented design method are given. At the beginning, the designers construct a design table based on a design specification, and the verifiers construct a correctness table and a safety table from component library and standards for safety. Then, by comparing the items on three tables, the verifiers review a given design specification and detect faults in it. Finally, using a small example of object-oriented design specification, we show that faults concerning safety or correctness can be detected by the new design review method.

  • ATM Node System Technology for Effective Maintainability

    Noriharu MIYAHO  Arata ITOH  Kouhei SHIOMOTO  

     
    PAPER-Communication Systems and Transmission Equipment

      Vol:
    E79-B No:12
      Page(s):
    1873-1886

    Asynchronous Transfer Mode (ATM) is considered to bo the key technology for realizing B-ISDN. This paper discusses current research on ATM switching nodes for high-speed communication networks. Although some ATM switching nodes have been deployed, much work continues for resolving problems as regards operations and maintainability, such as ATM layer performance evaluation including layered management scheme upon detection of line failure, function test methods regarding channel connectivity for multicasting, and real-time ATM traffic-monitoring mechanism with QoS control. To achieve sufficient ATM node maintainability, the ATM cell transfer quality on the VP and VC levels should be ensured both within the ATM nodes and between adjacent ATM nodes. Since ATM switching nods handle many kinds of virtual paths and virtual channels, each channel's connectivity must be confirmed. This paper proposes ATM layer performance evaluation concept, layered management scheme upon detection of line failure, function test methods for a multicast switch using test cells that periodically pass through pre-determined switching path routes. It also proposes the concept of test cell generation for simulating multiplexed ATM test cells taking ATM truffic characteristics into account. Furthermore, this paper describes a fault diagnosis scheme using test cells that can continually observe the entire ATM connection length in the system. A real-time traffic monitoring hardware configuration and an interface with software control are also discussed and it is clarified that the required functions can be realized by using commercially available DSPs.

  • A Two-Level Flow Control Scheme for ABR Traffic in ATM Networks*

    Danny H.K. TSANG  Wales K.F. WONG  

     
    PAPER-Communication Networks and Services

      Vol:
    E79-B No:11
      Page(s):
    1633-1640

    In this paper, a new two-level flow control scheme using VP credit-based control and stop-and-go rate control for Asynchronous Transfer Mode (ATM) networks is presented. Since the proposed scheme does not require any information on traffic characteristics, we propose to apply such a flow control scheme to the best effort traffic that requires no band-width guarantee from the network. The proposed flow control scheme can efficiently use the leftover bandwidth after the guaranteed traffic has been satisfied. Therefore, high bandwidth utilization can be achieved. Furthermore, cell loss can completely be avoided by the lower-level credit-flow control done on a per VP basis. On top of this, a higher-level Explicit Congestion Notification (ECN) rate control is employed to avoid any performance degradation. Simulations have been performed to verify the effectiveness of the proposed scheme. It is found that the average end-to-end delay of our proposed scheme is better than that of the original VCFC scheme [1]. In addition, there is also a tremendous saving in the memory required when compared with the VCFC scheme.

  • Advances in Very Low Bit Rate Video Coding in North America

    Thomas S. HUANG  James W. STROMING  Yi KANG  Ricardo LOPEZ  

     
    INVITED PAPER

      Vol:
    E79-B No:10
      Page(s):
    1425-1433

    Research in very low-bit rate coding has made significant advancements in the past few years. Most recently, the introduction of the MPEG-4 proposal has motivated a wide variety of a approaches aimed at achieving a new level of video compression. In this paper we review progress in VLBV categorized into 3 main areas. (1) Waveform coding, (2) 2D Content-based coding, and (3) Model-based coding. Where appropriate we also described proposals to the MPEG-4 committee in each of these areas.

  • Motion-Compensated Prediction Method Based on Perspective transform for Coding of Moving Images

    Atsushi KOIKE  Satoshi KATSUNO  Yoshinori HATORI  

     
    PAPER

      Vol:
    E79-B No:10
      Page(s):
    1443-1451

    Hybrid image coding method is one of the most promising methods for efficient coding of moving images. The method makes use of jointly motion-compensated prediction and orthogonal transform like DCT. This type of coding scheme was adopted in several world standards such as H.261 and MPEG in ITU-T and ISO as a basic framework [1], [2]. Most of the work done in motion-compensated prediction has been based on a block matching method. However, when input moving images include complicated motion like rotation or enlargement, it often causes block distortion in decoded images, especially in the case of very low bit-rate image coding. Recently, as one way of solving this problem, some motion-compensated prediction methods based on an affine transform or bilinear transform were developed [3]-[8]. These methods, however, cannot always express the appearance of the motion in the image plane, which is projected plane form 3-D space to a 2-D plane, since the perspective transform is usually assumed. Also, a motion-compensation method using a perspective transform was discussed in Ref, [6]. Since the motion detection method is defined as an extension of the block matching method, it can not always detect motion parameters accurately when compared to gradient-based motion detection. In this paper, we propose a new motion-compensated prediction method for coding of moving images, especially for very low bit-rate image coding such as less than 64 kbit/s. The proposed method is based on a perspective transform and the constraint principle for the temporal and spatial gradients of pixel value, and complicated motion in the image plane including rotation and enlargement based on camera zooming can also be detected theoretically in addition to translational motion. A computer simulation was performed using moving test images, and the resulting predicted images were compared with conventional methods such as the block matching method using the criteria of SNR and entropy. The results showed that SNR and entropy of the proposed method are better than those of conventional methods. Also, the proposed method was applied to very low bit-rate image coding at 16 kbit/s, and was compared with a conventional method, H.261. The resulting SNR and decoded images in the proposed method were better than those of H.261. We conclude that the proposed method is effective as a motion-compensated prediction method.

761-780hit(873hit)