1994
DOI: 10.1049/ip-vis:19949646
|View full text |Cite
|
Sign up to set email alerts
|

Fast orthogonal search for array processing and spectrum estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…The fast orthogonal search (FOS) algorithm [8], [9], [13], [14] is a nonlinear technique that allows fitting of a time series y(n), of length N, to a functional expansion of arbitrary functions p m (n). The functional expansion is given by…”
Section: Fos Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The fast orthogonal search (FOS) algorithm [8], [9], [13], [14] is a nonlinear technique that allows fitting of a time series y(n), of length N, to a functional expansion of arbitrary functions p m (n). The functional expansion is given by…”
Section: Fos Algorithmmentioning
confidence: 99%
“…The fast orthogonal search (FOS) algorithm has been shown to have a better (smaller) frequency resolution than the FFT [6]- [9]. Thus, FOS can maintain the same frequency resolution as the FFT, while using a shorter time series.…”
Section: Introductionmentioning
confidence: 99%
“…However, the latter method has computational complexity and storage requirement dependent upon the square of the number of candidate terms that are searched, while in FOS the dependence is reduced to a linear relationship. In addition FOS and/or iterative forms [44 -47] of FOS have been used for high-resolution spectral analysis [42,45,47,48], direction finding [44,45], constructing generalized single-layer networks [46], and design of two-dimensional filters [49], among many applications. Wu et al [50] have compared FOS with canonical variate analysis for biological applications.…”
Section: Parallel Cascade Identificationmentioning
confidence: 99%
“…It was also applied to model clean and noisy time series data using non-Fourier sinusoidal series representation [2]. An iterative version of FOS (IFOS) [6] was also developed and applied to the problem of estimating the temporal frequencies of narrow-band signals in noise. Chon [7] employed the FOS algorithm to detect sinusoidal components buried in noise and observed in physiological signals such as heart rate and renal blood pressure and flow data.…”
Section: Introductionmentioning
confidence: 99%
“…(phone: +2 (02) 413-5457; fax: +2 (02) 418-6945; email: h.abbas@ieee.org.) minimum in the MSE as a function of the parameter estimates [6]. Evolutionary methods [8], [9], on the other hand, are population based algorithms which are modeled loosely on the principles of the evolution via natural selection.…”
Section: Introductionmentioning
confidence: 99%