Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

    Computing Cumulative Number of Failures Using the Fast Fourier Transform

    New search for: Ramasamy, Deivaraja

    Predictive calculations of the accumulated number of failing parts during the ramp-up of mass production are reasonably straightforward. However, such estimations increase in the order of computational complexity as the resolution of data points increases. This paper provides an approach using the FFT algorithm to accelerate such computations.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Computing Cumulative Number of Failures Using the Fast Fourier Transform

    New search for: Ramasamy, Deivaraja

    Predictive calculations of the accumulated number of failing parts during the ramp-up of mass production are reasonably straightforward. However, such estimations increase in the order of computational complexity as the resolution of data points increases. This paper provides an approach using the FFT algorithm to accelerate such computations.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Computing Cumulative Number of Failures Using the Fast Fourier Transform

    New search for: Ramasamy, Deivaraja

    Predictive calculations of the accumulated number of failing parts during the ramp-up of mass production are reasonably straightforward. However, such estimations increase in the order of computational complexity as the resolution of data points increases. This paper provides an approach using the FFT algorithm to accelerate such computations.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Document information
    Title:

    Computing Cumulative Number of Failures Using the Fast Fourier Transform

    Additional title:

    J. Inst. Eng. India Ser. B

    Contributors:

    Ramasamy, Deivaraja (author)

    Published in:

    Journal of The Institution of Engineers (India): Series B ; 102 ; 465-467

    Publication date:

    2021-06-01

    Size:

    3 pages

    ISSN:

    2250-2114 , 2250-2106

    DOI:

    https://doi.org/10.1007/s40031-021-00565-x

    Type of media:

    Article (Journal)

    Type of material:

    Electronic Resource

    Language:

    English

    Keywords:

    Failure rate , FFT , Fourier transform , Convolution Engineering , Communications Engineering, Networks

    Similar titles

    Diskrete Fourier-Transformation und Fast Fourier Transform

    Petersen, Christian / Werkle, Horst | Springer Verlag | 2017

    Fast fourier transform using the PDP-11

    Windmiller, L. R. / Ketterson, J. B. / Shaw, J. C. | TIBKAT | 1972

    Probability Analysis Method Using Fast Fourier Transform

    Mori, Y. / Sakamoto, J. / Sekioka, T. et al. | British Library Conference Proceedings | 1996

    Probability analysis method using Fast Fourier transform and its application

    Sakamoto, J. / Mori, Y. / Sekioka, T. | British Library Online Contents | 1997

    Pulsed Photoacoustic Inspection of Metals Using the Fast Fourier Transform

    Korobov, A. I. / Odina, N. I. | British Library Online Contents | 1998

    Back to top