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

Keyword Search Result

[Keyword] (42807hit)

11681-11700hit(42807hit)

  • Phase Noise Measurement of Optical Heterodyning Two-Tone Signal Generated by Two Free-Running Lasers

    Ryuta YAMANAKA  Taka FUJITA  Hideyuki SOTOBAYASHI  Atsushi KANNO  Tetsuya KAWANISHI  

     
    BRIEF PAPER

      Vol:
    E96-C No:2
      Page(s):
    241-244

    We evaluated the single side-band phase noise of a 40 GHz beat signal generated by two free-running lasers. This allowed us to verify the utility of the two free-running lasers is verified as a light source for a next-generation radio-over-fiber system using frequency such as those in the millimeter-wave and terahertz bands. We also measured the phase noise of a frequency quadrupler using a Mach-Zehnder modulator for comparison. The phase noise of the two free-running lasers and the frequency quadrupler are -63.85 and -95.22 dBc/Hz at a 10 kHz offset frequency, respectively.

  • Self-Aligned Planar Metal Double-Gate Polycrystalline-Silicon Thin-Film Transistors Fabricated at Low Temperature on Glass Substrate

    Hiroyuki OGATA  Kenji ICHIJO  Kenji KONDO  Akito HARA  

     
    BRIEF PAPER-Semiconductor Materials and Devices

      Vol:
    E96-C No:2
      Page(s):
    285-288

    A multigate polycrystalline-silicon (poly-Si) thin-film transistor (TFT) is a recently popular topic in the field of Si devices. In this study, self-aligned planar metal double-gate poly-Si TFTs consisting of an embedded bottom metal gate, a top metal gate fabricated by a self-alignment process, and a lateral poly-Si film with a grain size greater than 2 µm were fabricated on a glass substrate at 550. The nominal field-effect mobility of an n-channel TFT is 530 cm2/Vs, and its subthreshold slope is 140 mV/dec. The performance of the proposed TFTs is superior to that of top-gate TFTs fabricated using equivalent processes.

  • A Spiral Curve Based Chord Enabling Resource Sharing for Wireless Mesh Networks: A Location Awareness and Cross-Layering Approach

    Hui ZHOU  Jie YANG  

     
    PAPER-Network

      Vol:
    E96-B No:2
      Page(s):
    508-521

    The contradictions created by the differences in mass P2P data and transfer capability of wireless networks, and mismatch of overlay network topology and physical network topology are the main barriers hindering the implementation of P2P resource sharing in wireless multi-hop networks. This paper investigates the problem of enabling P2P resource sharing in WMNs with two-tier architecture. SpiralChord, the DHT approach implemented through routers in the upper tier, is proposed to address the major problems of wireless resource sharing – how to efficiently find resources currently available and reduce redundant messages as much as possible. SpiralChord uses an ID assignment technique to integrate location awareness with cross-layering. Location awareness aims at alleviating mismatch in physical network topology and overlay network topology, and it is designed to map neighboring routers to close-by IDs in the logical ring. Cross-layering aims at speeding up resource lookup operations in the application layer by exploiting the information that is available at the MAC layer, and it tends to be more effective when physically neighboring routers have faraway IDs in the logical ring. An ID assignment strategy based on spiral curve is proposed to meet the contradictory requirements of location awareness and cross-layering, mapping a peer's neighbors in the overlay network to peers which are its physical neighbors and distributing the remaining physical neighbors as widely as possible in the overlay network. In addition, a mobility management mechanism is proposed to address the adverse effect of the movements of clients in lower tier on resource sharing. A client is assigned a managing router to take the responsibility for the location of the client. Simulations show SpiralChord is more effective in reducing message overhead and increasing lookup performance than Chord, and mobility management for mobile clients performs well at reducing message overhead caused by mobile clients in SpiralChord.

  • On the Asymptotic Optimality of Fixed Rate Scheduling in Fading Multiuser Wideband OFDM Networks

    Xiangyu GAO  Yuesheng ZHU  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E96-B No:2
      Page(s):
    632-634

    In this letter, we prove that for fading multiuser orthogonal frequency division multiplexing networks, a simple fixed rate scheduling scheme with only 1 bit channel state information feedback is capable of achieving the optimal performance in the wideband limit. This result indicates that the complexities of both the feedback and channel coding schemes can be reduced with nearly no system performance penalty in wideband wireless communication environments.

  • FOREWORD

    Takeshi SHIMA  

     
    FOREWORD

      Vol:
    E96-A No:2
      Page(s):
    401-401
  • Low Phase Noise 14-Bit Digitally Controlled CMOS Quadrature Ring Oscillator

    Ramesh K. POKHAREL  Prapto NUGROHO  Awinash ANAND  Abhishek TOMAR  Haruichi KANAYA  Keiji YOSHIDA  

     
    PAPER-Microwaves, Millimeter-Waves

      Vol:
    E96-C No:2
      Page(s):
    262-269

    High phase noise is a common problem in ring oscillators. Continuous conduction of the transistor in an analog tuning method degrades the phase noise of ring oscillators. In this paper, a digital control tuning which completely switches the transistors on and off, and a 1/f noise reduction technique are employed to reduce the phase noise. A 14-bit control signal is employed to obtain a small frequency step and a wide tuning range. Furthermore, multiphase ring oscillator with a sub-feedback loop topology is used to obtain a stable quadrature outputs with even number of stages and to increase the output frequency. The measured DCO has a frequency tuning range from 554 MHz to 2.405 GHz. The power dissipation is 112 mW from 1.8 V power supply. The phase noise at 4 MHz offset and 2.4 GHz center frequency is -134.82 dBc/Hz. The FoM is -169.9 dBc/Hz which is a 6.3 dB improvement over the previous oscillator design.

  • RF Front-End and Complex BPF for Reconfigurable Low-IF Receiver

    Hsiao-Chin CHEN  Shu-Wei CHANG  Bo-Rong TU  

     
    PAPER-Microwaves, Millimeter-Waves

      Vol:
    E96-C No:2
      Page(s):
    251-261

    A LNA, an RF front-end and a 6th–order complex BPF for reconfigurable low-IF receivers are demonstrated in this work. Due to the noise cancellation, the two-stage LNA presents a low NF of 2.8 to 3.3 dB from 0.8 to 6 GHz. Moreover, the LNA delivers two kinds of gain curves with IIP3 of -2.6 dBm by employing the capacitive degeneration and the resistive gain-curve shaping in the second stage. The flicker noise corner frequency of the down-converter has been considered and the measured fC of the RF front-end is 200 kHz. The RF front-end also provides two kinds of gain curves. For the low-frequency mode, the conversion gain is 28.831.1 dB from 800 MHz to 2.4 GHz. For the high-frequency mode, the conversion gain is 26.827.4 dB from 3 to 5 GHz. The complex BPF is realized with gm-C LPFs by shifting the low-pass frequency response. With variable transconductances and capacitors, a fixed ratio of the centre frequency to the bandwidth (2) is achieved by varying the bandwidth and the centre frequency of the LPF simultaneously. The complex BPF has a variable bandwidth from 200 kHz to 6.4 MHz while achieving an image rejection of 44 dB.

  • Improved Seam Merging for Content-Aware Image Resizing

    Kazu MISHIBA  Masaaki IKEHARA  Takeshi YOSHITOME  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E96-D No:2
      Page(s):
    349-356

    In this paper, we propose an improved seam merging method for content-aware image resizing. This method merges a two-pixel-width seam element into one new pixel in image reduction and inserts a new pixel between the two pixels in image enlargement. To preserve important contents and structure, our method uses energy terms associated with importance and structure. Our method preserve the main structures by using a cartoon version of the original image when calculating the structure energy. In addition, we introduce a new energy term to suppress the distortion generated by excessive reduction or enlargement in iterated merger or insertion. Experimental results demonstrate that the proposed method can produce satisfactory results in both image reduction and enlargement.

  • Dynamic and Safe Path Planning Based on Support Vector Machine among Multi Moving Obstacles for Autonomous Vehicles

    Quoc Huy DO  Seiichi MITA  Hossein Tehrani Nik NEJAD  Long HAN  

     
    PAPER-Artificial Intelligence, Data Mining

      Vol:
    E96-D No:2
      Page(s):
    314-328

    We propose a practical local and global path-planning algorithm for an autonomous vehicle or a car-like robot in an unknown semi-structured (or unstructured) environment, where obstacles are detected online by the vehicle's sensors. The algorithm utilizes a probabilistic method based on particle filters to estimate the dynamic obstacles' locations, a support vector machine to provide the critical points and Bezier curves to smooth the generated path. The generated path safely travels through various static and moving obstacles and satisfies the vehicle's movement constraints. The algorithm is implemented and verified on simulation software. Simulation results demonstrate the effectiveness of the proposed method in complicated scenarios that posit the existence of multi moving objects.

  • Autonomous IP Fast Rerouting with Compressed Backup Flow Entries Using OpenFlow

    Shohei KAMAMURA  Daisaku SHIMAZAKI  Atsushi HIRAMATSU  Hidenori NAKAZATO  

     
    PAPER

      Vol:
    E96-D No:2
      Page(s):
    184-192

    This paper proposes an IP fast rerouting method which can be implemented in OpenFlow framework. While the current IP is robust, its reactive and global rerouting processes require the long recovery time against failure. On the other hand, IP fast rerouting provides a milliseconds-order recovery time by proactive and local restoration mechanism. Implementation of IP fast rerouting is not common in real systems, however; it requires the coordination of additional forwarding functions to a commercial hardware. We propose an IP fast rerouting mechanism using OpenFlow that separates control function from hardware implementation. Our mechanism does not require any extension of current forwarding hardware. On the contrary, increase of backup routes becomes main overhead of our proposal. We also embed the compression mechanism to our IP fast rerouting mechanism. We show the effectiveness of our IP fast rerouting in terms of the fast restoration and the backup routes compression effect through computer simulations.

  • Electro-Optic Modulators Using Double Antenna-Coupled Electrodes for Radio-over-Fiber Systems

    Naohiro KOHMU  Hiroshi MURATA  Yasuyuki OKAMURA  

     
    PAPER

      Vol:
    E96-C No:2
      Page(s):
    204-211

    We propose new electro-optic modulators using a double antenna-coupled electrode structure for radio-over-fiber systems. The proposed modulators are composed of a pair of patch antennas and a standing-wave resonant electrode. By utilizing a pair of patch antennas on SiO2 substrates and a coupled-microstrip line resonant electrode on a LiNbO3 substrate with a symmetric configuration, high-efficiency optical modulation is obtainable for 24 optical waveguides at the same time. The proposed modulators were designed at 58 GHz and their basic operations were demonstrated successfully with an improvement of 9 dB compared to a single antenna-coupled electrode device on a LiNbO3 substrate in our previous work.

  • Exact Design of RC Polyphase Filters and Related Issues

    Hiroshi TANIMOTO  

     
    INVITED PAPER

      Vol:
    E96-A No:2
      Page(s):
    402-414

    This paper presents analysis and design of passive RC polyphase filters (RCPFs) in tutorial style. Single-phase model of a single-stage RCPF is derived, and then, multi-stage RCPFs are analyzed and obtained some restrictions for realizable poles and zeros locations of RCPFs. Exact design methods of RCPFs with equal ripple type, and Butterworth type responses are explained for transfer function design and element value design along with some design examples.

  • 60 GHz Millimeter-Wave CMOS Integrated On-Chip Open Loop Resonator Bandpass Filters on Patterned Ground Shields

    Ramesh K. POKHAREL  Xin LIU  Dayang A.A. MAT  Ruibing DONG  Haruichi KANAYA  Keiji YOSHIDA  

     
    PAPER-Microwaves, Millimeter-Waves

      Vol:
    E96-C No:2
      Page(s):
    270-276

    This paper presents the design of a second-order and a fourth-order bandpass filter (BPF) for 60 GHz millimeter-wave applications in 0.18 µm CMOS technology. The proposed on-chip BPFs employ the folded open loop structure designed on pattern ground shields. The adoption of a folded structure and utilization of multiple transmission zeros in the stopband permit the compact size and high selectivity for the BPF. Moreover, the pattern ground shields obviously slow down the guided waves which enable further reduction in the physical length of the resonator, and this, in turn, results in improvement of the insertion losses. A very good agreement between the electromagnetic (EM) simulations and measurement results has been achieved. As a result, the second-order BPF has the center frequency of 57.5 GHz, insertion loss of 2.77 dB, bandwidth of 14 GHz, return loss less than 27.5 dB and chip size of 650 µm810 µm (including bonding pads) while the fourth-order BPF has the center frequency of 57 GHz, insertion loss of 3.06 dB, bandwidth of 12 GHz, return loss less than 30 dB with chip size of 905 µm810 µm (including bonding pads).

  • An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range

    Guangchun LUO  Hao CHEN  Caihui QU  Yuhai LIU  Ke QIN  

     
    PAPER-Fundamentals of Information Systems

      Vol:
    E96-D No:2
      Page(s):
    270-277

    Tree partitioning arises in many parallel and distributed computing applications and storage systems. Some operator scheduling problems need to partition a tree into a number of vertex-disjoint subtrees such that some constraints are satisfied and some criteria are optimized. Given a tree T with each vertex or node assigned a nonnegative integer weight, two nonnegative integers l and u (l < u), and a positive integer p, we consider the following tree partitioning problems: partitioning T into minimum number of subtrees or p subtrees, with the condition that the sum of node weights in each subtree is at most u and at least l. To solve the two problems, we provide a fast polynomial-time algorithm, including a pre-processing method and another bottom-up scheme with dynamic programming. With experimental studies, we show that our algorithm outperforms another prior algorithm presented by Ito et al. greatly.

  • Utility Based Cross-Layer Resource Allocation in Multiuser OFDM-Based Cognitive Radio Systems

    Errong PEI  Xiaorong JING  Fang CHENG  

     
    LETTER-Terrestrial Wireless Communication/Broadcasting Technologies

      Vol:
    E96-B No:2
      Page(s):
    677-680

    In OFDM-based cognitive radio systems, due to the out-of-band leakage from the secondary transmission, the interference to primary users must be considered in order to guarantee the quality of service of the primary transmission. For multiuser cognitive radio systems, there exist two crucial issues in resource allocation: fairness and efficiency, in order to balance the two issues, we proposed a new utility-based cross-layer resource allocation algorithm, which can not only control the interference to primary users caused by secondary users, but also balance the spectral efficiency and fairness among cognitive users. Further, the optimal NP-hard resource allocation problem in multiuser OFDM-based systems is reduced to the sub-optimal solution by dividing the original problem into the subcarrier allocation problem and the power allocation problem. It is shown that the proposed algorithm can obtain the best performance in terms of the average rate or the utility among existing algorithms, and at the same time, all the users obtain fair resource allocation.

  • Channel Condition Number Based Switching Detection Scheme in MIMO-OFDM System

    Jang-Kyun AHN  Seung-Jun YU  Hyoung-Kyu SONG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E96-A No:1
      Page(s):
    387-390

    In this letter, we propose a innovative threshold receiver for MIMO-OFDM system. The proposed scheme calculates the channel condition number and then selects either combined V algorithm and CLLL or combined QRD-M and DFE detection scheme according to channel information. The complexity of the proposed scheme is about 33.3% of the QRD-M for 44 MIMO-OFDM system.

  • Software Radio-Based Distributed Multi-User MIMO Testbed: Towards Green Wireless Communications

    Hidekazu MURATA  Susumu YOSHIDA  Koji YAMAMOTO  Daisuke UMEHARA  Satoshi DENNO  Masahiro MORIKURA  

     
    INVITED PAPER

      Vol:
    E96-A No:1
      Page(s):
    247-254

    The present paper introduces a prototype design and experimental results for a multi-user MIMO linear precoding system. A base station and two mobile stations are implemented by taking full advantage of the software-defined radio. The base station consists of general purpose signal analyzers and signal generators controlled by a personal computer. Universal software radio peripherals are used as mobile stations. Linear spatial precoding and a simple two-way channel estimation technique are adopted in this experimental system. In-lab and field transmission experiments are carried out, and the bit error rate performance is evaluated. The impact of the channel estimation error under average channel gain discrepancy between two mobile stations is analyzed through computer simulations. Channel estimation error is shown to have a greater influence on the mobile station with the greater average channel gain.

  • Cryptanalysis of INCrypt32 in HID's iCLASS Systems

    ChangKyun KIM  Eun-Gu JUNG  Dong Hoon LEE  Chang-Ho JUNG  Daewan HAN  

     
    PAPER-Symmetric Key Cryptography

      Vol:
    E96-A No:1
      Page(s):
    35-41

    The cryptographic algorithm called INCrypt32 is a MAC algorithm to authenticate participants, RFID cards and readers, in HID Global's iCLASS systems. HID's iCLASS cards are widely used contactless smart cards for physical access control. Although INCrypt32 is a heart of the security of HID's iCLASS systems, its security has not been evaluated yet since the specification has not been open to public. In this paper, we reveal the specification of INCrypt32 by reverse-engineering iCLASS cards and investigate the security of INCrypt32 with respect to the cryptographic sense. This result is the first work to describe the details of INCrypt32 and the possibility of a secret key (64-bit) recovery in our attack environments. 242 MAC queries are required in the real environment using secure communication protocols. But the required number of MAC queries decreases to 218 if MAC quires for chosen messages with arbitrary length can be requested.

  • Efficient (Hierarchical) Inner-Product Encryption Tightly Reduced from the Decisional Linear Assumption

    Tatsuaki OKAMOTO  Katsuyuki TAKASHIMA  

     
    PAPER-Public Key Based Protocols

      Vol:
    E96-A No:1
      Page(s):
    42-52

    This paper proposes an inner-product encryption (IPE) scheme, which achieves selectively fully-attribute-hiding security in the standard model almost tightly reduced from the decisional linear (DLIN) assumption, and whose ciphertext is almost the shortest among the existing (weakly/fully) attribute-hiding IPE schemes, i.e., it consists of n+4 elements of G and 1 element of GT for a prime-order symmetric bilinear group (G, GT), where n is the dimension of attribute/predicate vectors. We also present a variant of the proposed IPE scheme that enjoys shorter public and secret keys with preserving the security. A hierarchical IPE (HIPE) scheme can be realized that has short ciphertexts and selectively fully-attribute-hiding security almost tightly reduced from the DLIN assumption.

  • Adaptive Coupling Method Based on Optimal Subcarrier Spacing for OFDM System

    Yi WANG  Qianbin CHEN  Xing Zhe HOU  Hong TANG  Zufan ZHANG  Ken LONG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E96-B No:1
      Page(s):
    360-362

    Orthogonal frequency division multiplexing (OFDM) is very sensitive to the frequency errors caused by phase noise and Doppler shift. These errors will disturb the orthogonality among subcarriers and cause intercarrier interference (ICI). A simple method to combat ICI is proposed in this letter. The main idea is to map each data symbol onto a couple of subcarriers rather to a single subcarrier. Different from the conventional adjacent coupling and symmetric coupling methods, the frequency diversity can be utilized more efficiently by the proposed adaptive coupling method based on optimal subcarrier spacing. Numerical results show that our proposed method provides a robust signal-to-noise ratio (SNR) improvement over the conventional coupling methods.

11681-11700hit(42807hit)