{"id":17360643,"url":"https://github.com/certik/ffte","last_synced_at":"2026-02-13T14:19:32.616Z","repository":{"id":35487497,"uuid":"39756824","full_name":"certik/ffte","owner":"certik","description":"FFTE: A Fast Fourier Transform Package (Official tarballs are unpacked into master as commits)","archived":false,"fork":false,"pushed_at":"2024-02-17T22:47:11.000Z","size":130,"stargazers_count":11,"open_issues_count":0,"forks_count":4,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-03-27T16:35:37.790Z","etag":null,"topics":["fast-fourier-transform","fft","fortran","gpu-acceleration","high-performance-computing","parallel-computing"],"latest_commit_sha":null,"homepage":"http://www.ffte.jp/","language":"Fortran","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/certik.png","metadata":{"files":{"readme":"readme.txt","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2015-07-27T05:33:16.000Z","updated_at":"2025-02-24T19:55:51.000Z","dependencies_parsed_at":"2024-12-06T12:34:48.892Z","dependency_job_id":null,"html_url":"https://github.com/certik/ffte","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/certik/ffte","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/certik%2Fffte","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/certik%2Fffte/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/certik%2Fffte/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/certik%2Fffte/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/certik","download_url":"https://codeload.github.com/certik/ffte/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/certik%2Fffte/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272219715,"owners_count":24894474,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-26T02:00:07.904Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["fast-fourier-transform","fft","fortran","gpu-acceleration","high-performance-computing","parallel-computing"],"created_at":"2024-10-15T19:26:59.623Z","updated_at":"2026-02-13T14:19:27.578Z","avatar_url":"https://github.com/certik.png","language":"Fortran","funding_links":[],"categories":[],"sub_categories":[],"readme":"FFTE: A Fast Fourier Transform Package\n\nDescription:\n    A package to compute Discrete Fourier Transforms of\n    1-, 2- and 3- dimensional sequences of length (2^p)*(3^q)*(5^r).\n\nFiles:\n    cuzfft1d.f : 1-D complex FFT routine (for NVIDIA GPUs)\n    cuzfft2d.f : 2-D complex FFT routine (for NVIDIA GPUs)\n    cuzfft3d.f : 3-D complex FFT routine (for NVIDIA GPUs)\n    cuztrans.f : Transposition routine (for NVIDIA GPUs)\n    dzfft2d.f  : 2-D real-to-complex FFT routine\n    dzfft3d.f  : 3-D real-to-complex FFT routine\n    factor.f   : Factorization routine\n    fft235.f   : Radix-2,3,4,5 and 8 FFT routine\n    kernel.f   : Radix-2,3,4,5 and 8 FFT kernel routine\n    mfft235.f  : Radix-2,3,4,5 and 8 multiple FFT routine\n    param.h    : Header file for parameters\n    readme.txt : Readme file\n    vzfft1d.f  : 1-D complex FFT routine (for vector machines)\n    vzfft2d.f  : 2-D complex FFT routine (for vector machines)\n    vzfft3d.f  : 3-D complex FFT routine (for vector machines)\n    zdfft2d.f  : 2-D complex-to-real FFT routine\n    zdfft3d.f  : 3-D complex-to-real FFT routine\n    zfft1d.f   : 1-D complex FFT routine\n    zfft2d.f   : 2-D complex FFT routine\n    zfft3d.f   : 3-D complex FFT routine\n    tests/     : Test Directory\n        Makefile      : Makefile for test programs\n        Makefile.cuda : Makefile for test programs (for NVIDIA GPUs)\n        Makefile.vec  : Makefile for test programs (for vector machines)\n        cuspeed1d.f   : Speed test program for zfft1d (for NVIDIA GPUs)\n        cuspeed2d.f   : Speed test program for zfft2d (for NVIDIA GPUs)\n        cuspeed3d.f   : Speed test program for zfft3d (for NVIDIA GPUs)\n        cutest1d.f    : Test program for zfft1d (for NVIDIA GPUs)\n        cutest2d.f    : Test program for zfft2d (for NVIDIA GPUs)\n        cutest3d.f    : Test program for zfft3d (for NVIDIA GPUs)\n        rspeed2d.f    : Speed test program for dzfft2d\n        rspeed3d.f    : Speed test program for dzfft3d\n        rtest2d.f     : Test program for dzfft2d and zdfft2d\n        rtest3d.f     : Test program for dzfft3d and zdfft3d\n        speed1d.f     : Speed test program for zfft1d\n        speed2d.f     : Speed test program for zfft2d\n        speed3d.f     : Speed test program for zfft3d\n        test1d.f      : Test program for zfft1d\n        test2d.f      : Test program for zfft2d\n        test3d.f      : Test program for zfft3d\n    mpi/        : MPI version Directory\n        pcuzfft1d.f  : Parallel 1-D complex FFT routine (for NVIDIA GPUs)\n        pcuzfft2d.f  : Parallel 2-D complex FFT routine (for NVIDIA GPUs)\n        pcuzfft3d.f  : Parallel 3-D complex FFT routine (for NVIDIA GPUs)\n        pcuzfft3dv.f : Parallel 3-D complex FFT routine (with 2-D decomposition, for NVIDIA GPUs)\n        pdzfft2d.f   : Parallel 2-D real-to-complex FFT routine\n        pdzfft3d.f   : Parallel 3-D real-to-complex FFT routine\n        pdzfft3dv.f  : Parallel 3-D real-to-complex FFT routine (with 2-D decomposition)\n        pfactor.f    : Parallel factorization routine\n        pvzfft1d.f   : Parallel 1-D complex FFT routine (for vector machines)\n        pvzfft2d.f   : Parallel 2-D complex FFT routine (for vector machines)\n        pvzfft3d.f   : Parallel 3-D complex FFT routine (for vector machines)\n        pzdfft2d.f   : Parallel 2-D complex-to-real FFT routine\n        pzdfft3d.f   : Parallel 3-D complex-to-real FFT routine\n        pzdfft3dv.f  : Parallel 3-D complex-to-real FFT routine (with 2-D decomposition)\n        pzfft1d.f    : Parallel 1-D complex FFT routine\n        pzfft2d.f    : Parallel 2-D complex FFT routine\n        pzfft3d.f    : Parallel 3-D complex FFT routine\n        pzfft3dv.f   : Parallel 3-D complex FFT routine (with 2-D decomposition)\n        tests/       : Test Directory\n            Makefile      : Makefile for test programs\n            Makefile.cuda : Makefile for test programs (for NVIDIA GPUs)\n            Makefile.vec  : Makefile for test programs (for vector machines)\n            pcuspeed1d.f  : Speed test program for pzfft1d (for NVIDIA GPUs)\n            pcuspeed2d.f  : Speed test program for pzfft2d (for NVIDIA GPUs)\n            pcuspeed3d.f  : Speed test program for pzfft3d (for NVIDIA GPUs)\n            pcuspeed3dv.f : Speed test program for pzfft3dv (for NVIDIA GPUs)\n            pcutest1d.f   : Test program for pzfft1d (for NVIDIA GPUs)\n            pcutest2d.f   : Test program for pzfft2d (for NVIDIA GPUs)\n            pcutest3d.f   : Test program for pzfft3d (for NVIDIA GPUs)\n            pcutest3dv.f  : Test program for pzfft3dv (for NVIDIA GPUs)\n            prspeed2d.f   : Speed test program for pdzfft2d\n            prspeed3d.f   : Speed test program for pdzfft3d\n            prspeed3dv.f  : Speed test program for pdzfft3dv\n            prtest2d.f    : Test program for pdzfft2d and pzdfft2d\n            prtest3d.f    : Test program for pdzfft3d and pzdfft3d\n            prtest3dv.f   : Test program for pdzfft3dv and pzdfft3dv\n            pspeed1d.f    : Speed test program for pzfft1d\n            pspeed2d.f    : Speed test program for pzfft2d\n            pspeed3d.f    : Speed test program for pzfft3d\n            pspeed3dv.f   : Speed test program for pzfft3dv\n            ptest1d.f     : Test program for pzfft1d\n            ptest2d.f     : Test program for pzfft2d\n            ptest3d.f     : Test program for pzfft3d\n            ptest3dv.f    : Test program for pzfft3dv\n\nReferences:\n    1. Daisuke Takahashi: A Blocking Algorithm for FFT on Cache-Based\n       Processors, Proc. 9th International Conference on High\n       Performance Computing and Networking Europe (HPCN Europe 2001),\n       Lecture Notes in Computer Science, Vol. 2110, pp. 551-554,\n       Springer (2001).\n\n    2. Daisuke Takahashi: A Blocking Algorithm for Parallel 1-D FFT on\n       Shared-Memory Parallel Computers, Proc. 6th International\n       Conference on Applied Parallel Computing (PARA 2002),\n       Lecture Notes in Computer Science, Vol. 2367, pp. 380-389,\n       Springer (2002).\n\n    3. Daisuke Takahashi: Efficient implementation of parallel\n       three-dimensional FFT on clusters of PCs, Computer Physics\n       Communications, Vol. 152, pp. 144-150, (2003).\n\n    4. Daisuke Takahashi: A parallel 1-D FFT algorithm for the Hitachi\n       SR8000, Parallel Computing, Vol. 29, pp. 679-690 (2003).\n\n    5. Daisuke Takahashi: A Hybrid MPI/OpenMP Implementation of a\n       Parallel 3-D FFT on SMP Clusters, Proc. 6th International\n       Conference on Parallel Processing and Applied Mathematics\n       (PPAM 2005), Lecture Notes in Computer Science, Vol. 3911,\n       pp. 970-977, Springer (2006).\n\n    6. Daisuke Takahashi: An Implementation of Parallel 3-D FFT with\n       2-D Decomposition on a Massively Parallel Cluster of Multi-core\n       Processors, Proc. 8th International Conference on Parallel\n       Processing and Applied Mathematics (PPAM 2009), Part I,\n       Workshop on Memory Issues on Multi- and Manycore Platforms,\n       Lecture Notes in Computer Science, Vol. 6067, pp. 606-614,\n       Springer (2010).\n\n    7. Daisuke Takahashi: Implementation of Parallel 1-D FFT on GPU\n       Clusters, Proc. 2013 IEEE 16th International Conference on\n       Computational Science and Engineering (CSE 2013), pp. 174-180\n       (2013).\n\n    8. Daisuke Takahashi: Implementation of Parallel 3-D Real FFT with\n       2-D Decomposition on Intel Xeon Phi Clusters, Proc. 13th\n       International Conference on Parallel Processing and Applied\n       Mathematics (PPAM 2019), Part I, Lecture Notes in Computer\n       Science, Vol. 12043, pp. 151-161, Springer (2020).\n\nCopyright:\n    Copyright(C), 2000-2004, 2008-2014, 2020, Daisuke Takahashi\n    Center for Computational Sciences\n    University of Tsukuba\n    1-1-1 Tennodai, Tsukuba, Ibaraki 305-8577, Japan\n    e-mail: daisuke@cs.tsukuba.ac.jp\n    You may use, copy, modify this code for any purpose (include\n    commercial use) and without fee.\n    You may distribute this ORIGINAL package.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcertik%2Fffte","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcertik%2Fffte","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcertik%2Fffte/lists"}