Fast Stable STAP Algorithms Based on Feedback Orthogonalization
Gorde:
| Argitaratua izan da: | arXiv.org (Aug 24, 2010), p. n/a |
|---|---|
| Egile nagusia: | |
| Beste egile batzuk: | |
| Argitaratua: |
Cornell University Library, arXiv.org
|
| Gaiak: | |
| Sarrera elektronikoa: | Citation/Abstract Full text outside of ProQuest |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2087483412 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2087483412 | ||
| 045 | 0 | |b d20100824 | |
| 100 | 1 | |a Khlebnikov, Vasily A | |
| 245 | 1 | |a Fast Stable STAP Algorithms Based on Feedback Orthogonalization | |
| 260 | |b Cornell University Library, arXiv.org |c Aug 24, 2010 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a 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. | |
| 653 | |a Feedback | ||
| 653 | |a Adaptive algorithms | ||
| 653 | |a Space-time adaptive processing | ||
| 700 | 1 | |a Kristian Zarb Adami | |
| 773 | 0 | |t arXiv.org |g (Aug 24, 2010), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2087483412/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1008.4160 |