Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISSPA.2007.4555482
DC FieldValue
dc.titlePropagation of orthogonality error for FRANS algorithm
dc.contributor.authorYang, L.
dc.contributor.authorAttallah, S.
dc.contributor.authorMathew, G.
dc.contributor.authorAbed-Meraim, K.
dc.date.accessioned2014-06-19T03:24:35Z
dc.date.available2014-06-19T03:24:35Z
dc.date.issued2007
dc.identifier.citationYang, L.,Attallah, S.,Mathew, G.,Abed-Meraim, K. (2007). Propagation of orthogonality error for FRANS algorithm. 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings : -. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ISSPA.2007.4555482" target="_blank">https://doi.org/10.1109/ISSPA.2007.4555482</a>
dc.identifier.isbn1424407796
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71514
dc.description.abstractIn this paper, we analyze the propagation of orthogonality error for fast Rayleigh's quotient based adaptive noise subspace algorithm (FRANS). First, we examine the propagation of orthogonality error for the numerically unstable FRANS in the mean and in the mean-square sense. Then, numerically stable FRANS with Householder transformation (HFRANS) is studied through simulation as an improvement to FRANS. Numerical examples are provided to demonstrate the validity of the proposed error propagation models. ©2007 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISSPA.2007.4555482
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ISSPA.2007.4555482
dc.description.sourcetitle2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings
dc.description.page-
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.