Content area

Abstract

Translate

The aim of this paper is to present a new fast-convergent numerically stable space-time adaptive processing (STAP) algorithm derived using a novel technique of feedback orthogonalization. The main advantages of this approach lie in its perfected stability to computational errors and faults which makes its real-time implementation on substantially faster and cheaper regular fixed-point processors possible.

Details

1009240
Subject
Feedback;
Adaptive algorithms;
Space-time adaptive processing
URL
http://arxiv.org/abs/1008.4160
Title
Fast Stable STAP Algorithms Based on Feedback Orthogonalization
Author
Khlebnikov, Vasily A; Kristian Zarb Adami
Publication title
arXiv.org; Ithaca
Publication year
2010
Publication date
Aug 24, 2010
Section
Astrophysics
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
Publication subject
Biology, Statistics, Physics, Mathematics, Engineering--Electrical Engineering, Computers--Computer Engineering, Business And Economics--Banking And Finance
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2010-08-26
Milestone dates
2010-08-24 (Submission v1)
Publication history
 
 
   First posting date
26 Aug 2010
ProQuest document ID
2087483412
Document URL
https://www.proquest.com/working-papers/fast-stable-stap-algorithms-based-on-feedback/docview/2087483412/se-2?accountid=208611
Full text outside of ProQuest
http://arxiv.org/abs/1008.4160
Copyright
© 2010. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2023-03-03
Database
ProQuest One Academic