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

Keyword Search Result

[Keyword] SI(16314hit)

13081-13100hit(16314hit)

  • Wide-Band CDMA Distortion Characteristics of an AlGaAs/InGaAs/AlGaAs Heterojunction FET under Various Quiescent Drain Current Operations

    Gary HAU  Takeshi B. NISHIMURA  Naotaka IWATA  

     
    PAPER-RF Power Devices

      Vol:
    E82-C No:11
      Page(s):
    1928-1935

    Wide-band CDMA (W-CDMA) distortion characteristics of a fabricated double-doped heterojunction FET (HJFET) are presented. Measured results demonstrate that the first and second adjacent channel W-CDMA adjacent channel leakage power ratios (ACPRs) of the HJFET are correlated to the third- and fifth-order intermodulation (IM3 and IM5) distortions respectively under various quiescent drain current operation (Iq). A first channel ACPR dip phenomenon is observed under a low Iq condition, resulting in improved power added efficiency. Due to its close correlation to the IM3 distortion, the ACPR dip phenomenon is explained in terms of the similar IM3 characteristic. Simulated results reveal that the dip is a consequence of the cancellation of distortions generated by the third- and fifth-order nonlinearities at the IM3 frequency. The conditions for the cancellation are detailed.

  • Low Power Dissipation Single-Supply MMIC Power Amplifier for 5.8 GHz Electronic Toll Collection System

    Taketo KUNIHISA  Shinji YAMAMOTO  Masaaki NISHIJIMA  Takahiro YOKOYAMA  Mitsuru NISHITSUJI  Katsunori NISHII  Osamu ISHIKAWA  

     
    PAPER-RF Power Devices

      Vol:
    E82-C No:11
      Page(s):
    1921-1927

    A MMIC power amplifier operating with a single-supply (3.0 V) has been developed for 5.8 GHz Japanese Electronic Toll Collection (ETC) System. The present MMIC contains two FETs, matching circuits (input, intermediate and output matching circuits), and two drain bias circuits. High dielectric constant material SrTiO3 (STO) is used for by-pass and input coupling capacitors. Very small die size of 0.77 mm2 has been realized by using the STO capacitors and negative feedback circuit technology. High 1 dB output gain compression point (P1dB) of 13 dBm, high gain of 21.4 dB and low dissipation current of 41.3 mA have been achieved under 3.0 V single-supply condition.

  • High-Efficiency 0.1 cc Power Amplifier Module for 900 MHz Personal Digital Cellular Telephones

    Akira INOUE  Akira OHTA  Takahiro NAKAMOTO  Shigeki KAGEYAMA  Toshiaki KITANO  Hideaki KATAYAMA  Toshikazu OGATA  Noriyuki TANINO  Kazunao SATO  

     
    PAPER-RF Power Devices

      Vol:
    E82-C No:11
      Page(s):
    1906-1912

    A new harmonic termination that controls the waveform of the drain current to be rectangular is developed for high-efficiency power amplifier modules. Its harmonic termination is a short circuit at the third harmonic and a non-short circuit at the second harmonic. It is found experimentally and confirmed by simulation that the load-matching condition at the third-order harmonic improves the efficiency of a transistor by more than 13%. By using this tuning, 57.7% power-added efficiency of the module is achieved at the output power of 29.9 dBm with ACP of -50 dBc, NACP of -65 dBc at 925 MHz and Vdd of 3.5 V.

  • A GSM900/DCS1800 Dual-Band MMIC Power Amplifier Using Outside-Base/Center-Via-Hole Layout Multifinger HBT

    Kazutomi MORI  Kenichiro CHOUMEI  Teruyuki SHIMURA  Tadashi TAKAGI  Yukio IKEDA  Osami ISHIDA  

     
    PAPER-RF Power Devices

      Vol:
    E82-C No:11
      Page(s):
    1913-1920

    A GSM900/DCS1800 dual-band AlGaAs/GaAs HBT (heterojunction bipolar transistor) MMIC (monolithic microwave integrated circuit) power amplifier has been developed. It includes power amplifiers for GSM900 and DCS1800, constant voltage bias circuits and a d. c. switch. In order to achieve high efficiency, the outside-base/center-via-hole layout is applied to the final-stage HBT of the MMIC amplifier. The layout can realize uniform output load impedance and thermal distribution of each HBT finger. The developed MMIC amplifier could provided output power of 34.5 dBm and power-added efficiency of 53.4% for GSM900, and output power of 32.0 dBm and power-added efficiency of 41.8% for DCS1800.

  • High-Frequency, Low-Noise Si Bipolar Transistor Fabricated Using Self-Aligned Metal/IDP Technology

    Hiromi SHIMAMOTO  Takahiro ONAI  Eiji OHUE  Masamichi TANABE  Katsuyoshi WASHIO  

     
    PAPER-Low Power-Consumption RF ICs

      Vol:
    E82-C No:11
      Page(s):
    2007-2012

    A high-frequency, low-noise silicon bipolar transistor that can be used in over-10 Gb/s optical communication systems and wireless communication systems has been developed. The silicon bipolar transistor was fabricated using self-aligned metal/IDP (SMI) technology, which produces a self-aligned base electrode of stacked layers of metal and in-situ doped poly-Si (IDP) by low-temperature selective tungsten CVD. It provides a low base resistance and high-cutoff frequency. The base resistance is reduced to half that of a transistor with a conventional poly-Si base electrode. By using the SMI technology and optimizing the depth of the emitter and the link base, we achieved the maximum oscillation frequency of 80 GHz, a minimum gate delay in an ECL of 11.6 ps, and the minimum noise figure of 0.34 dB at 2 GHz, which are the highest performances among those obtained from ion-implanted base Si bipolar transistors, and are comparable to those of SiGe base heterojunction bipolar transistors.

  • A New Approach to the Ball Grid Array Package Routing

    Shuenn-Shi CHEN  Jong-Jang CHEN  Trong-Yen LEE  Chia-Chun TSAI  Sao-Jie CHEN  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E82-A No:11
      Page(s):
    2599-2608

    Due to the large number of I/O's in a Ball-Grid-Array (BGA) package, routing becomes more and more an important work. A ring-based router for the BGA package is presented in this paper to interconnect each I/O pad of a chip to a corresponding ball distributed on the substrate area. The major phases for the router consist of layer assignment, topological routing, and physical routing. Using this router, we can generate an even distribution of planar and any-angle wires to improve manufacturing yield. We have also conducted various testing examples to verify the efficiency of this router. Experiments show that the router produces very good results, far better than the manual design, thus it can be applied to the practical packaging of integrated circuits.

  • Efficient Forward Model Checking Algorithm for ω-Regular Properties

    Hiroaki IWASHITA  Tsuneo NAKATA  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2448-2454

    We present a symbolic language emptiness check algorithm based on forward state traversal. A verification property is given by a set of error traces written in ω-regular expression and is manipulated explicitly as a non-deterministic state transition graph. State space of the design model is implicitly traversed along the explicit graph. This method has a large amount of flexibility for controlling state traversal on the property space. It should become a good framework of incremental or approximate verification of ω-regular properties.

  • RSPICE: A Fast and Robust Timing Simulator for Digital MOS VLSI

    Xia CAI  Huazhong YANG  Yaowei JIA  Hui WANG  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2492-2498

    RSPICE, a fast timing simulator for large digital MOS circuits, is presented in this paper. A new table-based region-wise linear MOS transistor model and the analytical solution of the generic sub-circuit primitive are applied to calculate the transient response of digital MOS circuits. The body effect of pass transistors is included in the MOS model and the floating capacitor network can be handled by this sub-circuit primitive as well. In RSPICE, MOS transistors with a DC path are grouped into a DC-connected block (DCCB), and DCCBs with a feedback path are combined as a strongly connected component (SCC). RSPICE orders SCCs by Tarjan's algorithm and simulates ordered SCCs one by one. DCCBs are basic cells in RSPICE and any DCCB can be mapped into one or more sub-circuit primitives. In order to calculate the transient response of these primitives analytically, RSPICE approximates the input signals of the primitive by piecewise linear functions. To compromise the simulation accuracy and run time, partial waveform and partial time convergent (PWPTC) combined with dynamic windowing technique is applied to simulate SCCs. Other key issues of RSPICE, such as circuit partition, pass-transistor and floating-capacitor processing, simulation-flow control and waveform modification are also discussed in detail. Compared with HSPICE , the simulation result of RSPICE is very accurate with an error less than 3%, but the speed is 1-2 orders over HSPICE.

  • DC and AC Performances in Selectively Grown SiGe-Base HBTs

    Katsuya ODA  Eiji OHUE  Masamichi TANABE  Hiromi SHIMAMOTO  Katsuyoshi WASHIO  

     
    PAPER-Low Power-Consumption RF ICs

      Vol:
    E82-C No:11
      Page(s):
    2013-2020

    A selectively grown Si1-xGex base heterojunction bipolar transistor (HBT) was fabricated, and effects of Ge and B profiles on the device performance were investigated. Since no obvious leakage current was observed, it is shown that good crystallinity of Si1-xGex was achieved by using a UHV/CVD system with high-pressure H2 pre-cleaning of the substrate. Very high current gain of 29,000 was obtained in an HBT with a uniform Ge profile by both increasing electron injection from the emitter to the base and reducing band gap energy in the base. Since the Early voltage is affected by the grading of Ge content in the base, the HBT with the graded Ge profile provides very high Early voltage. However, the breakdown voltage is degraded by increasing Ge content because of reducing bandgap energy and changing dopant profile. To increase the cutoff frequency, dopant diffusion must be suppressed, and carrier acceleration by the internal drift field with the graded Ge profile has an additional effect. By doing them, an extremely high cutoff frequency of 130 GHz was obtained in HBT with graded Ge profiles.

  • A Partially Explicit Method for Efficient Symbolic Checking of Language Containment

    Kiyoharu HAMAGUCHI  Michiyo ICHIHARA  Toshinobu KASHIWABARA  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2455-2464

    There are two approaches for formal verification of sequential designs or finite state machines: language containment checking and symbolic model checking. To verify designs of practical size, in these two approaches, designs are represented symbolically, in practice, by ordered binary decision diagrams. In the conventional algorithm for language containment checking, finite automata given as specifications are also represented symbolically. This paper proposes a new method, called partially explicit method for checking language containment. By representing states of finite automata given as specifications explicitly, this method can remove redundant computations, and as a result, provide better performance than the conventional method which uses the product machines of designs and specifications. The experimental results show that this approach is effective in checking language containment symbolically.

  • IC Implementation of Current-Mode Chaotic Neuron Circuit

    Nobuo KANOU  

     
    LETTER-Nonlinear Problems

      Vol:
    E82-A No:11
      Page(s):
    2609-2611

    This paper describes an IC implementation of current-mode chaotic neuron circuit for the chaotic neural network. The chaotic neuron circuit which composes of a first generation switched-current integrator and a conventional current amplifier is fabricated in a standard 0.8 µ m CMOS technology. Experimental results of the chaotic neuron circuit reproduce the dynamical behavior of the chaotic neuron model.

  • Digital-Controlled Analog Circuits for Weighted-Sum Operations: Architecture, Implementation and Applications

    Jie CHEN  Guoliang SHOU  Changming ZHOU  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2505-2513

    Weighted summation (W-SUM) operation of multi-input signals plays an important role in signal processing, image compression and communication systems. Conventional digital LSI implementation for the massive high-speed W-SUM operations usually consumes a lot of power, and the power dissipation linearly increases with the operational frequencies. Analog or digital-analog mixed technology may provide a solution to this problem, but the large scale integration for analog circuits especially for digital-analog mixed circuits faces some difficulties in terms of circuit design, mixed-simulation, physical layout and anti-noises. To practically integrate large scale analog or digital-analog mixed circuits, the simplicity of the analog circuits are usually required. In this paper, we present a solution to realize the parallel W-SUM operations of multi-input analog signals based on our developed digital-controlled analog operational circuits. The major features of the proposed circuits include the simplicity in the circuitry architecture and the advantage in the dissipation power, which make it easy to be designed and to be integrated in large scale. To improve the design efficiency, a Top-Down design approach for mixed LSI implementation is proposed. The proposed W-SUM circuits and the Top-Down design approach have been practically used in the LSI implementation for a series of programmable finite impulse response (FIR) filters and matched filters applied in adaptive signal processing and the mobile communication systems based on the wideband code division multiple access (W-CDMA) technology.

  • A VLSI Scan-Chain Optimization Algorithm for Multiple Scan-Paths

    Susumu KOBAYASHI  Masato EDAHIRO  Mikio KUBO  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2499-2504

    This paper presents an algorithm for the scan-chain optimization problem in multiple-scan design methodology. The proposed algorithm, which consists of four phases, first determines pairs of scan-in and scan-out pins (Phase 1), and then assigns flip-flops to scan-paths by using a graph theoretical method (Phase 2). Next the algorithm decides connection-order of flip-flops in each scan-path by using TSP (Traveling Salesman Problem) heuristics (Phase 3), and finally exchanges flip-flops among scan-paths in order to reduce total scan-path length (Phase 4). Experiments using actual design data show that, for ten scan-paths, our algorithm achieved a 90% reduction in scan-test time at the expense of a 7% total scan-path length increase as compared with the length of a single optimized scan-path. Also, our algorithm produced less total scan-path length than other three possible algorithms in a reasonable computing time.

  • A Minimum Output Burstiness Traffic Scheduling Algorithm

    Yaw-Wen KUO  Tsern-Huei LEE  

     
    PAPER-Communication Theory

      Vol:
    E82-B No:11
      Page(s):
    1834-1843

    In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi,ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth ri=max{σi/di,ρi} (di is the delay bound requirement of connection i), the DM/ARR algorithm has a better performance in the sense that it has a larger admission region. We prove that, among all possible scheduling algorithms that satisfy the delay bound requirements of established connections, DM/ARR results in the minimum output burstiness. This is important because a smaller burstiness implies a smoother traffic and thus the receiver (or next switch node in a multihop network) can handle it more easily. Numerical results show that the admission region of the DM/ARR algorithm is close to that of the earliest deadline first algorithm. A packetized version is studied for ATM networks.

  • A Performance Optimization Method for Pipelined ASIPs in Consideration of Clock Frequency

    Katsuya SHINOHARA  Norimasa OHTSUKI  Yoshinori TAKEUCHI  Masaharu IMAI  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2356-2365

    This paper proposes an ASIP performance optimization method taking clock frequency into account. The performance of an instruction set processor can be measured using the execution time of an application program, which can be determined by the clock cycles to perform the application program divided by the applied clock frequency. Therefore, the clock frequency should also be tuned in order to maximize the performance of the processor under the given design constraints. Experimental results show that the proposed method determines an optimal combination of FUs considering clock frequency.

  • Performance Evaluation of STRON: A Hardware Implementation of a Real-Time OS

    Takumi NAKANO  Yoshiki KOMATSUDAIRA  Akichika SHIOMI  Masaharu IMAI  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2375-2382

    In a real-time system, it is required to reduce the response time to an interrupt signal, as well as the execution time of a Real-Time Operating System (RTOS). In order to satisfy this requirement, we have proposed a method of implementing some of the functionalities of an RTOS using hardware. Based on this idea, we have implemented a VLSI chip, called STRON (silicon TRON: The Realtime Operating system Nucleus), to enhance the performance of an RTOS, where the STRON chip works as a peripheral unit of any MPU. In this paper we describe the hardware architecture of the STRON chip and the performance evaluation results of the RTOS using the STRON chip. The following results were obtained. (1) The STRON chip is implemented in only about 10,000 gates when the number of each object (task, event flag, semaphore, and interrupt) is 7. (2) The task scheduler can execute within 8 clocks in a fixed period using the hardware algorithm when the number of tasks is 7. (3) Most of the basic µITRON system calls using the STRON chip can be executed in a fixed period of a few microseconds. (4) The execution time of a system call, measured by a multitask application program model, can be reduced to about one-fifth that in the case of the conventional software RTOS. (5) The total performance, including context switching, is about 2.2 times faster than that of the software RTOS. We conclude that the execution time of the part of the system call implemented by the STRON chip can almost be ignored, but the part of the interface software and context switching related to the architecture of a MPU strongly influence the total performance of an RTOS.

  • Logic Minimization for Large-Scale Networks Based on Multi-Signal Implications

    Masayuki YUGUCHI  Kazutoshi WAKABAYASHI  Takeshi YOSHIMURA  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2390-2397

    This paper presents a novel implication-based method for logic minimization in large-scale, multi-level networks. It significantly reduces network size through repeated addition and removal of redundant subnetworks, utilizing multi-signal implications and relationships among these implications. These are handled on a transitive implication graph, proposed in this paper, which offers the practical use of implications for logic minimization. The proposed method holds great promise for the achievement of an interactive logic design environment for large-scale networks.

  • On Liveness of Extended Partially Ordered Condition Nets

    Atsushi OHTA  Kohkichi TSUJI  Tomiji HISAMURA  

     
    LETTER

      Vol:
    E82-A No:11
      Page(s):
    2576-2578

    Petri net is an efficient model for concurrent systems. Liveness is one of analysis properties of Petri net. It concerns with potential fireability of transitions. Many studies have been done on liveness of Petri nets and subclasses are suggested with liveness criteria. In this paper, extended partially ordered condition (EPOC) net is suggested and its liveness is studied. Equivalence of liveness and place-liveness is derived. Analysis using siphon and traps are done. Liveness under the earliest firing rule, where transition must fire as soon as it is enabled, is also studied.

  • A Compositional Approach for Constructing Communication Services and Protocols

    Bhed Bahadur BISTA  Kaoru TAKAHASHI  Norio SHIRATORI  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2546-2557

    The complexity of designing communication protocols has lead researchers to develop various techniques for designing and verifying protocols. One of the most important techniques is a compositional technique. Using a compositional technique, a large and complex protocol is designed and verified by composing small and simple protocols which are easy to handle, design and verify. Unlike the other compositional approaches, we propose compositional techniques for simultaneously composing service specifications and protocol specifications based on Formal Description Techniques (FDTs) called LOTOS. The proposed techniques consider alternative, sequential, interrupt and parallel composition of service specifications and protocol specifications. The composite service specification and the composite protocol specification preserve the original behaviour and the correctness properties of individual service specifications and protocol specifications. We use the weak bisimulation equivalence (), to represent the correctness properties between the service specification and the protocol specification. When a protocol specification is weak bisimulation equivalent to a service specification, the protocol satisfies all the logical properties of a communication protocol as well as provides the services that are specified in the service specification.

  • Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net

    Masahiro YAMAUCHI  Toshimasa WATANABE  

     
    PAPER

      Vol:
    E82-A No:11
      Page(s):
    2566-2575

    Given a Petri net PN=(P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.

13081-13100hit(16314hit)