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

Keyword Search Result

[Keyword] RIN(2923hit)

1021-1040hit(2923hit)

  • Design of a Baseband Signal Generator in Navigation Satellite Signal Simulators

    Tianlong SONG  Qing CHANG  Wei QI  

     
    LETTER-Navigation, Guidance and Control Systems

      Vol:
    E95-B No:2
      Page(s):
    680-683

    To improve simulation precision, the signal model of navigation satellite signal simulators is illustrated, and the generation mechanism and evaluation criteria of an important error source-phase jitter in baseband signal generation, are studied subsequently. An improved baseband signal generator based on dual-ROM look-up table structure is designed with the application of a newly-established concept-virtual sampling rate. Pre-storage of typical baseband signal data and sampling rate conversion adaptive to Doppler frequency shifts are adopted to achieve the high-precision simulation of baseband signals. Performance analysis of the proposed baseband signal generator demonstrates that it can successfully suppress phase jitter and has better spectral performance, generating high-precision baseband signals, which paves the way to improving the overall precision of navigation satellite signal simulators.

  • An Efficient Dual Charge Pump Circuit Using Charge Sharing Clock Scheme

    Mengshu HUANG  Yimeng ZHANG  Tsutomu YOSHIHARA  

     
    PAPER

      Vol:
    E95-A No:2
      Page(s):
    439-446

    In this paper, the charge pump efficiency is discussed, and a dual charge pump circuit with complementary architecture using charge sharing clock scheme is presented. The proposed charge sharing clock generator is able to recover the charge from parasitic-capacitor charging and discharging, so that the dynamic power loss in the pumping process is reduced by a half. To preserve the overlapping period of the four-phase clock used for threshold cancellation technique, two complementary sets of clocks are generated from the proposed clock generator, and each set feeds a certain branch of the dual charge pump to achieve the between-branch charge sharing. A test chip is fabricated in 0.18 µm process, and the area penalty of the proposed charge sharing clock generator is 1%. From the measurement results, the proposed charge pump shows an overall power efficiency increase with a peak value of 63.7% comparing to 52.3% of a conventional single charge pump without charge sharing, and the proposed clock scheme shows no degradation on the driving capability while the output ripple voltage is reduced by 43%.

  • Protecting Primary Users in Cognitive Radio Networks with Effective Capacity Loss Constraint

    Ding XU  Zhiyong FENG  Ping ZHANG  

     
    LETTER-Terrestrial Wireless Communication/Broadcasting Technologies

      Vol:
    E95-B No:1
      Page(s):
    349-353

    Cognitive radio (CR) in spectrum sharing mode allows secondary user (SU) to share the same spectrum simultaneously with primary user (PU), as long as the former guarantees no harmful interference is caused to the latter. This letter proposes a new type of constraint to protect the PU systems that are carrying delay-sensitive applications, namely the PU effective capacity loss constraint, which sets an upper bound on the maximum effective capacity loss of the PU due to the SU transmission. In addition, the PU effective capacity loss constraint is approximately transformed to the interference temperature (power) constraint, to make it easier to be implemented. As an example, we obtain a closed form expression of the SU effective capacity under the approximated peak interference power constraint and the results of simulations validate the proposed PU protection criterion.

  • Kernel Based Asymmetric Learning for Software Defect Prediction

    Ying MA  Guangchun LUO  Hao CHEN  

     
    LETTER-Software Engineering

      Vol:
    E95-D No:1
      Page(s):
    267-270

    A kernel based asymmetric learning method is developed for software defect prediction. This method improves the performance of the predictor on class imbalanced data, since it is based on kernel principal component analysis. An experiment validates its effectiveness.

  • Improved Algorithms for Calculating Addition Coefficients in Electromagnetic Scattering by Multi-Sphere Systems

    Nguyen Tien DONG  Masahiro TANAKA  Kazuo TANAKA  

     
    PAPER-Scattering and Diffraction

      Vol:
    E95-C No:1
      Page(s):
    27-35

    Evaluation of addition coefficients introduced by the addition theorems for vector spherical harmonics is one of the most intractable problems in electromagnetic scattering by multi-sphere systems. The derivation of the analytical expressions for the addition coefficients is lengthy and complex while the computation of the addition coefficients is annoyingly time-consuming even with the reasonably fast computers available nowadays. This paper presents an efficient algorithm for calculating addition coefficients which is based on the recursive relations of scalar addition coefficients. Numerical results from the formulation derived in this paper agree with those of previous published results but the algorithm proposed here reduces the computational time considerably. This paper also discusses the strengths and limitations of other formulations and numerical techniques found in the literature.

  • Optimization of Field Decomposition for a Mode Matching Technique

    Shinichiro OHNUKI  Takahisa MOCHIZUKI  Kenichiro KOBAYASHI  Tsuneki YAMASAKI  

     
    BRIEF PAPER-Scattering and Diffraction

      Vol:
    E95-C No:1
      Page(s):
    101-104

    We introduce a novel method to optimize field decomposition for a mode matching technique. Using our method, expanded mode numbers can be minimized to achieve the desired digits of computational accuracy.

  • A Simple Broadband Antenna for MIMO Applications in Cognitive Radio

    Dinh Thanh LE  Yoshio KARASAWA  

     
    PAPER-Antennas

      Vol:
    E95-B No:1
      Page(s):
    18-26

    In this paper, a simple type of printed dipole is proposed for Multi-Input Multi-Output (MIMO) applications in cognitive radio. The antenna is composed of a transmission line and a dipole. Some examinations of key factors and optimized parameters of the antenna are presented. The measured results illustrate that the proposed antenna offers a bandwidth of over 50% for Voltage Standing Wave Ratio (VSWR) less than 2, extending from 2.4 GHz to 4.0 GHz. The antenna peak gain in E-plane and radiation patterns at different frequencies are also explored. In addition, based on the proposed antenna, we introduce two simple broadband arrays for MIMO applications in cognitive radio. One has two ports and the other has four ports. Measurement results indicate that the arrays also work in a broad bandwidth. Mutual couplings between ports in each array are kept under -10 dB at the low frequencies and under -20 dB at the high frequencies of bandwidth of the arrays. Furthermore, we utilized the antenna arrays for some MIMO experiments to estimate the channel capacity in a wide frequency range.

  • The IDR-Based IPNMs for the Fast Boundary Element Analysis of Electromagnetic Wave Multiple Scattering

    Norimasa NAKASHIMA  Seiji FUJINO  Mitsuo TATEIBA  

     
    PAPER-Numerical Techniques

      Vol:
    E95-C No:1
      Page(s):
    63-70

    This paper presents the iterative progressive numerical methods (IPNMs) based on the induced dimension reduction (IDR) theorem. The IDR theorem is mainly utilized for the development of new nonstationary linear iterative solvers. On the other hand, the use of the IDR theorem enables to revise the classical linear iterative solvers like the Jacobi, the Gauss-Seidel (GS), the relaxed Jacobi, the successive overrelaxation (SOR), and the symmetric SOR (SSOR) methods. The new IPNMs are based on the revised solvers because the original one is similar to the Jacobi method. In the new IPNMs, namely the IDR-based IPNMs, we repeatedly solve linear systems of equations by using a nonstationary linear iterative solver. An initial guess and a stopping criterion are discussed in order to realize a fast computation. We treat electromagnetic wave scattering from 27 perfectly electric conducting spheres and reports comparatively the performance of the IDR-based IPNMs. However, the IDR-based SOR- and the IDR-based SSOR-type IPNMs are not subject to the above numerical test in this paper because of the problem with an optimal relaxation parameter. The performance evaluation reveals that the IDR-based IPNMs are better than the conventional ones in terms of the net computation time and the application range for the distance between objects. The IDR-based GS-type IPNM is the best among the conventional and the IDR-based IPNMs and converges 5 times faster than a standard computation by way of the boundary element method.

  • Numerical Methods of Multilayered Dielectric Gratings by Application of Shadow Theory to Middle Regions

    Hideaki WAKABAYASHI  Keiji MATSUMOTO  Masamitsu ASAI  Jiro YAMAKITA  

     
    PAPER-Periodic Structures

      Vol:
    E95-C No:1
      Page(s):
    44-52

    In the scattering problem of periodic gratings, at a low grazing limit of incidence, the incident plane wave is completely cancelled by the reflected wave, and the total wave field vanishes and physically becomes a dark shadow. This problem has received much interest recently. Nakayama et al. have proposed “the shadow theory”. The theory was first applied to the diffraction by perfectly conductive gratings as an example, where a new description and a physical mean at a low grazing limit of incidence for the gratings have been discussed. In this paper, the shadow theory is applied to the analyses of multilayered dielectric periodic gratings, and is shown to be valid on the basis of the behavior of electromagnetic waves through the matrix eigenvalue problem. Then, the representation of field distributions is demonstrated for the cases that the eigenvalues degenerate in the middle regions of multilayered gratings in addition to at a low grazing limit of incidence and some numerical examples are given.

  • An Adaptive Handoff Triggering Mechanism for Vehicular Networks

    Luobei KUANG  Zhijun WANG  Ming XU  Yingwen CHEN  

     
    PAPER-ITS

      Vol:
    E95-A No:1
      Page(s):
    278-285

    Handoff plays an important role in vehicular networks due to high movement of vehicles. To provide seamless connectivity under Access Points (AP), this paper proposes an adaptive handoff triggering method to minimize communication time for a vehicle with an AP switch (i.e., whether and when to trigger a handoff process). In the proposed method, combined with an improved data transmission rate based trigger, handoff triggering decision is executed based on three different communication methods (called C-Dire, C-Relay and C-ALLRelay) to minimize the transmission delay when a vehicle moves from an AP to another. Transmission delay is derived through considering vehicle mobility and transmission rate diversity. The simulation results show that the proposed method is proven to be adaptive to vehicular networks.

  • Error Analysis of Multilevel Fast Multipole Algorithm for Electromagnetic Scattering Problems

    Seiya KISHIMOTO  Shinichiro OHNUKI  

     
    PAPER-Numerical Techniques

      Vol:
    E95-C No:1
      Page(s):
    71-78

    Error analysis of the multilevel fast multipole algorithm is studied for electromagnetic scattering problems. We propose novel error prediction and control methods and verify that the computational error for scattering problems with over one million unknowns can be precisely controlled under desired digits of accuracy. Optimum selection of truncation numbers to minimize computational error also will be discussed.

  • A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet

    Yoshifumi SAKAI  

     
    PAPER-Algorithms and Data Structures

      Vol:
    E95-A No:1
      Page(s):
    354-361

    This article presents an algorithm that solves an on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet in O(d+n) time and O(m+d) space, where m is the length of the shorter string, the whole of which is given to the algorithm in advance, n is the length of the longer string, which is given as a data stream, and d is the number of dominant matches between the two strings. A new upper bound, O(p(m-q)), of d is also presented, where p is the length of the LCS of the two strings, and q is the length of the LCS of the shorter string and the m-length prefix of the longer string.

  • Narrow Fingerprint Sensor Verification with Template Updating Technique

    SangWoo SIN  Ru ZHOU  Dongju LI  Tsuyoshi ISSHIKI  Hiroaki KUNIEDA  

     
    PAPER-Algorithms and Data Structures

      Vol:
    E95-A No:1
      Page(s):
    346-353

    A novel Template Updating system for fingerprint verification systems used in mobile applications is introduced in the paper. Based on the proposed method, the system performance is improved much more than the original one. Not only the FRR (False Reject Rate) but also the small overlap problem caused by the very narrow sensor on the mobile phone are solved. Based on the template updating system, templates are replaced with matched inputs towards a target structure which can expand the coverage of templates with large displacement and rotation. By using the test database, the system performance shows the FRR can be reduced by 79% in comparison with the one without template updating procedure. This system was adopted in practical mobile phones in the commercial market in 2009.

  • Kobayashi Potential in Electromagnetism Open Access

    Kohei HONGO  Hirohide SERIZAWA  

     
    INVITED PAPER

      Vol:
    E95-C No:1
      Page(s):
    3-9

    The Kobayashi potential in electromagnetic theory is reviewed. As an illustration we consider two problems, diffraction of plane wave by disk and rectangular plate of perfect conductor. Some numerical results are compared with approximated and experimental results when they are available to verify the validity of the present method. We think the present method can be used as reference solutions of the related problems.

  • A Total-Field/Scattered-Field Boundary for the Multi-Dimensional CIP Method

    Yoshiaki ANDO  Satoi MURAKOSHI  

     
    PAPER-Electromagnetic Theory

      Vol:
    E95-C No:1
      Page(s):
    115-121

    A total-field/scattered-field (TF/SF) boundary for the constrained interpolation profile (CIP) method is proposed for multi-dimensional electromagnetic problems. Incident fields are added to or subtracted from update equations in order to satisfy advection equations into which Maxwell's equations are reduced by means of the directional splitting. Modified incident fields are introduced to take into account electromagnetic fields after advection. The developed TF/SF boundary is examined numerically, and the results show that it operates with good performance. Finally, we apply the proposed TF/SF boundary to a scattering problem, and it can be solved successfully.

  • Sub-Linear Size Traceable Ring Signatures without Random Oracles

    Eiichiro FUJISAKI  

     
    PAPER-Authentication

      Vol:
    E95-A No:1
      Page(s):
    151-166

    Traceable ring signatures, proposed at PKC'07, are a variant of ring signatures, which allow a signer to anonymously sign a message with a tag behind a ring, i.e., a group of users chosen by the signer, unless he signs two messages with the same tag. However, if a signer signs twice on the same tag, the two signatures will be linked and the identity of the signer will be revealed when the two signed messages are different. Traceable ring signatures can be applied to anonymous write-in voting without any special voting authority and electronic coupon services. The previous traceable ring signature scheme relies on random oracles at its security and the signature size is linear in the number of ring members. This paper proposes the first secure traceable ring signature schemes without random oracles in the common reference string model. In addition, the proposed schemes have a signature size of O(), where N is the number of users in the ring.

  • A Note on the Pairing Computation Using Normalized Miller Functions

    Naoki OGURA  Shigenori UCHIYAMA  Naoki KANAYAMA  Eiji OKAMOTO  

     
    PAPER-Mathematics

      Vol:
    E95-A No:1
      Page(s):
    196-203

    This paper considers the normalization of Miller functions for computing “point-evaluation” pairings on an elliptic curve E over a finite field Fq, where the characteristic of Fq is neither 2 nor 3. It is shown that the normalized Miller functions for computing point-evaluation pairings on G2G1 when (i) the embedding degree k is even, or (ii) 3|k and E/Fq(q ≡ (1 mod 3)) is a curve of the form Y2=X3+b. Thus, there is no need to consider the normalization for computing pairings on many pairing-friendly elliptic curves.

  • Design and Fabrication of PTFE-Filled Waveguide Components by SR Direct Etching

    Mitsuyoshi KISHIHARA  Hiroaki IKEUCHI  Yuichi UTSUMI  Tadashi KAWAI  Isao OHTA  

     
    PAPER-Microwaves, Millimeter-Waves

      Vol:
    E95-C No:1
      Page(s):
    122-129

    The metallic waveguide is one of many effective media for millimeter- and submillimeter-waves because of the advantage of its low-loss nature. This paper describes the fabrication method of PTFE-filled waveguide components with the use of the SR (synchrotron radiation) direct etching process of PTFE, sputter deposition of metal, and electroplating. PTFE is known as a difficult material to process with high precision. However, it has been reported that PTFE microstructures can be fabricated by the direct exposure to SR. First, an iris-coupled waveguide BPF with 5-stage Chebyshev response is designed and fabricated for the Q-band. It is demonstrated that the present process is applicable for the fabrication of the practical components inclusive of narrow patterns. Then, a cruciform 3 dB coupler with air-filled posts is designed and fabricated for the Q-band. Directivity and matched state of the coupler can be realized by “holes” in the dielectric material. The measurement results are also shown.

  • A Clustering K-Anonymity Scheme for Location Privacy Preservation

    Lin YAO  Guowei WU  Jia WANG  Feng XIA  Chi LIN  Guojun WANG  

     
    PAPER-Privacy

      Vol:
    E95-D No:1
      Page(s):
    134-142

    The continuous advances in sensing and positioning technologies have resulted in a dramatic increase in popularity of Location-Based Services (LBS). Nevertheless, the LBS can lead to user privacy breach due to sharing location information with potentially malicious services. A high degree of location privacy preservation for LBS is extremely required. In this paper, a clustering K-anonymity scheme for location privacy preservation (namely CK) is proposed. The CK scheme does not rely on a trusted third party to anonymize the location information of users. In CK scheme, the whole area that all the users reside is divided into clusters recursively in order to get cloaked area. The exact location information of the user is replaced by the cloaked spatial temporal boundary (STB) including K users. The user can adjust the resolution of location information with spatial or temporal constraints to meet his personalized privacy requirement. The experimental results show that CK can provide stringent privacy guarantees, strong robustness and high QoS (Quality of Service).

  • Complementary Split Ring Resonator (CSRR)-Loaded Substrate Integrated Waveguide (SIW) Metamaterial Antenna

    Jaehyurk CHOI  Sungjoon LIM  

     
    LETTER-Antennas and Propagation

      Vol:
    E95-B No:1
      Page(s):
    304-307

    We propose a novel metamaterial antenna that is based on loading a single complementary split ring resonator (CSRR) onto a substrate integrated waveguide (SIW) structure. Negative order and zeroth-order resonance can be observed in the proposed structure. These resonance modes are used to reduce the antenna size. In addition, a high quality (Q) factor of the CSRR-loaded SIW structure can minimize the radiation loss. The -1st, 0th, and 1st resonances are experimentally observed at 6.63, 13.68, and 20.31 GHz with maximum gains of 1.59, 3.97, 6.83 dBi, respectively. The electrical size of the antenna at the -1st resonance is only 42% of the resonance of a square microstrip patch antenna.

1021-1040hit(2923hit)