The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Thinned arrays using genetic algorithms
Abstract
Large arrays are difficult to thin in order to obtain low sidelobes. Traditional statistical methods of aperiodic array synthesis fall far short of optimum configurations. Traditional optimization methods are not well suited for optimizing a large number of parameters or discrete parameters. This paper presents how to optimally thin an array using genetic algorithms. The genetic algorithm determines which elements are turned off in a periodic array to yield the lowest maximum relative sidelobe level. Simulation results for 200 element linear arrays and 200 element planar arrays are shown. The arrays are thinned to obtain sidelobe levels of less than -20 dB. The linear arrays are also optimized over both scan angle and bandwidth.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Savitzky-Golay Smoothing Filters
Press, W. H., & Teukolsky, S. A. (1990) · Computers in Physics · doi:10.1063/1.4822961 · Cited by 11,670
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
Antenna Handbook: Theory, Applications, and Design
Lo, Y. T., & Lee, S. W. (1988) · CERN Document Server (European Organization for Nuclear Research) · Cited by 380
Cited by
Genetic algorithms in engineering electromagnetics
Johnson, J. M., & Rahmat-Samii, V. (1997) · IEEE Antennas and Propagation Magazine · doi:10.1109/74.632992 · Cited by 890
Genetic algorithm optimization applied to electromagnetics: a review
Weile, D. S., & Michielssen, E. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.558650 · Cited by 881
Jin, N., & Rahmat-Samii, Y. (2007) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2007.891552 · Cited by 805
An introduction to genetic algorithms for electromagnetics
Haupt, R. L. (1995) · IEEE Antennas and Propagation Magazine · doi:10.1109/74.382334 · Cited by 776
Self-citationUnconventional Phased Array Architectures and Design Methodologies—A Review
Rocca, P., Oliveri, G., Mailloux, R. J., & Massa, A. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2512389 · Cited by 501
Metadata
- Authors
- Haupt, R. L.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 1994-07
- Volume
- 42
- Issue
- 7
- Pages
- 993-999
- ISSN
- 0018-926X (ISSN-L)
- 1558-2221
- OpenAlex
- W2153441899
- Cited by
- 1,114
- References
- 3
- FWCI
- 25.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.