2014
DOI: 10.15446/ing.investig.v34n3.41943
|View full text |Cite
|
Sign up to set email alerts
|

Two algorithms for estimating the period of a discrete signal

Abstract: In this paper, we present two algorithms for approximating a period given a discrete data set. These algorithms superimpose two consecutive sections of the data for several candidate periods. The first algorithm counts the number of shuffling points per candidate period, whereas the second algorithm computes a distance between points when sorted by time. The best candidate period maximizes the number of shuffling points in the first algorithm, whereas the second algorithm minimizes the distance between points.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…The second algorithm, ∆f , compares two consecutive sections of a signal with length t N , and chooses as the estimated period the t N that produces the smallest variation among sections. The third algorithm, ∆S, similar to the previous algorithm, also compared two sections, but proposes as period the t N that maximizes the number of data points shuffling data points of the first section, according to the explanation in [8].…”
Section: Error Analysismentioning
confidence: 99%
“…The second algorithm, ∆f , compares two consecutive sections of a signal with length t N , and chooses as the estimated period the t N that produces the smallest variation among sections. The third algorithm, ∆S, similar to the previous algorithm, also compared two sections, but proposes as period the t N that maximizes the number of data points shuffling data points of the first section, according to the explanation in [8].…”
Section: Error Analysismentioning
confidence: 99%