The search functionality is under construction.

Author Search Result

[Author] Chen XIE(6hit)

1-6hit
  • A New Non-Uniform Weight-Updating Beamformer for LEO Satellite Communication

    Jie LIU  Zhuochen XIE  Huijie LIU  Zhengmin ZHANG  

     
    LETTER-Digital Signal Processing

      Vol:
    E99-A No:9
      Page(s):
    1708-1711

    In this paper, a new non-uniform weight-updating scheme for adaptive digital beamforming (DBF) is proposed. The unique feature of the letter is that the effective working range of the beamformer is extended and the computational complexity is reduced by introducing the robust DBF based on worst-case performance optimization. The robust parameter for each weight updating is chosen by analyzing the changing rate of the Direction of Arrival (DOA) of desired signal in LEO satellite communication. Simulation results demonstrate the improved performance of the new Non-Uniform Weight-Updating Beamformer (NUWUB).

  • Inertial Estimator Learning Automata

    Junqi ZHANG  Lina NI  Chen XIE  Shangce GAO  Zheng TANG  

     
    PAPER-Numerical Analysis and Optimization

      Vol:
    E95-A No:6
      Page(s):
    1041-1048

    This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator – the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the short-term perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as “optimal”, to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based S ERI scheme, and the deterministic-estimator-based DGPA and DPRI schemes when operating in stationary random environments.

  • AMT-PSO: An Adaptive Magnification Transformation Based Particle Swarm Optimizer

    Junqi ZHANG  Lina NI  Chen XIE  Ying TAN  Zheng TANG  

     
    PAPER-Fundamentals of Information Systems

      Vol:
    E94-D No:4
      Page(s):
    786-797

    This paper presents an adaptive magnification transformation based particle swarm optimizer (AMT-PSO) that provides an adaptive search strategy for each particle along the search process. Magnification transformation is a simple but very powerful mechanism, which is inspired by using a convex lens to see things much clearer. The essence of this transformation is to set a magnifier around an area we are interested in, so that we could inspect the area of interest more carefully and precisely. An evolutionary factor, which utilizes the information of population distribution in particle swarm, is used as an index to adaptively tune the magnification scale factor for each particle in each dimension. Furthermore, a perturbation-based elitist learning strategy is utilized to help the swarm's best particle to escape the local optimum and explore the potential better space. The AMT-PSO is evaluated on 15 unimodal and multimodal benchmark functions. The effects of the adaptive magnification transformation mechanism and the elitist learning strategy in AMT-PSO are studied. Results show that the adaptive magnification transformation mechanism provides the main contribution to the proposed AMT-PSO in terms of convergence speed and solution accuracy on four categories of benchmark test functions.

  • Research on the Performance of Multi-GNSS Medium Length Baseline RTK with LEO-Augmented

    Weisheng HU  Xuwen LIANG  Huiling HOU  Zhuochen XIE  Xiaohe HE  

     
    LETTER-Digital Signal Processing

      Vol:
    E103-A No:5
      Page(s):
    780-784

    In this letter, we simulate GNSS/LEO measurements and propose a process strategy for LEO-augmented GNSS medium length baseline RTK. Experiments show that, the performance of GNSS medium length baseline RTK can be significantly improved by introducing LEO satellites. The convergence speed of LEO-augmented GPS or BDS float solution maybe better than GPS/BDS combined under the conditions of similar satellite geometry. Besides, the RMS error of fixed solutions are improved to better than 4cm from sub-decimeter level.

  • Initial Assessment of LEO-Augmented GPS RTK in Signal-Degraded Environment

    Weisheng HU  Huiling HOU  Zhuochen XIE  Xuwen LIANG  Xiaohe HE  

     
    LETTER-Digital Signal Processing

      Pubricized:
    2020/04/10
      Vol:
    E103-A No:7
      Page(s):
    942-946

    We simulate some scenarios that 2/3 LEO satellites enhance 3/4/5 GPS satellites, to assess LEO-augmented GPS RTK positioning in signal-degraded environment. The effects of LEO-augmented GPS RTK in terms of reliability, availability and accuracy are presented, and the DIA algorithm is applied to deal with the poor data quality.

  • Hybrid Uniform Distribution of Particle Swarm Optimizer

    Junqi ZHANG  Ying TAN  Lina NI  Chen XIE  Zheng TANG  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E93-A No:10
      Page(s):
    1782-1791

    Particle swarm optimizer (PSO) is a stochastic global optimization technique based on a social interaction metaphor. Because of the complexity, dynamics and randomness involved in PSO, it is hard to theoretically analyze the mechanism on which PSO depends. Statistical results have shown that the probability distribution of PSO is a truncated triangle, with uniform probability across the middle that decreases on the sides. The "truncated triangle" is also called the "Maya pyramid" by Kennedy. However, very little is known regarding the sampling distribution of PSO in itself. In this paper, we theoretically analyze the "Maya pyramid" without any assumption and derive its computational formula, which is actually a hybrid uniform distribution that looks like a trapezoid and conforms with the statistical results. Based on the derived density function of the hybrid uniform distribution, the search strategy of PSO is defined and quantified to characterize the mechanism of the search strategy in PSO. In order to show the significance of these definitions based on the derived hybrid uniform distribution, the comparison between the defined search strategies of the classical linear decreasing weight based PSO and the canonical constricted PSO suggested by Clerc is illustrated and elaborated.