The DOI matches its Crossref record.
On the design of maximally sparse beamforming arrays
Abstract
The problem of designing nonuniformly spaced arrays is formulated as one of constrained optimization in which the cost function is chosen to select the array with the minimum number of elements. The response of the array is controlled by a set of inequality point response constraints. It is shown that a suitable cost function for this problem is the l/sub p/ quasi-norm for 0>
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
Cited by
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Unconventional 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
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Image Reconstruction: From Sparsity to Data-Adaptive Methods and Machine Learning
Ravishankar, S., Ye, J. C., & Fessler, J. A. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2936204 · Cited by 294
Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays
Oliveri, G., & Massa, A. (2011) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2010.2096400 · Cited by 287
Metadata
- Authors
- Leahy, R. M., & Jeffs, B. D.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 1991
- Volume
- 39
- Issue
- 8
- Pages
- 1178-1187
- ISSN
- 0018-926X (ISSN-L)
- OpenAlex
- W1971721761
- Cited by
- 164
- References
- 0
- FWCI
- 8.15
- 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: On the design of maximally sparse beamforming arrays. https://app.cochat.ai/papers/10.1109/8.97353
- The paper
- Leahy, R. M., & Jeffs, B. D. (1991). On the design of maximally sparse beamforming arrays. IEEE Transactions on Antennas and Propagation. https://doi.org/10.1109/8.97353
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.