Sparsely Populated Antenna Arrays

Access Full Text

Sparsely Populated Antenna Arrays

For access to this article, please select a purchase option:

Buy chapter PDF
£10.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Angle-of-Arrival Estimation Using Radar Interferometry: Methods and Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): E. Jeff Holder
Source: Angle-of-Arrival Estimation Using Radar Interferometry: Methods and Applications,2013
Publication date December 2013

The chapter begins with a brief introduction to sparse linear arrays. We use interval partitions to define minimum redundancy partitions and almost minimum redundancy partitions that achieve low sidelobe excitation patterns. These arrays assure that the spatial Nyquist condition is satisfied and also attempt to maximize the number of partition differences for optimized sidelobe control. Interval partitions are applied to coprime integers to generate coprime arrays. The spatial Nyquist condition and partition difference redundancy are used to develop a numerical sieve to generate arrays with low sidelobe antenna patterns. The linear Nyquist condition is generalized to two dimensions to generate 2-D sparse arrays with low sidelobe performance. Angle-of-arrival estimation methods are developed first for linear sparse arrays that satisfy the spatial Nyquist condition and then generalized to arrays that do not satisfy the spatial Nyquist condition. Finally, the methods of Ishimaru [1962] and Mitra et al. [2004, 2005] are developed to illustrate two techniques that use formulations of the uniform linear array antenna pattern to create unequally spaced arrays elements.

Chapter Contents:

  • 8.1 Sparse Linear Arrays
  • 8.2 Interval Partitions
  • 8.3 Cyclic Coprime Partitions
  • 8.3.1 Application to Spatial Sampling
  • 8.4 Nested Cyclic Partitions
  • 8.5 Numerical Sieve Methods for Optimized Sparse Array Generation
  • 8.5.1 Summary of Numerical Sieve Method
  • 8.6 Sparse Array Antenna Performance
  • 8.7 Antenna Pattern Methods
  • 8.7.1 Unequally Spaced Arrays
  • 8.7.2 Polynomial Factorization Method
  • 8.8 Sparse Array Angle-of-Arrival
  • 8.8.1 Sparse Array Monopulse
  • 8.8.2 Sparse Array Interferometry
  • 8.8.3 Sparse Array Angle Estimation Using the Array Covariance
  • 8.9 Two-Dimensional Sparse Arrays
  • 8.10 Multiple-Input and Multiple-Output (MIMO) Sparse Arrays
  • References

Inspec keywords: antenna radiation patterns; antenna arrays; probability

Other keywords: sparsely populated antenna arrays; antenna pattern characteristics; spaced arrays; statistical approach; interval partitions; sidelobe excitation patterns; linear Nyquist condition; angle-of- arrival estimation; optimized sidelobe control; 2-D sparse arrays; coprime arrays; minimum redundancy partitions; sidelobe antenna patterns; spatial Nyquist condition; partition difference redundancy; probability distribution

Subjects: Other topics in statistics; Antenna arrays

Preview this chapter:
Zoom in
Zoomout

Sparsely Populated Antenna Arrays, Page 1 of 2

| /docserver/preview/fulltext/books/ra/sbra508e/SBRA508E_ch8-1.gif /docserver/preview/fulltext/books/ra/sbra508e/SBRA508E_ch8-2.gif

Related content

content/books/10.1049/sbra508e_ch8
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading