The paper investigates the problem of the design of an optimal Orthogonal Fre- quency Division Multiplexing (OFDM) receiver against unknown frequency selective fading. A fast convergent Monte Carlo receiver is propose...The paper investigates the problem of the design of an optimal Orthogonal Fre- quency Division Multiplexing (OFDM) receiver against unknown frequency selective fading. A fast convergent Monte Carlo receiver is proposed. In the proposed method, the Markov Chain Monte Carlo (MCMC) methods are employed for the blind Bayesian detection without channel es- timation. Meanwhile, with the exploitation of the characteristics of OFDM systems, two methods are employed to improve the convergence rate and enhance the efficiency of MCMC algorithms. One is the integration of the posterior distribution function with respect to the associated channel parameters, which is involved in the derivation of the objective distribution function; the other is the intra-symbol differential coding for the elimination of the bimodality problem resulting from the presence of unknown fading channels. Moreover, no matrix inversion is needed with the use of the orthogonality property of OFDM modulation and hence the computational load is significantly reduced. Computer simulation results show the effectiveness of the fast convergent Monte Carlo receiver.展开更多
There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we...There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.展开更多
A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's...A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.展开更多
基金Partially supported by the National Natural Science Foundation of China (No.60172028).
文摘The paper investigates the problem of the design of an optimal Orthogonal Fre- quency Division Multiplexing (OFDM) receiver against unknown frequency selective fading. A fast convergent Monte Carlo receiver is proposed. In the proposed method, the Markov Chain Monte Carlo (MCMC) methods are employed for the blind Bayesian detection without channel es- timation. Meanwhile, with the exploitation of the characteristics of OFDM systems, two methods are employed to improve the convergence rate and enhance the efficiency of MCMC algorithms. One is the integration of the posterior distribution function with respect to the associated channel parameters, which is involved in the derivation of the objective distribution function; the other is the intra-symbol differential coding for the elimination of the bimodality problem resulting from the presence of unknown fading channels. Moreover, no matrix inversion is needed with the use of the orthogonality property of OFDM modulation and hence the computational load is significantly reduced. Computer simulation results show the effectiveness of the fast convergent Monte Carlo receiver.
基金Supported by the National Science Foundation of China(60133010)Supported by the Science Foundation of Henan Province(2000110019)
文摘There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.
基金Supported by the National Natural Science Foundation of China (No.60133010 and No.60141002).
文摘A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.
