mirror of https://github.com/FFmpeg/FFmpeg.git
out[lut[i]] = in[i] lookups were 4.04 times(!) slower than out[i] = in[lut[i]] lookups for an out-of-place FFT of length 4096. The permutes remain unchanged for anything but out-of-place monolithic FFT, as those benefit quite a lot from the current order (it means there's only 1 lookup necessary to add to an offset, rather than a full gather). The code was based around non-power-of-two FFTs, so this wasn't benchmarked early on.pull/371/head
parent
9ddaf0c9f0
commit
8e94b7cff0
3 changed files with 8 additions and 5 deletions
Loading…
Reference in new issue