Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Efficient Two-Dimensional-FFT Program


    Contributors:
    Miko, J. (author)

    Published in:

    Publication date :

    1992-10-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Efficient Two-Dimensional ARX Modeling

    Glentis, G.-O. / Slump, C. H. / Herrmann, O. E. et al. | British Library Conference Proceedings | 1994



    Efficient and all-dimensional windscreen wiper

    CHEN YU | European Patent Office | 2015

    Free access

    Thermal, One-Dimensional Analyzer Program

    Patel, D. K. / Jones, D. P. | NTRS | 1986