The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citationA new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationAn algorithm for linearly constrained adaptive array processing
Frost, O. L. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8817 · Cited by 2,533
Dolph, C. L. (1946) · Proceedings of the IRE · doi:10.1109/jrproc.1946.225956 · Cited by 1,171
A Mathematical Theory of Linear Arrays
Schelkunoff, S. A. (1943) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1943.tb01306.x · Cited by 605
Path-Following Methods for Linear Programming
Gonzaga, C. C. (1992) · SIAM Review · doi:10.1137/1034048 · Cited by 341
Iterative image reconstruction algorithms based on cross-entropy minimization
Byrne, C. L. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.210869 · Cited by 239
Interconnect design using convex optimization
Sancheti, P. K., & Sapatnekar, S. S. (2002) · IEEE Custom Integrated Circuits Conference (CICC) · doi:10.1109/cicc.1994.379662 · Cited by 8
Cited by
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Self-citationAlizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
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-citationAn Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
MIMO 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
Space‐Time Processing for MIMO Communications
(2005) · Wiley eBooks · doi:10.1002/0470010045 · Cited by 319
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Self-citationA 77-GHz FMCW MIMO Radar Based on an SiGe Single-Chip Transceiver
Feger, R., Wagner, C., Schuster, S., Scheiblhofer, S., Jager, H., & Stelzer, A. (2009) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2009.2017254 · Cited by 277
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
- 10
- 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
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.