Cart (Loading....) | Create Account
Close category search window
 

A polynomial rooting approach to super-resolution array design

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

2 Author(s)
Dowlut, N. ; Toronto Design Centre, Motorola Canada, Ont., Canada ; Manikas, A.

This paper is concerned with the design of super-resolution direction finding (DF) arrays that satisfy prespecified performance levels, such as detection-resolution thresholds and Cramer-Rao bounds on error variance. The sensor placement problem is formulated in the framework of subspace-based DF techniques and a novel polynomial rooting approach to the design problem, based on the new concept of the “sensor locator polynomial (SLP),” is proposed. This polynomial is constructed using the prespecified performance levels, and its roots yield the sensor locations of the desired array. The distinguishing feature of the proposed technique is that it hinges on the properties of the array manifold, which plays a central role in all subspace-based DF algorithms

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 6 )

Date of Publication:

Jun 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.