原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
chema in Figure 30.4. Let’s think about the permutation that rearranges the input vector.
The order in which the leaves appear in Figure 30.5 is a bit-reversal permutation. That is, letting rev(k) be the lg n-bit integer formed by reversing the bits of the binary representation of k, then vector element ak moves to position rev(k). In Figure 30.5, for example, the leaves appear in the order 0, 4, 2, 6, 1, 5, 3, 7. This sequence in
binary is 000, 100, 010, 110, 001, 101, 011, 111, and you can obtain it by reversing the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea