知识卡片
单位根平方把规模减半
当n为偶数时,n个n次单位根平方后只得到n/2个互异的n/2次单位根,每个出现两次。FFT把偶次与奇次系数分别求值时,正靠这个重合把两个递归问题各缩到一半。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第30章 多项式与快速傅里叶变换 · 查看原书依据
Lemma 30.5 (Halving lemma) If n > 0 is even, then the squares of the n complex nth roots of unity are the n/2 complex (n/2)th roots of unity. Proof By the cancellation lemma, for any nonnegative integer k. Squaring all of the complex nth roots of unity produces each (n/2)th root of unity exactly twice, since Thus and have the same square. We could also have used Corollary 30.4
参考来源
- 位置:《算法导论(第4版)》第30章《多项式与快速傅里叶变换》(OEBPS/chapter030.xhtml,文本字符[15000,20000))。
- 结论依据:原文定义单位根、DFT、FFT递归、逆变换与电路;相关公式和图已核对。
- 原始内容:Lemma 30.5 (Halving lemma) If n > 0 is even, then the squares of the n complex n th roots of unity are the n /2 complex ( n /2)th roots of unity. Proof By the cancellation lemma, for any nonnegative integer k . Squaring all of the complex n th roots of unity produces each ( n /2)th root of unity exactly twice, since Thus and have the same square. We could also have used Corollary 30.4