The DOI matches its Crossref record.
Antenna array pattern synthesis via convex optimization
Abstract
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far- and near-field patterns over narrow or broad frequency bandwidth, and some important robustness constraints. We show several numerical simulations for the particular problem of constraining the beampattern level of a simple array for adaptive and broadband arrays.
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
Cited by
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Self-citationRobust minimum variance beamforming
Lorenz, R. G., & Boyd, S. P. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.845436 · Cited by 774
Self-citationMIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Metadata
- Authors
- Lebret, H., & Boyd, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1997-03
- Volume
- 45
- Issue
- 3
- Pages
- 526-532
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2165518466
- Cited by
- 520
- References
- 0
- FWCI
- 10.00
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Antenna array pattern synthesis via convex optimization. https://app.cochat.ai/papers/10.1109/78.558465
- The paper
- Lebret, H., & Boyd, S. (1997). Antenna array pattern synthesis via convex optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.558465
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.
