In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high ...In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.展开更多
A new approach to phase averaging in phase gradient algorithm (PGA) is proposed, which is based on the fundamental fact that the information of translational phase error is widely contained in every defocused scattere...A new approach to phase averaging in phase gradient algorithm (PGA) is proposed, which is based on the fundamental fact that the information of translational phase error is widely contained in every defocused scatterer in ISAR image. The new approach aims to choose strong scatterers for error phase averaging with a threshold rather than just simply to pick out the strongest point in each range cell, which is not necessarily real strong scatterers if in some range cells consists more than one strong scatterer and whereas in other range cells no scatterer at all. The results of processing real data are presented to confirm the validity of the proposed approach.展开更多
The phase error estimated by phase gradient autofocus(PGA) is not based on a finite order polynomial mode, so PGA has a good autofocus property for arbitrary order phase error and is fit for high resolution airborne S...The phase error estimated by phase gradient autofocus(PGA) is not based on a finite order polynomial mode, so PGA has a good autofocus property for arbitrary order phase error and is fit for high resolution airborne SAR. But PGA has two shortcomings: first, it has a worse estimation property for fast changing phase error; second, there exists a section of linear phase in the phase error estimated by this algorithm. This paper introduces the idea of rank one phase estimate (ROPE) autofocus technique, and improves PGA. The improved PGA(IPGA) can successfully overcome both these shortcomings of PGA.展开更多
This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming inv...This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming involved in the FIR filter design can be solved by this algorithm. It is compared with the reported method for a SemiDefinite Programming (SDP) relaxation- based design. The simulations demonstrate that the new algorithm often yields the similar error performances of the FIR filter design, but the average CPU time of this approach is significantly reduced.展开更多
文摘In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.
文摘A new approach to phase averaging in phase gradient algorithm (PGA) is proposed, which is based on the fundamental fact that the information of translational phase error is widely contained in every defocused scatterer in ISAR image. The new approach aims to choose strong scatterers for error phase averaging with a threshold rather than just simply to pick out the strongest point in each range cell, which is not necessarily real strong scatterers if in some range cells consists more than one strong scatterer and whereas in other range cells no scatterer at all. The results of processing real data are presented to confirm the validity of the proposed approach.
文摘The phase error estimated by phase gradient autofocus(PGA) is not based on a finite order polynomial mode, so PGA has a good autofocus property for arbitrary order phase error and is fit for high resolution airborne SAR. But PGA has two shortcomings: first, it has a worse estimation property for fast changing phase error; second, there exists a section of linear phase in the phase error estimated by this algorithm. This paper introduces the idea of rank one phase estimate (ROPE) autofocus technique, and improves PGA. The improved PGA(IPGA) can successfully overcome both these shortcomings of PGA.
基金Supported by Shaanxi Province Natural Science Funds.
文摘This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming involved in the FIR filter design can be solved by this algorithm. It is compared with the reported method for a SemiDefinite Programming (SDP) relaxation- based design. The simulations demonstrate that the new algorithm often yields the similar error performances of the FIR filter design, but the average CPU time of this approach is significantly reduced.
