An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encod...A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.展开更多
An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square er...An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square error and local convergence of traditional constant modulus blind equalization algorithm(CMA).The proposed algorithm can reduce the signal autocorrelation through the orthogonal wavelet transform of input signal of fractionally spaced blind equalizer,and decrease the possibility of CMA local convergence by using the global random search characteristics of genetic algorithm to optimize the equalizer weight vector.The proposed algorithm has the faster convergence rate and smaller mean square error compared with FSE and WT-FSE.The efficiency of the proposed algorithm is proved by computer simulation of underwater acoustic channels.展开更多
In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule...In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule algorithm (DS-OCS) and distributed proportional fairness schedule algorithm (DPFS-OCS) based on orthogonal complement space (OCS) were proposed. The first right and left singular vectors of the channel that the user experienced were selected as the transmitting and receiving beamforming vectors. An interference space was spanned by the left singular vectors of the entire interference users in the same channel. The most suitable user lay in the OCS of the interference space was scheduled to avoid suffering interference from neighboring cells based on the criterion of system capacity maximizing and proportional fairness. The simulation results show that the average system capacity can be improved by 2%-4% compared with the DS-OCS algorithm with the Max C/I algorithm,by 6%-10% compared with the DPFS-OCS algorithm with the PF algorithm.展开更多
正交时频空(Orthogonal Time Frequency Space,OTFS)系统由于在面对高速移动通信场景下的时频双色散信道时的优异性能受到了广泛关注。为了准确获取信道状态信息,采用基于压缩感知的信道估计方法,并辅以特殊的导频序列完成信道估计。该...正交时频空(Orthogonal Time Frequency Space,OTFS)系统由于在面对高速移动通信场景下的时频双色散信道时的优异性能受到了广泛关注。为了准确获取信道状态信息,采用基于压缩感知的信道估计方法,并辅以特殊的导频序列完成信道估计。该文针对导频优化问题,提出了一种基于改进遗传算法的OTFS导频序列优化方法,该方法以互相关最小化为优化目标,采用遗传算法进行寻优,并能够自适应调整交叉和变异概率,在较少的迭代次数下即可实现比传统伪随机序列更优的互相关性,能够有效提高信道估计的准确性。此外,考虑到目标函数的计算量较大,该文分析了互相关的计算过程,并对其中的冗余计算进行了化简,与直接计算字典集的互相关值相比大大提高了算法的优化效率。展开更多
正交时频空(orthogonal time frequency space,OTFS)调制在高多普勒环境下可实现可靠通信,适用于卫星通信等高动态场景。然而,其峰值与平均功率比(peak-to-average power ratio,PAPR)易超出功放线性范围,导致非线性失真。部分传输序列(p...正交时频空(orthogonal time frequency space,OTFS)调制在高多普勒环境下可实现可靠通信,适用于卫星通信等高动态场景。然而,其峰值与平均功率比(peak-to-average power ratio,PAPR)易超出功放线性范围,导致非线性失真。部分传输序列(partial transfer sequence,PTS)算法通过对数据符号分块再选取合适的旋转因子可以抑制PAPR。为提高PTS算法抑制PAPR的能力,提出了一种基于改进的灰狼优化(improved grey wolf optimizer,IGWO)算法的PTS算法,即IGWO-PTS算法,以适应离散组合优化问题并获得更优的子块划分方案,从而获得更好的PAPR抑制能力。推导证明了当相位旋转因子集合元素具有旋转对称性时,相位旋转因子组合空间可以收缩为原来的1 K(K为集合中元素个数),极大程度上降低了系统复杂度。仿真实验表明,IGWO-PTS算法相对于传统算法具有更好的PAPR抑制性能,并且在星地高动态场景下可以保持良好的传输可靠性。展开更多
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (60873099)
文摘A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.
基金Sponsored by the Nature Science Foundation of Jiangsu(BK2009410)
文摘An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square error and local convergence of traditional constant modulus blind equalization algorithm(CMA).The proposed algorithm can reduce the signal autocorrelation through the orthogonal wavelet transform of input signal of fractionally spaced blind equalizer,and decrease the possibility of CMA local convergence by using the global random search characteristics of genetic algorithm to optimize the equalizer weight vector.The proposed algorithm has the faster convergence rate and smaller mean square error compared with FSE and WT-FSE.The efficiency of the proposed algorithm is proved by computer simulation of underwater acoustic channels.
基金Projects(2009ZX03003-003, 2009ZX03003-004) supported by the Major National Science & Technology ProgramProject(B08038) supported by the "111" Project+1 种基金Project(HX0109012417) supported by Huawei Technologies Co., Ltd, ChinaProject(IRT0852) supported by Program for Changjiang Scholars and Innovative Research Team in Chinese University
文摘In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule algorithm (DS-OCS) and distributed proportional fairness schedule algorithm (DPFS-OCS) based on orthogonal complement space (OCS) were proposed. The first right and left singular vectors of the channel that the user experienced were selected as the transmitting and receiving beamforming vectors. An interference space was spanned by the left singular vectors of the entire interference users in the same channel. The most suitable user lay in the OCS of the interference space was scheduled to avoid suffering interference from neighboring cells based on the criterion of system capacity maximizing and proportional fairness. The simulation results show that the average system capacity can be improved by 2%-4% compared with the DS-OCS algorithm with the Max C/I algorithm,by 6%-10% compared with the DPFS-OCS algorithm with the PF algorithm.
文摘正交时频空(Orthogonal Time Frequency Space,OTFS)系统由于在面对高速移动通信场景下的时频双色散信道时的优异性能受到了广泛关注。为了准确获取信道状态信息,采用基于压缩感知的信道估计方法,并辅以特殊的导频序列完成信道估计。该文针对导频优化问题,提出了一种基于改进遗传算法的OTFS导频序列优化方法,该方法以互相关最小化为优化目标,采用遗传算法进行寻优,并能够自适应调整交叉和变异概率,在较少的迭代次数下即可实现比传统伪随机序列更优的互相关性,能够有效提高信道估计的准确性。此外,考虑到目标函数的计算量较大,该文分析了互相关的计算过程,并对其中的冗余计算进行了化简,与直接计算字典集的互相关值相比大大提高了算法的优化效率。
文摘正交时频空(orthogonal time frequency space,OTFS)调制在高多普勒环境下可实现可靠通信,适用于卫星通信等高动态场景。然而,其峰值与平均功率比(peak-to-average power ratio,PAPR)易超出功放线性范围,导致非线性失真。部分传输序列(partial transfer sequence,PTS)算法通过对数据符号分块再选取合适的旋转因子可以抑制PAPR。为提高PTS算法抑制PAPR的能力,提出了一种基于改进的灰狼优化(improved grey wolf optimizer,IGWO)算法的PTS算法,即IGWO-PTS算法,以适应离散组合优化问题并获得更优的子块划分方案,从而获得更好的PAPR抑制能力。推导证明了当相位旋转因子集合元素具有旋转对称性时,相位旋转因子组合空间可以收缩为原来的1 K(K为集合中元素个数),极大程度上降低了系统复杂度。仿真实验表明,IGWO-PTS算法相对于传统算法具有更好的PAPR抑制性能,并且在星地高动态场景下可以保持良好的传输可靠性。
