{
 "id": "ep6ervevsj",
 "slug": "sparse-array-design",
 "title": "Sparse array design",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "technology",
   "label": "Technology and the built world",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology"
  },
  {
   "id": "technology.engineering",
   "label": "Engineering and manufacturing",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering"
  },
  {
   "id": "technology.engineering.engineering.electrical.electronics",
   "label": "Electrical and electronics engineering",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.engineering.electrical.electronics"
  },
  {
   "id": "technology.engineering.engineering.electrical.electronics.radar-radio-and-microwave",
   "label": "Radar, radio, and microwave",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.engineering.electrical.electronics.radar-radio-and-microwave"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1946.technology.engineering.engineering.electrical.electronics",
   "label": "Non-geographic · 1946 to 2000: Electrical and electronics engineering",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.engineering.electrical.electronics",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.technology",
     "label": "Technology and the built world",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology"
    },
    {
     "id": "geo.nongeo.t1946.technology.engineering",
     "label": "Engineering and manufacturing",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering"
    },
    {
     "id": "geo.nongeo.t1946.technology.engineering.engineering.electrical.electronics",
     "label": "Electrical and electronics engineering",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.engineering.electrical.electronics"
    }
   ]
  }
 ],
 "excerpt": "Sparse array design selects nonuniform element positions and excitation weights for an antenna array, meeting beamforming or direction-finding goals with fewer elements than a filled uniform array.",
 "snippet": "Sparse array design selects nonuniform element positions and excitation weights for an antenna array, meeting beamforming or direction-finding goals with fewer elements than a filled uniform array.",
 "node": "technology.engineering.engineering.electrical.electronics.radar-radio-and-microwave",
 "markdown": "# Sparse array design\n\nSparse array design selects nonuniform element positions, and often excitation weights, for an antenna or sensor array so that it meets a beamforming or direction-finding goal with fewer elements than a filled uniform array. Reducing transmit/receive modules matters where system size, weight, allowed operating space, and cost are limited.<sup>[1](https://journal.hep.com.cn/jest/EN/10.1016/j.jnlest.2024.100276)</sup> The payoff is degrees of freedom: a well-designed sparse array with \\( N \\) sensors can identify on the order of \\( O(N^{2}) \\) uncorrelated source directions, against \\( N-1 \\) for a uniform linear array (ULA) processed with subspace methods.<sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup> The design output is typically both positions and weights; one classical formulation assigns gains to candidate locations and removes the zero-weighted elements, leaving the maximally sparse array that holds a desired response within tolerance.<sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup>\n\n| Key fact | Value | Source |\n|---|---|---|\n| Design output | Element positions and excitation weights; zero-weight elements are discarded | <sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup> |\n| Degrees of freedom | \\( O(N^{2}) \\) uncorrelated sources from \\( N \\) sensors, vs \\( N-1 \\) for a ULA | <sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup> |\n| 6-sensor comparison (uniform DOF) | ULA 11, MRA 27, nested 23, coprime 15; detectable sources 5, 13, 11, 7 | <sup>[4](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)</sup> |\n| Worked demonstration | A 10-sensor nested array resolved 25 sources with co-array MUSIC, 500 snapshots, 10 dB SNR | <sup>[5](https://doi.org/10.1002/9781394191048.ch1)</sup> |\n| MRA redundancy bounds | \\( 1.217 \\leq R \\leq 1.674 \\) as \\( N \\to \\infty \\) (Leech) | <sup>[6](https://export.arxiv.org/pdf/2308.04615v1.pdf)</sup> |\n| Low-discrepancy thinning | 86% fewer elements; Poisson disk sampling reached −12.28 dB peak sidelobe level, ~15% aperture efficiency | <sup>[7](https://pmc.ncbi.nlm.nih.gov/articles/PMC8659520/)</sup> |\n| Recent UDOF result | M-CACIS with 40 elements: 839 uniform DOF vs 599 for a two-level nested array | <sup>[8](https://journal.xidian.edu.cn/xdxb/EN/10.19665/j.issn1001-2400.20240307)</sup> |\n\n## How it works\n\nTwo mechanisms carry the performance. First, aperiodic sampling: a uniformly spaced array with element separation greater than half a wavelength develops narrow, large grating lobes, so peak sidelobe control is a central concern in sparse design; nonuniform placement enlarges the aperture without generating those lobes, and sidelobes are controlled by placement rather than by amplitude tapering.<sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup> Second, co-array processing: the difference co-array (virtual array formed from pairwise differences of sensor positions) collects the distinct differences \\( n_{k} - n_{m} \\) of sensor positions, and by vectorizing the covariance matrix of the received signal an \\( N \\)-sensor sparse array provides \\( O(N^{2}) \\) consecutive virtual sensors in that co-array, so up to \\( O(N^{2}) \\) uncorrelated sources can be identified with \\( N \\) physical sensors.<sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup> Subspace estimators such as MUSIC are then applied to the co-array covariance; the identification requires uncorrelated sources and a sufficiently large number of snapshots.\n\nThe number of unique lags in the difference co-array sets the degrees of freedom for DOA estimation, and the uniform degrees of freedom (UDOF) counts the hole-free continuous span of the co-array.<sup>[8](https://journal.xidian.edu.cn/xdxb/EN/10.19665/j.issn1001-2400.20240307)</sup> For 6 sensors, uniform DOF are 11 (ULA), 27 (MRA), 23 (nested), and 15 (coprime), giving maximum detectable source counts of 5, 13, 11, and 7.<sup>[4](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)</sup>\n\n## How it is done\n\nThe classical formulation is constrained optimization whose cost selects the array with the minimum number of elements. Leahy and Jeffs used the \\( l_{p} \\) quasi-norm for \\( 0 < p < 1 \\) over weights on a candidate location grid, solved by a simplex search; a threshold \\( p_{1} \\) exists such that for all \\( 0 < p < p_{1} \\) the solution is maximally sparse, lying at an extreme point of the simplex formed by the point constraints.<sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup>\n\nCompressed-sensing methods recast the same idea on a densely sampled aperture: element positions are extracted from grid samples by minimizing an \\( l_{p} \\) norm (\\( 0 < p < 1 \\)) under linear constraints, with solvers including FOCUSS, Bayesian compressive sampling, and convex optimization.<sup>[9](https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/iet-map.2015.0775)</sup><sup> • </sup><sup>[10](https://doi.org/10.1109/tap.2010.2096400)</sup> The perturbed compressive sampling framework augments position-perturbation variables to the grid model so elements move continuously, and jointly recovers excitations and perturbations with FOCUSS.<sup>[9](https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/iet-map.2015.0775)</sup> Because grid-based recovery loses accuracy and numerical stability as grid density matters, gridless atomic-norm minimization removes the grid entirely.<sup>[11](https://www.sciencedirect.com/science/article/abs/pii/S1051200424005177)</sup>\n\nConvex and integer approaches split the problem: for fixed positions the array factor is linear in the excitation amplitudes, so the minimum-sidelobe subproblem is convex and is solved with a CVX solver<sup>[12](https://www.jpier.org/ac_api/preview.php?id=25011903&t=ab)</sup>; sequential convex optimization handles focused or shaped beampatterns<sup>[13](https://doi.org/10.1109/tap.2012.2196951)</sup>; and 2024 work formulates non-redundant and minimum-redundant array design as integer linear programs over binary vectors.<sup>[14](https://zhangxuejing7.github.io/HomePage/data/TSPSparseArrayDesignILP2024.pdf)</sup> Metaheuristics remain widespread: a hybrid [quantum-behaved particle swarm optimization](https://www.edgepedia.org/quantum-behaved-particle-swarm-optimization) with genetic mutation<sup>[15](https://www.mdpi.com/2076-3417/15/12/6490)</sup>, a Grey Wolf Optimizer with adaptive weights<sup>[16](https://link.springer.com/article/10.1007/s00034-024-02821-z)</sup>, and the hybrid ISSA-CP method, which assigns the nonconvex position search to an improved sparrow search algorithm and the convex excitation step to convex programming.<sup>[12](https://www.jpier.org/ac_api/preview.php?id=25011903&t=ab)</sup>\n\n## Origin\n\nThe direct antecedents are optimization-based placements from the 1960s: Skolnik, Nemhauser, and Sherman applied dynamic programming to unequally spaced arrays in 1964 in the IRE Transactions on Antennas and Propagation<sup>[17](https://doi.org/10.1109/tap.1964.1138163)</sup>, and Moffet introduced minimum-redundancy linear arrays in 1968 in the IEEE Transactions on Antennas and Propagation.<sup>[18](https://doi.org/10.1109/tap.1968.1139138)</sup> Later algorithmic milestones include Haupt's thinned arrays using genetic algorithms (1994)<sup>[19](https://doi.org/10.1109/8.299602)</sup>, element reduction by the [matrix pencil method](https://www.edgepedia.org/matrix-pencil-method) due to Yanhui Liu, Zaiping Nie, and Qing Huo Liu (2008)<sup>[20](https://doi.org/10.1109/tap.2008.928801)</sup>, and Bayesian compressive sampling for maximally sparse arrays by Giacomo Oliveri and Andrea Massa (2010).<sup>[10](https://doi.org/10.1109/tap.2010.2096400)</sup> [Piya Pal](https://www.edgepedia.org/piya-pal) and P. P. Vaidyanathan reported nested arrays with enhanced degrees of freedom in 2010<sup>[21](https://doi.org/10.1109/tsp.2010.2049264)</sup>; Benjamin Fuchs synthesized sparse arrays with focused or shaped beampatterns via sequential convex optimizations in 2012<sup>[13](https://doi.org/10.1109/tap.2012.2196951)</sup>; Si Qin, Yimin D. Zhang, and Moeness G. Amin reported generalized coprime configurations for direction-of-arrival estimation in 2015.<sup>[22](https://doi.org/10.1109/tsp.2015.2393838)</sup> [Paolo Rocca](https://www.edgepedia.org/paolo-rocca), Giacomo Oliveri, Robert J. Mailloux, and Andrea Massa surveyed unconventional phased array architectures in a 2016 Proceedings of the IEEE review.<sup>[23](https://doi.org/10.1109/jproc.2015.2512389)</sup> Augmented nested arrays followed in 2017<sup>[24](https://doi.org/10.1109/tsp.2017.2736493)</sup> and the MISC array in 2019<sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup>, with Schmidt's MUSIC algorithm (1986) as the subspace engine co-array methods build on.<sup>[25](https://doi.org/10.1109/tap.1986.1143830)</sup>\n\n## Variants\n\nPublished taxonomies sort sparse arrays into three rough architectures: thinned arrays, nonuniformly spaced arrays, and clustered arrays.<sup>[1](https://journal.hep.com.cn/jest/EN/10.1016/j.jnlest.2024.100276)</sup>\n\n**Minimum-redundancy arrays** (MRAs) and minimum hole arrays (MHAs, Golomb rulers) have no simple closed-form geometry; sensor locations are usually read from tabulated entries.<sup>[4](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)</sup> For MRAs, the redundancy ratio \\( R = N \\cdot (N-1)/(2M) \\geq 1 \\) for \\( N \\) sensors on a grid \\( [-M, M] \\) is bounded by Leech as \\( 1.217 \\leq R \\leq 1.674 \\) as \\( N \\to \\infty \\); zero-redundancy arrays exist only for \\( N \\leq 4 \\).<sup>[6](https://export.arxiv.org/pdf/2308.04615v1.pdf)</sup> **Nested arrays** are the union of a ULA of \\( N_{1} \\) sensors with unit spacing and a ULA of \\( N_{2} \\) sensors with spacing \\( N_{1}+1 \\), giving hole-free difference co-arrays with closed-form positions.<sup>[26](https://api.intechopen.com/chapter/pdf-download/78401.pdf)</sup> The super nested array keeps the nested array's hole-free co-array and closed-form geometry while redistributing the dense ULA portion to reduce mutual coupling.<sup>[4](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)</sup> **Coprime arrays** use two ULAs with coprime spacings, \\( N \\cdot \\lambda/2 \\) and \\( M \\cdot \\lambda/2 \\); the extended coprime array uses \\( 2M+N-1 \\) sensors to obtain consecutive lags from \\( -M \\cdot N - N + 1 \\) to \\( M \\cdot N + N - 1 \\).<sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup> The **MISC array** consists of three sparse ULAs plus two separate sensors, with closed-form positions and closed-form uniform DOF.<sup>[2](http://yiminzhang.com/pdf/tsp19_zz.pdf)</sup> **Augmented nested arrays** target enhanced DOF with reduced mutual coupling<sup>[24](https://doi.org/10.1109/tsp.2017.2736493)</sup>, and the **rearranged coprime array** fills holes in the coprime difference co-array by relocating redundant sensors without adding new ones.<sup>[27](https://www.sciencedirect.com/science/article/abs/pii/S0165168421000773)</sup> Low-discrepancy sequence arrays offer a deterministic, nonrandom placement that removes grating lobes while keeping elements separated.<sup>[7](https://pmc.ncbi.nlm.nih.gov/articles/PMC8659520/)</sup> At 40 elements, the 2024 M-CACIS design (\\( M=20 \\), \\( N=21 \\), \\( p=10 \\), \\( k=10 \\)) reaches 839 UDOF against 599 for a two-level nested array.<sup>[8](https://journal.xidian.edu.cn/xdxb/EN/10.19665/j.issn1001-2400.20240307)</sup>\n\n## Applications\n\n[Direction finding](https://www.edgepedia.org/direction-finding) is the core application: co-array MUSIC is widely used for DOA estimation in sparse arrays, with co-array root-MUSIC and co-array ESPRIT as later additions.<sup>[26](https://api.intechopen.com/chapter/pdf-download/78401.pdf)</sup> MRAs and MHAs were studied for over five decades primarily in relation to radio astronomy interferometry.<sup>[26](https://api.intechopen.com/chapter/pdf-download/78401.pdf)</sup> In MIMO radar, \\( M \\) transmit and \\( N \\) receive antennas with matched filtering produce a virtual array of \\( M \\cdot N \\) elements from only \\( M+N \\) physical antennas.<sup>[26](https://api.intechopen.com/chapter/pdf-download/78401.pdf)</sup> A 2024 Wiley edited volume, *Sparse Arrays for Radar, Sonar, and Communications*, covers design via convex optimization and deep learning for radar target detection and resolution, massive MIMO channel capacity, and sonar underwater localization.<sup>[28](https://www.wiley.com/en-us/Sparse+Arrays+for+Radar%2C+Sonar%2C+and+Communications-p-9781394191024)</sup> Sparse MIMO has been proposed as a viable 6G integrated sensing and communication (ISAC) technology, where nonuniform sparse architectures achieve co-arrays with \\( O(M^{2}) \\) virtual elements from \\( M \\) physical elements, giving sensing degrees of freedom of order \\( O(M^{2}) \\) versus \\( O(M) \\) for compact MIMO.<sup>[29](https://arxiv.org/abs/2406.12270)</sup>\n\n## Limitations and alternatives\n\nGrating lobes are the canonical failure: spacing greater than half a wavelength produces narrow, large grating lobes unless placement is aperiodic.<sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup> Geometry-specific weaknesses differ: coprime arrays have holes in the co-array, while nested arrays contain a dense ULA that causes significantly higher mutual coupling.<sup>[4](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)</sup> MRAs, nested, and super nested arrays are maximally economic, with fragility \\( N/N = 1 \\): failure of a single element in an \\( N \\)-element array can cause up to \\( N-1 \\) missing spatial lags, rendering the array useless in the co-array domain; robust MRAs generate each spatial lag at least twice, achieving fragility of \\( 2/N \\), like ULAs.<sup>[30](https://doi.org/10.5772/intechopen.99444)</sup>\n\nAlgorithmic failure modes include minimum-spacing control: Bayesian compressive sensing achieves ultrasparse distributions but makes minimum element spacing hard to control, and iterative convex methods can yield non-realizable arrays, which motivated alternating convex optimization.<sup>[1](https://journal.hep.com.cn/jest/EN/10.1016/j.jnlest.2024.100276)</sup> Grid-based compressed-sensing synthesis loses accuracy and numerical stability because results depend on discrete grid density, motivating gridless methods.<sup>[11](https://www.sciencedirect.com/science/article/abs/pii/S1051200424005177)</sup> For coherent signals, spatial smoothing MUSIC is inapplicable to nonuniform sparse arrays with unequal spacings; maximum-likelihood or compressed-sensing DOA estimation is proposed instead.<sup>[29](https://arxiv.org/abs/2406.12270)</sup> Thinning a filled array raises the sidelobe level and can lead to grating lobes, and enlarging aperture improves angular resolution at the cost of increased sidelobes.<sup>[31](https://export.arxiv.org/pdf/2210.11597v1.pdf)</sup>\n\nAgainst alternatives, the simplex \\( l_{p} \\) method designs sparse arrays with fewer elements than an equivalent equispaced Dolph-Chebyshev array under the same sidelobe and beamwidth constraints<sup>[3](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)</sup>, and position-optimized sparse arrays offer enhanced degrees of freedom and better characteristics than thinned arrays.<sup>[12](https://www.jpier.org/ac_api/preview.php?id=25011903&t=ab)</sup> Iterative FFT thinning is computationally efficient for large arrays but applies only to uniformly spaced grids and gives worse sidelobe performance than truly nonuniform spacing.<sup>[1](https://journal.hep.com.cn/jest/EN/10.1016/j.jnlest.2024.100276)</sup>\n\n## References\n\n1. [Sparse antenna array design methodologies: A review (Journal of Electronics Science and Technology, 2024)](https://journal.hep.com.cn/jest/EN/10.1016/j.jnlest.2024.100276)\n2. [MISC Array: A New Sparse Array Design (Zheng et al., IEEE Trans. Signal Processing 2019)](http://yiminzhang.com/pdf/tsp19_zz.pdf)\n3. [On the design of maximally sparse beamforming arrays (Leahy & Jeffs, IEEE Trans. Antennas and Propagation, 1991)](https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf)\n4. [Super Nested Arrays: Linear Sparse Arrays with Reduced Mutual Coupling – Part I (Liu & Vaidyanathan, IEEE TSP preprint)](https://systems.caltech.edu/dsp/students/clliu/SuperNested/TSP1.pdf)\n5. [Sparse Arrays: Fundamentals (book chapter, Vaidyanathan & Kulkarni)](https://doi.org/10.1002/9781394191048.ch1)\n6. [Sparse Array Design for Direction Finding using Deep Learning (arXiv, 2023)](https://export.arxiv.org/pdf/2308.04615v1.pdf)\n7. [Low Discrepancy Sparse Phased Array Antennas (Sensors, 2021)](https://pmc.ncbi.nlm.nih.gov/articles/PMC8659520/)\n8. [Sparse array design for improving uniform degrees of freedom (Journal of Xidian University, 2024)](https://journal.xidian.edu.cn/xdxb/EN/10.19665/j.issn1001-2400.20240307)\n9. [Synthesis of planar sparse arrays by perturbed compressive sampling framework (IET Microwaves, Antennas & Propagation)](https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/iet-map.2015.0775)\n10. [Giacomo Oliveri, Andrea Massa (2010). 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)\n11. [Efficient gridless wideband sparse array synthesis with tapped delay-lines (Digital Signal Processing, 2024)](https://www.sciencedirect.com/science/article/abs/pii/S1051200424005177)\n12. [Hybrid ISSA-CP method for sparse array synthesis (Progress In Electromagnetics Research)](https://www.jpier.org/ac_api/preview.php?id=25011903&t=ab)\n13. [Benjamin Fuchs (2012). Synthesis of Sparse Arrays With Focused or Shaped Beampattern via Sequential Convex Optimizations. IEEE Transactions on Antennas and Propagation.](https://doi.org/10.1109/tap.2012.2196951)\n14. [Sparse Array Design via Integer Linear Programming (IEEE Transactions on Signal Processing, 2024, author-hosted PDF)](https://zhangxuejing7.github.io/HomePage/data/TSPSparseArrayDesignILP2024.pdf)\n15. [A Hybrid Optimization Algorithm for the Synthesis of Sparse Array Pattern Diagrams (Applied Sciences, 2025)](https://www.mdpi.com/2076-3417/15/12/6490)\n16. [Optimization of the Sparse Array with Enhanced Degrees of Freedom and Low Mutual Coupling (Circuits, Systems, and Signal Processing, 2024)](https://link.springer.com/article/10.1007/s00034-024-02821-z)\n17. [M. Skolnik, G. Nemhauser, J. Sherman (1964). Dynamic programming applied to unequally spaced arrays. IRE Transactions on Antennas and Propagation.](https://doi.org/10.1109/tap.1964.1138163)\n18. [A. Moffet (1968). Minimum-redundancy linear arrays. IEEE Transactions on Antennas and Propagation.](https://doi.org/10.1109/tap.1968.1139138)\n19. [R.L. Haupt (1994). Thinned arrays using genetic algorithms. IEEE Transactions on Antennas and Propagation.](https://doi.org/10.1109/8.299602)\n20. [Yanhui Liu, Zaiping Nie, Qing Huo Liu (2008). Reducing the Number of Elements in a Linear Antenna Array by the Matrix Pencil Method. IEEE Transactions on Antennas and Propagation.](https://doi.org/10.1109/tap.2008.928801)\n21. [Piya Pal, P. P. Vaidyanathan (2010). Nested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of Freedom. IEEE Transactions on Signal Processing.](https://doi.org/10.1109/tsp.2010.2049264)\n22. [Si Qin, Yimin D. Zhang, Moeness G. Amin (2015). Generalized Coprime Array Configurations for Direction-of-Arrival Estimation. IEEE Transactions on Signal Processing.](https://doi.org/10.1109/tsp.2015.2393838)\n23. [Paolo Rocca and colleagues (2016). Unconventional Phased Array Architectures and Design Methodologies, A Review. Proceedings of the IEEE.](https://doi.org/10.1109/jproc.2015.2512389)\n24. [Jianyan Liu and colleagues (2017). Augmented Nested Arrays With Enhanced DOF and Reduced Mutual Coupling. IEEE Transactions on Signal Processing.](https://doi.org/10.1109/tsp.2017.2736493)\n25. [R. Schmidt (1986). Multiple emitter location and signal parameter estimation. IEEE Transactions on Antennas and Propagation.](https://doi.org/10.1109/tap.1986.1143830)\n26. [Sparse Linear Antenna Arrays (book chapter, IntechOpen)](https://api.intechopen.com/chapter/pdf-download/78401.pdf)\n27. [Rearranged coprime array to increase degrees of freedom and reduce mutual coupling (Signal Processing, 2021)](https://www.sciencedirect.com/science/article/abs/pii/S0165168421000773)\n28. [Sparse Arrays for Radar, Sonar, and Communications (Wiley, ed. Mishra, 2024)](https://www.wiley.com/en-us/Sparse+Arrays+for+Radar%2C+Sonar%2C+and+Communications-p-9781394191024)\n29. [Sparse MIMO for ISAC: New Opportunities and Challenges (arXiv, 2024)](https://arxiv.org/abs/2406.12270)\n30. [Sparse Linear Antenna Arrays: A Review (book chapter, aggregator-hosted; weak host)](https://doi.org/10.5772/intechopen.99444)\n31. [Multi-objective Design of Uniform Sparse MIMO Arrays (Tanyer et al., arXiv preprint)](https://export.arxiv.org/pdf/2210.11597v1.pdf)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Engineering and manufacturing › Electrical and electronics engineering › Radar, radio, and microwave*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [
  "https://www.et.byu.edu/~bjeffs/publications/Leahy_TAP_91.pdf"
 ],
 "url": "https://www.edgepedia.org/sparse-array-design",
 "markdown_url": "https://www.edgepedia.org/sparse-array-design.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Sparse array design\", Edgepedia (EdgeChat), https://www.edgepedia.org/sparse-array-design. Edgepedia Community License 1.0.",
 "credit_md": "\"[Sparse array design](https://www.edgepedia.org/sparse-array-design)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/sparse-array-design](https://www.edgepedia.org/sparse-array-design). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/sparse-array-design\">Sparse array design</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/sparse-array-design\">https://www.edgepedia.org/sparse-array-design</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Sparse array design selects nonuniform element positions and excitation weights for an antenna array, meeting beamforming or direction-finding goals with fewer elements than a filled uniform array."
}