2009 16th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2009) 2009
DOI: 10.1109/icecs.2009.5410865
|View full text |Cite
|
Sign up to set email alerts
|

Generation of FARIMA(0,α,0) sequences by recursive filtering: Testing for self-similarity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…FARIMA with symmetric α-stable (SαS) innovations model based fractional processes have both the heavy tailed distribution and LRD properties, where the heavy-tailed distribution and the LRD properties are also characterized by the Hurst parameter H and the heavy tailedness parameter α [28]. The Hurst parameter H of FARIMA with SαS innovation time series can be described as H = d + 1/α [15], where d(d < 1 − 1/α) is the fractional differencing exponent.…”
Section: Effects On Farima With Stable Innovations Processesmentioning
confidence: 99%
“…FARIMA with symmetric α-stable (SαS) innovations model based fractional processes have both the heavy tailed distribution and LRD properties, where the heavy-tailed distribution and the LRD properties are also characterized by the Hurst parameter H and the heavy tailedness parameter α [28]. The Hurst parameter H of FARIMA with SαS innovation time series can be described as H = d + 1/α [15], where d(d < 1 − 1/α) is the fractional differencing exponent.…”
Section: Effects On Farima With Stable Innovations Processesmentioning
confidence: 99%
“…The proposed approach was recently used to develop computationally efficient algorithm for generation of fractal signals with β f / 1 -power spectra [12][13][14]. The sequences thus generated have been shown to exhibit the long-range dependence feature [15,16]. The main advantage of this approach is that it allows recursive implementation of the convolution sum defining GARMA(0, α, υ, 0) processes and thus provides considerable savings in memory requirements and great reduction in computation time per output generated sample.…”
Section: Introductionmentioning
confidence: 98%