We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://oi-wiki.org/math/poly/fft/
其中对于蝴蝶变换的描述有误,所描述的操作应为位逆序置换,而标题的蝴蝶变换(蝶形运算)一般为乘以旋转因子的运算。
The text was updated successfully, but these errors were encountered:
能给个 ref 吗…… 好像搜不到位逆序置换……
Sorry, something went wrong.
https://en.wikipedia.org/wiki/Bit-reversal_permutation 可能这个。。
Bit-reversal permutation - Wikipedia
唔……
搜“位逆序排列”也搜不到……
直接留英文好了……
唔…… 搜“位逆序排列”也搜不到…… 直接留英文好了……
Bit-reversal permutation
Merge pull request #2874 from sshwy/fft2
03b238b
Update(math/poly/fft & basic/greedy): fix #2219 #2820
Successfully merging a pull request may close this issue.
我正在访问这个页面(最好带链接)
https://oi-wiki.org/math/poly/fft/
我发现页面有这样的问题
其中对于蝴蝶变换的描述有误,所描述的操作应为位逆序置换,而标题的蝴蝶变换(蝶形运算)一般为乘以旋转因子的运算。
The text was updated successfully, but these errors were encountered: