Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/41117
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2019-03-11T13:42:28Z-
dc.date.available2019-03-11T13:42:28Z-
dc.date.issued2010-
dc.identifier.citationKhlebnikov, V. A., & Adami, K. Z. (2010). Fast stable STAP algorithms based on feedback orthogonalization. arXiv preprint arXiv:1008.4160, 1-4en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/41117-
dc.description.abstractThe 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.en_GB
dc.language.isoenen_GB
dc.publisherCornell Universityen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectAstrophysics -- Researchen_GB
dc.subjectAstronomyen_GB
dc.subjectSpace and timeen_GB
dc.titleFast stable STAP algorithms based on feedback orthogonalizationen_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holderen_GB
dc.description.reviewedN/Aen_GB
dc.contributor.creatorKhlebnikov, Vasily A.-
dc.contributor.creatorZarb Adami, Kristian-
Appears in Collections:Scholarly Works - FacSciPhy

Files in This Item:
File Description SizeFormat 
Fast_stable_STAP_algorithms_based_on_feedback.pdf429.44 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.