The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays
Open accessAbstract
A numerically-efficient technique based on the Bayesian compressive sampling (BCS) for the design of maximally-sparse linear arrays is introduced. The method is based on a probabilistic formulation of the array synthesis and it exploits a fast relevance vector machine (RVM) for the problem solution. The proposed approach allows the design of linear arrangements fitting desired power patterns with a reduced number of non-uniformly spaced active elements. The numerical validation assesses the effectiveness and computational efficiency of the proposed approach as a suitable complement to existing state-of-the-art techniques for the design of sparse 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
Cites
Antenna Theory: Analysis and Design
Balanis, C. A. (1982) · Cited by 10,178
Antenna theory, analysis, and design
Croswell, W. (1982) · IEEE Antennas and Propagation Society Newsletter · doi:10.1109/map.1982.27654 · Cited by 8,565
Advances in neural information processing systems 11
Peter Sollich, A. (1999) · Cited by 3,168
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
(1999) · Sensor Review · doi:10.1108/sr.1999.08719bae.004 · Cited by 1,826
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Thinned arrays using genetic algorithms
Haupt, R. L. (1994) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.299602 · Cited by 1,114
Tipping, M. E. (1999) · Cited by 912
Genetic Algorithms in Electromagnetics
Haupt, R. L., & Werner, D. H. (2007) · Wiley eBooks · doi:10.1002/047010628x · Cited by 545
Genetic algorithms in electromagnetics
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0300 · Cited by 391
Cited by
Compressive Sensing in Electromagnetics - A Review
Massa, A., Rocca, P., & Oliveri, G. (2015) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2015.2397092 · Cited by 360
Self-citationMassa, A., Oliveri, G., Viani, F., & Rocca, P. (2013) · Proceedings of the IEEE · doi:10.1109/jproc.2013.2245491 · Cited by 254
Self-citationGoudos, S. K., Tsoulos, G. V., Athanasiadou, G., Batistatos, M. C., Zarbouti, D., & Psannis, K. E. (2019) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2019.2905665 · Cited by 50
Metadata
- Authors
- Oliveri, G., & Massa, A.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 2011-02
- Volume
- 59
- Issue
- 2
- Pages
- 467-481
- ISSN
- 0018-926X (ISSN-L)
- 1558-2221
- OpenAlex
- W2167179747
- Cited by
- 287
- References
- 18
- FWCI
- 30.68
- Type
- journal article
- Language
- en
- Open access
- green
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: Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays. https://app.cochat.ai/papers/10.1109/tap.2010.2096400
- The paper
- Oliveri, G., & Massa, A. (2011). Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays. IEEE Transactions on Antennas and Propagation. https://doi.org/10.1109/tap.2010.2096400
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.
