{"id":20418683,"url":"https://github.com/stefan-zobel/fft","last_synced_at":"2025-09-24T06:31:54.269Z","repository":{"id":93562864,"uuid":"335937032","full_name":"stefan-zobel/FFT","owner":"stefan-zobel","description":"Fast Fourier transform (FFT) using the Cooley–Tukey algorithm for power-of-two sizes and Bluestein's algorithm for non-power-of-two sizes.","archived":false,"fork":false,"pushed_at":"2022-12-19T14:14:48.000Z","size":26,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-11-15T06:35:57.236Z","etag":null,"topics":["bluestein","fast-fourier-transform","fft","fft-algorithm","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/stefan-zobel.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-02-04T11:44:55.000Z","updated_at":"2024-09-18T11:45:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"dc05d61f-b450-43c3-bd1a-ef68a9786b63","html_url":"https://github.com/stefan-zobel/FFT","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stefan-zobel%2FFFT","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stefan-zobel%2FFFT/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stefan-zobel%2FFFT/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stefan-zobel%2FFFT/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stefan-zobel","download_url":"https://codeload.github.com/stefan-zobel/FFT/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":234048088,"owners_count":18771474,"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","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":["bluestein","fast-fourier-transform","fft","fft-algorithm","java"],"created_at":"2024-11-15T06:34:17.765Z","updated_at":"2025-09-24T06:31:53.962Z","avatar_url":"https://github.com/stefan-zobel.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![CodeQL](https://github.com/stefan-zobel/FFT/actions/workflows/codeql.yml/badge.svg)](https://github.com/stefan-zobel/FFT/actions/workflows/codeql.yml)\n\n# FFT\n\nFast Fourier transform (FFT) using the Cooley-Tukey algorithm for power-of-two sizes and Bluestein's algorithm for non-power-of-two sizes.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstefan-zobel%2Ffft","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstefan-zobel%2Ffft","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstefan-zobel%2Ffft/lists"}