Learn More
—In this paper, an algorithm based on penalty cost function for synthesizing flat-top patterns is proposed. A descent algorithm (DA) as its optimizing approach is proposed in this paper as well. Apparently, whole algorithm efficiency totally depends on the DA. Unlike traditional descent method, the DA defines step length by solving a inequality, instead of(More)
A parallel dual matrix method that considers all cases of numerical relations between a mixing matrix and a separating matrix is proposed in this letter. Different constrained terms are used to construct cost function for every subalgorithm. These constrained terms reflect numerical relation. Therefore, a number of undesired solutions are excluded, the(More)
  • 1