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

Keyword Search Result

[Keyword] RIN(2923hit)

1941-1960hit(2923hit)

  • Subcarrier Clustering in Adaptive Array Antenna for OFDM Systems in the Presence of Co-channel Interference

    Hidehiro MATSUOKA  Yong SUN  

     
    PAPER-Wireless Network System Performances

      Vol:
    E87-C No:9
      Page(s):
    1477-1484

    For future high-speed wireless communications using orthogonal frequency division multiplexing (OFDM), two major system requirements will emerge: throughput improvement and rich interference elimination. Because of its broadband nature and limited frequency allocations worldwide, interference from co-located wireless LAN's operating in the same frequency band will become a serious deployment issue. Adaptive array antenna can enhance the performance by suppressing the co-channel interference even when interference may have a large amount of multipath and also have similar received power to the desired signal. There are typically two types of adaptive array architecture for OFDM systems, whose signal processing is carried out before or after FFT (Fast Fourier Transform). In general, the pre-FFT array processing has low complexity, but in rich multipath and interference environments, the performance will deteriorate drastically. In contrast, the post-FFT array processing can provide the optimum performance even in such severe environments at the cost of complexity. Therefore, complexity-reduction techniques combined with the achievement of high system performance will be a key issue for adaptive array antenna applications. This paper proposes novel adaptive array architecture, which is a complexity-reduction technique using subcarrier clustering for post-FFT adaptive array. In the proposed scheme, plural subcarriers can be clustered into a group with the same spatial weight. Simulation results show that the proposed architecture is a promising candidate for real implementation, since it can achieve high performance with much lower complexity even in a rich multipath environment with low signal to noise plus interference ratio (SNIR).

  • Modeling the Point-to-Point Wireless Communication Channel under the Adverse Weather Conditions

    Sermsak JARUWATANADILOK  Urachada KETPROM  Yasuo KUGA  Akira ISHIMARU  

     
    PAPER-Antennas and Propagation for Wireless Communications

      Vol:
    E87-C No:9
      Page(s):
    1455-1462

    Point-to-point optical and millimeter wave communication has recently been of interest, especially in urban areas. Its benefits include simpler and easier installation compared with a land-based line. However, this technology suffers when adverse weather conditions are present, such as rain, fog and clouds, which induce scattering and absorption of the optical wave. The effects of scattering and absorption degrade the quality of the communication link resulting in increase of bit-error-rate. Therefore, there exists a need for accurate channel characterization in order to understand and mitigate the problem. In this paper, radiative transfer theory is employed to study the behavior of amplitude modulated signal propagating through a random medium. We show the effect of the medium to a modulated signal and relate the outcome on the quality of the communication link.

  • Cryogenic Whispering Gallery Sapphire Oscillator for Microwave Frequency Standard Applications

    Ken-ichi WATABE  Yasuki KOGA  Shin-ichi OHSHIMA  Takeshi IKEGAMI  John G. HARTNETT  

     
    LETTER-Microwaves, Millimeter-Waves

      Vol:
    E87-C No:9
      Page(s):
    1640-1642

    A cryogenic Whispering Gallery sapphire resonator oscillator has been investigated using a 4 K pulse-tube cryocooler. The turnover temperature of the chosen mode in the sapphire crystal was 9.17 K with an unloaded Q-factor of 7108. The prototype sapphire-loaded cavity oscillator was designed to oscillate at 9.195 GHz. A fractional frequency stability of 210-13 was measured at integration times of 10 s.

  • Shrink-Wrapped Boundary Face (SWBF) Algorithm for Mesh Reconstruction from Unorganized 3D Points

    Young-Kyu CHOI  Bon-Ki KOO  Byoung-Tae CHOI  

     
    LETTER-Computer Graphics

      Vol:
    E87-D No:9
      Page(s):
    2283-2285

    A new mesh reconstruction method, called the shrink-wrapped boundary face (SWBF) algorithm, is proposed for approximating a surface from a set of unorganized 3D points. SWBF overcomes the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique. Furthermore, SWBF is much faster since it requires only local nearest-point-search in the shrinking process. Our experimental results demonstrate that SWBF is very robust and efficient, and it is expected to become a general solution for reconstructing a mesh from an unorganized points cloud.

  • A Study on Estimation of Mobility of Terminals for Hierarchical Mobility Management Scheme

    Keita KAWANO  Kazuhiko KINOSHITA  Koso MURAKAMI  

     
    PAPER-Mobility Management

      Vol:
    E87-B No:9
      Page(s):
    2557-2566

    Hierarchical Mobile IPv6 (HMIPv6) has been proposed to manage the mobility of Mobile Terminals (MTs) hierarchically to reduce packet losses during local handover. HMIPv6 uses a mobility manageable router in a domain visited by the MTs to manage the micromobility of the MTs. The router is called Mobility Anchor Point (MAP). As a hierarchical mobility management scheme based on HMIPv6, we have already proposed a multilevel hierarchical distributed IP mobility management scheme to manage the mobility of MTs in a decentralized manner using multiple MAPs. Our scheme manages the mobility of an MT using a MAP having a suitable management domain. This usage of MAPs aims to efficiently decentralize the load of mobility management. Our scheme estimates the movement speed of the MT and then estimates the mobility of the MT based on the estimated movement speed of the MT to achieve the objective. However, recent simulation results obtained with more realistic mobility model indicate that our scheme has two problems in estimating the mobility of MTs: One is that our current scheme misestimates the movement speed of an MT in some cases, and the other is that our current scheme does not notice the changes in the mobility of an MT when the MT decelerates and stays in the same access area for a long time. Thus, an enhanced mobility estimation method is proposed in this paper. The enhanced method has an ability to estimate the movement speed of MTs more correctly and an ability to urge decelerated MTs to degrade their MAP quickly. Finally, the performance of the proposed mobility estimation method is evaluated using simulation experiments. The simulation results show that the enhanced method allows our scheme to estimate the mobility of MTs more correctly and so achieve more efficient load sharing.

  • Performance Analysis of the Wavelet-Based Generalized Sidelobe Canceller in the Presence of Random Steering Errors

    Yi CHU  

     
    PAPER-Antennas and Propagation

      Vol:
    E87-B No:9
      Page(s):
    2783-2790

    In this paper, we examine the effect of random steering errors on the signal-to-interference-plus-noise-ratio (SINR) at the output of the recently addressed wavelet-based generalized sidelobe canceller (GSC). This new beamformer employs a set of P-regular M-band wavelet bases for the design of the blocking matrix of the GSC. We first carry out a general expression of the output SINR of the GSC with multiple interferers present. With this expression, we then examine the analysis of wavelet-based GSC by expressing the SINR in terms of parameters such as the regularity of wavelet filters, the number of bands of wavelet filters, the length of adaptive weights, and the input signal-to-noise ratio (SNR). Some simulation results verify the analytically predicted performance.

  • A Dynamic Routing Algorithm for MPLS Networks

    Kyungmi PARK  Jinhan SONG  Saewoong BAHK  

     
    LETTER-Network

      Vol:
    E87-B No:8
      Page(s):
    2435-2437

    We propose a new dynamic routing algorithm that uses traffic and network state information to minimize the blocking rate and link congestion level. Our scheme uses the currently available link capacity in calculating the link weight by modifying Wang's approach, and computes the shortest path when a new call comes into the network. We consider the blocking count based update mechanism and the timer based mechanism, and conclude that the former is better than the latter in terms of efficiency and complexity.

  • Fast Fingerprint Classification Based on Direction Pattern

    Jinqing QI  Dongju LI  Tsuyoshi ISSHIKI  Hiroaki KUNIEDA  

     
    PAPER-Image/Visual Signal Processing

      Vol:
    E87-A No:8
      Page(s):
    1887-1892

    A new and fast fingerprint classification method based on direction patterns is presented in this paper. This method is developed to be applicable to today's embedded fingerprint authentication system, in which small area sensors are widely used. Direction patterns are well treated in the direction map at block level, where each block consists of 88 pixels. It is demonstrated that the search of directions pattern in specific area, generally called as pattern area, is able to classify fingerprints clearly and quickly. With our algorithm, the classification accuracy of 89% is achieved over 4000 images in the NIST-4 database, slightly lower than the conventional approaches. However, the classification speed is improved tremendously up to about 10 times as fast as conventional singular point approaches.

  • Impact of Lead Free Soldering Processes on the Reliability of Electromechanical Switching Devices

    Werner JOHLER  

     
    PAPER-New Technology and Automotive Applications

      Vol:
    E87-C No:8
      Page(s):
    1225-1234

    Various effective and draft legislations and rules in Europe (WEEE--Waste Electrical and Electronic Equipment ROHS--Restrictions on the use of certain substances and ELV--End of life of vehicles) and Japan (Recycling Law for Home Electric Appliances) have either targeted restrictions or fully banned on the use of lead, to be enforced from 2001, 2003 and 2006 onwards. Up to now, mainly tin-lead alloys have been used in electronics. The process temperatures usually applied have been in the range of 230. All currently discussed lead-free alternatives for professional electronics need process temperatures which are at least 20 higher. In addition, the process duration is significantly longer. The combination of higher process temperatures and longer duration results in significant thermal stress on electromechanical devices. In particular the precision mechanics of electromechanical relays must withstand the solder process with maximum process temperatures of 255 without dimensional changes. During the transition from tin-lead to lead-free solder processes all combinations of component surfaces and solder must be possible. The selection of pure Sn100 or SnCu0.7 as terminal surface allows mixed assemblies with tin-lead as well as lead-free solders. All tested combinations of terminal surface, PCB surface and solder showed good results. From these results it can be concluded that mixed assemblies are possible during the transition time without any negative impact on the reliability of the electronic devices.

  • A Clustering-Based Anomaly Intrusion Detector for a Host Computer

    Sang Hyun OH  Won Suk LEE  

     
    PAPER-Application Information Security

      Vol:
    E87-D No:8
      Page(s):
    2086-2094

    For detecting the anomalous behavior of a user effectively, most researches have concentrated on statistical techniques. However, since statistical techniques mainly analyze the average behavior of a user's activities, some anomalies can be detected inaccurately. In addition, it is difficult to model intermittent activities performed periodically. In order to model the normal behavior of a user closely, a set of various features can be employed. Given an activity of a user, the values of those features that are related to the activity represent the behavior of the activity. Furthermore, activities performed in a session of a user can be regarded as a semantically atomic transaction. Although it is possible to apply clustering technique to these values to extract the normal behavior of a user, most of conventional clustering algorithms do not consider any transactional boundary in a data set. In this paper, a transaction-based clustering algorithm for modeling the normal behavior of a user is proposed. Based on the activities of the past transactions, a set of clusters for each feature can be found to represent the normal behavior of a user as a concise profile. As a result, any anomalous behavior in an online transaction of the user can be effectively detected based on the profile of the user.

  • Efficient Adaptive Stereo Echo Canceling Schemes Based on Simultaneous Use of Multiple State Data

    Masahiro YUKAWA  Isao YAMADA  

     
    PAPER-Speech/Acoustic Signal Processing

      Vol:
    E87-A No:8
      Page(s):
    1949-1957

    In this paper, we propose two adaptive filtering schemes for Stereophonic Acoustic Echo Cancellation (SAEC), which are based on the adaptive projected subgradient method (Yamada et al., 2003). To overcome the so-called non-uniqueness problem, the schemes utilize a certain preprocessing technique which generates two different states of input signals. The first one simultaneously uses, for fast convergence, data from two states of inputs, meanwhile the other selects, for stability, data based on a simple min-max criteria. In addition to the above difference, the proposed schemes commonly enjoy (i) robustness against noise by introducing the stochastic property sets, and (ii) only linear computational complexity, since it is free from solving systems of linear equations. Numerical examples demonstrate that the proposed schemes achieve, even in noisy situations, compared with the conventional technique, (i) much faster and more stable convergence in the learning process as well as (ii) lower level mis-identification of echo paths and higher level Echo Return Loss Enhancement (ERLE) around the steady state.

  • A Study on Transmission Characteristics and EM Field Distributions on the Transmission Lines with Difference of Structure

    Ken-ichi TAKAHASHI  Takashi KASUGA  Hiroshi INOUE  

     
    LETTER

      Vol:
    E87-C No:8
      Page(s):
    1286-1288

    The effect of the structure with difference on cross-section for the enlarged models that simulates signal transmission line (STL) in the magnetic head of HDD is discussed. The experimental results suggested that strip and shield structure are effective for suppression of EMI.

  • A Prediction Method of Common-Mode Excitation on a Printed Circuit Board Having a Signal Trace near the Ground Edge

    Tetsushi WATANABE  Hiroshi FUJIHARA  Osami WADA  Ryuji KOGA  Yoshio KAMI  

     
    PAPER-Electromagnetic Compatibility(EMC)

      Vol:
    E87-B No:8
      Page(s):
    2327-2334

    Common-mode excitation caused by an imperfect ground plane on a printed circuit board (PCB) has been conventionally explained with the 'current driven' scheme, in which the common-mode current is driven by the ground voltage across the unintentional inductance of the ground plane. We have developed an alternative method for estimating common-mode excitation that is driven by the difference of the common-mode voltages for two connected transmission lines. A parameter called current division factor (CDF) that represents the degree of imbalance of a transmission line explains the common-mode voltage. In this paper, we calculate the CDF with two-dimensional (2-D) static electric field analysis by using the boundary element method (BEM) for asymmetric transmission lines with an arbitrary cross-section. The proposed 2-D method requires less time than three-dimensional simulations. The EMI increase due to a signal line being close to the edge of the ground pattern was evaluated through CDF calculation. The estimated increase agreed well--within 2 dB--with the measured one.

  • Design, Analysis, and Implementation of a Low-Profile Resonant DC-to-DC Converter Using PCB Transformer

    Byungcho CHOI  Donghyung KIM  Kijo LEE  

     
    PAPER-Energy in Electronics Communications

      Vol:
    E87-B No:8
      Page(s):
    2335-2341

    The current paper presents the design, analysis, and implementation of a low-profile resonant dc-to-dc converter that utilizes a coreless printed circuit board transformer as a substitute for the conventional magnetic core-based transformer. A prototype series resonant converter, fabricated in a 40 mm80 mm area with a 4 mm thickness while achieving the maximum efficiency of 85% at a 58 W output power, is used as an example to address the theoretical and practical issues involved in the design, analysis, and implementation of a PCB transformer-based low-profile dc-to-dc converter.

  • Binary Line-Pattern Algorithm for Embedded Fingerprint Authentication System

    Jinqing QI  Dongju LI  Tsuyoshi ISSHIKI  Hiroaki KUNIEDA  

     
    PAPER-Image/Visual Signal Processing

      Vol:
    E87-A No:8
      Page(s):
    1879-1886

    A novel binary line-pattern algorithm for embedded fingerprint authentication system is introduced in this paper. In this algorithm, each line-pattern is a one-dimension binary matrix that describes the alternation pattern of ridge and valley in fingerprint image. Two parallel lines or two cross lines in a certain scope make up related line-pattern pair. Several such line-pattern pairs at different parts of a fingerprint image can describe another intrinsic feature besides traditional minutiae feature. Experimental results showed this algorithm was not only efficient but also effective. Furthermore, a hybrid fingerprint match scheme is also introduced in this paper. It has the following features: (i) minutiae matching is firstly carried out to calculate the similarity score between the query fingerprint and the template fingerprint, and moreover, the translation and rotation parameters are obtained at the same time; (ii) line-pattern algorithm is immediately performed based on the parameters obtained after minutiae matching to get another similarity score; (iii) the final matching score is the combination of the minutiae matching score and the line-pattern matching score. Experiments were conducted on the FVC2002 database and our private database respectively. Both of the results were inspiring. In detail, at the same FAR value, the FRR of this hybrid match algorithm is to be 2-8% lower than only minutiae-based matching algorithm.

  • Algorithmic Concept Recognition to Support High Performance Code Reengineering

    Beniamino DI MARTINO  

     
    PAPER-Software Support and Optimization Techniques

      Vol:
    E87-D No:7
      Page(s):
    1743-1750

    Techniques for automatic program recognition, at the algorithmic level, could be of high interest for the area of Software Maintenance, in particular for knowledge based reengineering, because the selection of suitable restructuring strategies is mainly driven by algorithmic features of the code. In this paper an automated hierarchical concept parsing recognition technique, and a formalism for the specification of algorithmic concepts, is presented. Based on this technique, the design and development of ALCOR, a production rule based system for automatic recognition of algorithmic concepts within programs, aimed at support of knowledge based reengineering for high performance, is presented.

  • A Distributed 3D Rendering Application for Massive Data Sets

    Huabing ZHU  Tony K.Y. CHAN  Lizhe WANG  Reginald C. JEGATHESE  

     
    PAPER-Distributed, Grid and P2P Computing

      Vol:
    E87-D No:7
      Page(s):
    1805-1812

    This paper presents a prototype of a distributed 3D rendering system in a hierarchical Grid environment. 3D rendering with massive data sets is a computationally intensive task. In order to make full use of computational resources on Grids, a hierarchical system architecture is designed to run over multiple clusters. This architecture involves both sort-first and sort-last parallel rendering algorithms to achieve excellent scalability, rendering performance and load balance.

  • Optical Packet Switching Network Based on Ultra-Fast Optical Code Label Processing

    Naoya WADA  Hiroaki HARAI  Fumito KUBOTA  

     
    INVITED PAPER

      Vol:
    E87-C No:7
      Page(s):
    1090-1096

    Ultrahigh-speed all-optical label processing method is proposed and experimentally demonstrated. This processing method dramatically increases the label processing capability. Optical packet switch (OPS) systems and networks based on OPS nodes are applications of optical processing technologies. For the experiment, we constructed the world's first 40 Gbit/s/port OPS prototype with an all-optical label processor, optical switch, optical buffer, and electronic scheduler. Three-hop optical packet routing using OPS nodes was experimentally demonstrated with it, verifying the feasibility of OPS networks.

  • Efficient Secret Sharing Schemes Realizing General Access Structures

    Kouya TOCHIKUBO  

     
    PAPER-Information Security

      Vol:
    E87-A No:7
      Page(s):
    1788-1797

    In 1987, Ito, Saito and Nishizeki proposed a secret sharing scheme realizing general access structures, called the multiple assignment secret sharing scheme (MASSS). In this paper, we propose new MASSS's which are perfect secret sharing schemes and include Shamir's (k,n)-threshold schemes as a special case. Furthermore, the proposed schemes are more efficient than the original MASSS from the viewpoint of the number of shares distributed to each participant.

  • Ultrafast All Optical Switching Using Pulse Trapping by Ultrashort Soliton Pulse

    Norihiko NISHIZAWA  Toshio GOTO  

     
    INVITED PAPER

      Vol:
    E87-C No:7
      Page(s):
    1148-1154

    Ultrafast all optical switching using pulse trapping by 100 fs ultrashort soliton pulse across zero dispersion wavelength is investigated. The characteristics of pulse trapping are analyzed both experimentally and numerically. Using the pulse trapping, 1 THz ultrafast all optical switching is demonstrated experimentally. Arbitral one pulse is picked off from pulse train. Pulse trapping for CW signal is also demonstrated and ultrashort pulse is generated by pulse trapping. From these investigation, it is shown that ultrafast all optical switching up to 2 THz can be demonstrated using pulse trapping.

1941-1960hit(2923hit)