8000 Is there interest in an alternative FFT implementation supporting Bluestein's algorithm for near-prime sizes? · Issue #11885 · numpy/numpy · GitHub
[go: up one dir, main page]

Skip to content
Is there interest in an alternative FFT implementation supporting Bluestein's algorithm for near-prime sizes? #11885
Closed
@mreineck

Description

@mreineck

If there is interest, I could provide an FFT library implemented in C99 that is based on fftpack, but falls back to Bluestein's algorithm for near-prime lengths. Accuracy should also be better than the original fftpack.

You can have a look at the code at https://gitlab.mpcdf.mpg.de/mtr/pocketfft

I can contribute this under the 3-clause BSD license, but I haven't added the necessary file headers yet.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions

      0