1992
DOI: 10.1016/0888-3270(92)90071-p
|View full text |Cite
|
Sign up to set email alerts
|

The block sum transformation—A new special discrete fourier transformation method for the analysis of vibrations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0

Year Published

1993
1993
2004
2004

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…It was shown [5] that the results of the Fourier transformation of the added functions and that of the whole time function is the same, only the frequency discretisation di!er:…”
Section: Block Sum Transformationmentioning
confidence: 97%
See 2 more Smart Citations
“…It was shown [5] that the results of the Fourier transformation of the added functions and that of the whole time function is the same, only the frequency discretisation di!er:…”
Section: Block Sum Transformationmentioning
confidence: 97%
“…Initially the measured time-discrete, block sum transformed values were processed with the Fourier transformation [5]. The whole measuring interval ¹ is divided into time segments of duration ¹*, where ¹/¹* is an integer number (Fig.…”
Section: Block Sum Transformationmentioning
confidence: 99%
See 1 more Smart Citation
“…In vector notation,x = Fx, where F is the (unitary) n × n Fourier matrix, x is the n-dimensional timedomain vector, andx is the DFT of x. The block sum transformation proposed in [1] allows the computation of a subset of the samplesx i of the DFT, but uses the m-dimensional vector y defined by…”
mentioning
confidence: 99%
“…Clearly, this is equivalent to the block sum transformation proposed by Bourchard et al [1]. Using the second Boncelet algorithm, which can be applied whenever n is a multiple of 4, this transformation could be further improved from the computational point of view.…”
mentioning
confidence: 99%