Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Numerical annealing of low-redundancy linear arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ruf, C.S. ; Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA

An algorithm is developed that estimates the optimal distribution of antenna elements in a minimum redundancy linear array. These distributions are used in thinned array interferometric imagers to synthesize effective antenna apertures much larger than the physical aperture. The optimal selection of antenna locations is extremely time consuming when large numbers of antennas are involved. This algorithm uses a numerical implementation of the annealing process to guide a random search for the optimal array configuration. Highly thinned low-redundancy arrays are computed for up to 30 array elements. These arrays are equivalent to the optimal solutions that are known for up to 11 elements. The arrays computed for 12-30 elements have the fewest redundancies reported to date

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:41 ,  Issue: 1 )