Proceedings Paper
The Partial-Rank Algorithm for Adaptive Beamforming| Format | Member Price | Non-Member Price |
|---|---|---|
| $14.40 | $18.00 |
|
GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. | Check Access |
Paper Abstract
This paper describes a new family of algorithms for adaptive weight computation for sensor arrays with arbitrary geometries. This family includes existing algorithms of the steepest-descent and matrix-factorization types, plus a range of new algorithms that are intermediate between these two classes, in terms of performance and computational complexity. This approach is particularly valuable for applications where steepest descent is too slow, but the standard matrix methods require too much computation.
Paper Details
Date Published: 4 January 1986
PDF: 6 pages
Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); doi: 10.1117/12.949697
Published in SPIE Proceedings Vol. 0564:
Real-Time Signal Processing VIII
Keith Bromley; William J. Miceli, Editor(s)
PDF: 6 pages
Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); doi: 10.1117/12.949697
Show Author Affiliations
Steven G. Kratzer, General Electric Company (United States)
Dennis R. Morgan, General Electric Company (United States)
Published in SPIE Proceedings Vol. 0564:
Real-Time Signal Processing VIII
Keith Bromley; William J. Miceli, Editor(s)
© SPIE. Terms of Use
