The search functionality is under construction.

Author Search Result

[Author] Qin HUANG(2hit)

1-2hit
  • Unambiguous Tracking Method Based on a New Combination Function for BOC Signals

    Lan YANG  Zulin WANG  Qin HUANG  Lei ZHAO  

     
    PAPER-Navigation, Guidance and Control Systems

      Vol:
    E97-B No:4
      Page(s):
    923-929

    The auto-correlation function (ACF) of Binary Offset Carrier (BOC) modulated signals has multiple peaks which raise the problem of ambiguity in acquisition and tracking. In this paper, the ACF is split into several sub-correlation functions (SCFs) through dividing the integration period of ACF into several partials. Then a pseudo correlation function (PCF) is constructed from the SCFs through a combination function to eliminate all side-peaks. The unambiguous tracking method based on the PCF achieves better code phase tracking accuracy than the conventional methods in AWGN environment. It only requires half computation cost of Bump-Jumping (BJ) and nearly quarter of Double-Estimator, although offers slightly less accurate tracking than BJ and Double-Estimator in multi-path environment. Moreover, this method suits all kinds of BOC signals without any auxiliary correlators.

  • Dynamic Multiple-Threshold Call Admission Control Based on Optimized Genetic Algorithm in Wireless/Mobile Networks

    Shengling WANG  Yong CUI  Rajeev KOODLI  Yibin HOU  Zhangqin HUANG  

     
    PAPER

      Vol:
    E91-A No:7
      Page(s):
    1597-1608

    Due to the dynamics of topology and resources, Call Admission Control (CAC) plays a significant role for increasing resource utilization ratio and guaranteeing users' QoS requirements in wireless/mobile networks. In this paper, a dynamic multi-threshold CAC scheme is proposed to serve multi-class service in a wireless/mobile network. The thresholds are renewed at the beginning of each time interval to react to the changing mobility rate and network load. To find suitable thresholds, a reward-penalty model is designed, which provides different priorities between different service classes and call types through different reward/penalty policies according to network load and average call arrival rate. To speed up the running time of CAC, an Optimized Genetic Algorithm (OGA) is presented, whose components such as encoding, population initialization, fitness function and mutation etc., are all optimized in terms of the traits of the CAC problem. The simulation demonstrates that the proposed CAC scheme outperforms the similar schemes, which means the optimization is realized. Finally, the simulation shows the efficiency of OGA.