Matches in SemOpenAlex for { <https://semopenalex.org/work/W2281574178> ?p ?o ?g. }
Showing items 1 to 96 of
96
with 100 items per page.
- W2281574178 endingPage "38" @default.
- W2281574178 startingPage "27" @default.
- W2281574178 abstract "It is shown in this paper that the problem of reducing the number of elements for multiple- pattern arrays can be solved by a sequence of reweighted � 1 optimizations under multiple linear constraints. To do so, conjugate symmetric excitations are assumed so that the upper and lower bounds for each pattern can be formulated as linear inequality constraints. In addition, we introduce an auxiliary variable for each element to define the common upper bound of both the real and imaginary parts of multiple excitations for different patterns, so that only linear inequality constraints are required. The objective function minimizes the reweighted � 1-norm of these auxiliary variables for all elements. Thus, the proposed method can be efficiently implemented by the iterative linear programming. For multiple desired patterns, the proposed method can select the common elements with multiple set of optimized amplitudes and phases, consequently reducing the number of elements. The radiation characteristics for each pattern, such as the mainlobe shape, response ripple, sidelobe level and nulling region, can be accurately controlled. Several synthesis examples for linear array, rectangular/triangular-grid and randomly spaced planar arrays are presented to validate the effectiveness of the proposed method in the reduction of the number of elements." @default.
- W2281574178 created "2016-06-24" @default.
- W2281574178 creator A5007233945 @default.
- W2281574178 creator A5017941291 @default.
- W2281574178 creator A5061450403 @default.
- W2281574178 creator A5090203537 @default.
- W2281574178 date "2016-01-01" @default.
- W2281574178 modified "2023-10-16" @default.
- W2281574178 title "SYNTHESIS OF SPARSE OR THINNED LINEAR AND PLANAR ARRAYS GENERATING RECONFIGURABLE MULTIPLE REAL PATTERNS BY ITERATIVE LINEAR PROGRAMMING" @default.
- W2281574178 cites W1967073510 @default.
- W2281574178 cites W1971582818 @default.
- W2281574178 cites W1976328234 @default.
- W2281574178 cites W1977079083 @default.
- W2281574178 cites W2007203903 @default.
- W2281574178 cites W2011633555 @default.
- W2281574178 cites W2013830066 @default.
- W2281574178 cites W2019204771 @default.
- W2281574178 cites W2021528019 @default.
- W2281574178 cites W2024715450 @default.
- W2281574178 cites W2035885296 @default.
- W2281574178 cites W2039523564 @default.
- W2281574178 cites W2039604287 @default.
- W2281574178 cites W2043633512 @default.
- W2281574178 cites W2048170511 @default.
- W2281574178 cites W2074916243 @default.
- W2281574178 cites W2080335076 @default.
- W2281574178 cites W2092963050 @default.
- W2281574178 cites W2102283502 @default.
- W2281574178 cites W2107861471 @default.
- W2281574178 cites W2115239542 @default.
- W2281574178 cites W2129762205 @default.
- W2281574178 cites W2134641604 @default.
- W2281574178 cites W2135539311 @default.
- W2281574178 cites W2138348322 @default.
- W2281574178 cites W2141162783 @default.
- W2281574178 cites W2142072015 @default.
- W2281574178 cites W2143422881 @default.
- W2281574178 cites W2152284047 @default.
- W2281574178 cites W2152738955 @default.
- W2281574178 cites W2153441899 @default.
- W2281574178 cites W2162254138 @default.
- W2281574178 cites W2166964212 @default.
- W2281574178 cites W2168714011 @default.
- W2281574178 cites W3105445150 @default.
- W2281574178 doi "https://doi.org/10.2528/pier15120401" @default.
- W2281574178 hasPublicationYear "2016" @default.
- W2281574178 type Work @default.
- W2281574178 sameAs 2281574178 @default.
- W2281574178 citedByCount "22" @default.
- W2281574178 countsByYear W22815741782016 @default.
- W2281574178 countsByYear W22815741782017 @default.
- W2281574178 countsByYear W22815741782018 @default.
- W2281574178 countsByYear W22815741782019 @default.
- W2281574178 countsByYear W22815741782020 @default.
- W2281574178 countsByYear W22815741782021 @default.
- W2281574178 countsByYear W22815741782022 @default.
- W2281574178 crossrefType "journal-article" @default.
- W2281574178 hasAuthorship W2281574178A5007233945 @default.
- W2281574178 hasAuthorship W2281574178A5017941291 @default.
- W2281574178 hasAuthorship W2281574178A5061450403 @default.
- W2281574178 hasAuthorship W2281574178A5090203537 @default.
- W2281574178 hasBestOaLocation W22815741781 @default.
- W2281574178 hasConcept C11413529 @default.
- W2281574178 hasConcept C121684516 @default.
- W2281574178 hasConcept C134786449 @default.
- W2281574178 hasConcept C173608175 @default.
- W2281574178 hasConcept C33923547 @default.
- W2281574178 hasConcept C41008148 @default.
- W2281574178 hasConcept C41045048 @default.
- W2281574178 hasConceptScore W2281574178C11413529 @default.
- W2281574178 hasConceptScore W2281574178C121684516 @default.
- W2281574178 hasConceptScore W2281574178C134786449 @default.
- W2281574178 hasConceptScore W2281574178C173608175 @default.
- W2281574178 hasConceptScore W2281574178C33923547 @default.
- W2281574178 hasConceptScore W2281574178C41008148 @default.
- W2281574178 hasConceptScore W2281574178C41045048 @default.
- W2281574178 hasLocation W22815741781 @default.
- W2281574178 hasOpenAccess W2281574178 @default.
- W2281574178 hasPrimaryLocation W22815741781 @default.
- W2281574178 hasRelatedWork W1509211761 @default.
- W2281574178 hasRelatedWork W1558545464 @default.
- W2281574178 hasRelatedWork W1984303163 @default.
- W2281574178 hasRelatedWork W2074301136 @default.
- W2281574178 hasRelatedWork W2117014006 @default.
- W2281574178 hasRelatedWork W2358725432 @default.
- W2281574178 hasRelatedWork W2372170743 @default.
- W2281574178 hasRelatedWork W3047022145 @default.
- W2281574178 hasRelatedWork W4233815414 @default.
- W2281574178 hasRelatedWork W99847340 @default.
- W2281574178 hasVolume "155" @default.
- W2281574178 isParatext "false" @default.
- W2281574178 isRetracted "false" @default.
- W2281574178 magId "2281574178" @default.
- W2281574178 workType "article" @default.