English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, an algorithm based on penalty cost function for synthesizing ∞at-top patterns is proposed. A descent algorithm (DA) as its optimizing approach is proposed in this paper as well. Apparently, whole algorithm e-ciency totally depends on the DA. Unlike traditional descent method, the DA deflnes step length by solving a inequality, instead of Wolf or Armijo-type search rule, stimulation results indicate that it can improve the computational e-ciency. Under mild conditions, we prove that the DA has strong convergence properties. Several numerical examples are presented to illustrate the efiectiveness of the proposed algorithm. The results indicate that the approach is efiective in the pattern shape precisely in both mainlobe and sidelobe region for arbitrary linear arrays.

PENALTY FUNCTION SOLUTION TO PATTERN SYNTHESIS OF ANTENNA ARRAY BY A DESCENT ALGORITHM