Linear Array Thinning Exploiting Almost Difference Sets
By Giacomo Oliveri, Massimo Donelli, Andrea Massa. IEEE Transactions on Antennas and Propagation, 2009
192 citations recorded by the source corpus.
Subfields: Aerospace Engineering, Astronomy and Astrophysics
View Paper: https://www.semanticscholar.org/paper/fc42a6bc380e1b03b380a1b4b5ded4288a5dd578
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Aerospace Engineering
- Andrea Massa
- Paolo Rocca
- Giacomo Oliveri
- Robert J. Mailloux
- Benjamin Fuchs
- Luca Manica
- Qing Huo Liu
- Zhiqin Zhao
In Astronomy and Astrophysics
- Benjamin Fuchs
- Andrea Massa
- Giacomo Oliveri
- Luca Manica
- Zhiqin Zhao
- Kai Yang
- Qing Huo Liu
- Paolo Rocca
Citations in the corpus
- ADS-Based Guidelines for Thinned Planar Arrays (2010, methodology): “As regards geometries, the sidelobe characteristics of ADS-based arrays have been analyzed in [27] and good performances have been predicted and numerically verified dealing with both small and large apertures.”
- Unconventional Phased Array Architectures and Design Methodologies—A Review (2016, background): “has been analyzed in depth for linear array arrangements [53] and extended to the planar array case [56], [57].”
- Synthesis of Sparse Arrays With Focused or Shaped Beampattern via Sequential Convex Optimizations (2012, methodology): “One can mention spatial tapering designs [2], [3], stochastic methods (genetic algorithm [4], particle swarm [5], ant colony [6], simulated annealing [7], [8]), combinatorial approaches [9], [10] and various mathematical programming methods such as linear programming [11], [12].”
- Fast Pencil Beam Pattern Synthesis of Large Unequally Spaced Antenna Arrays (2013, methodology): “In recent literature, several novel algorithms were developed to optimize the element positions and excitations of nonuniform arrays to improve pattern performance [1]–[3] and reduce the computational cost [4]–[6] or obtain a given pattern”
- Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays (2011, methodology): “wide set of methods concerned with Problem I [2] has been investigated including random approaches [11], [15], dynamic programming [12], -filter design [16], stochastic optimization methods [17], [18], [20], [24], [27]–[29], analytical techniques [22], [31], and hybrid algorithms [25], [30], as well”