原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
ltiplication, we have shown the following about the convolution a ⊗ b of vectors a and b:
Theorem 30.8 (Convolution theorem) For any two vectors a and b of length n, where n is an exact power of 2, where the vectors a and b are padded with 0s to length 2n and · denotes the componentwise product of two 2n-element vectors.
▪ Exercises 30.2-1 Prove Corollary 30.4. 30.2-2 Compute the DFT of the vector (0, 1, 2, 3
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea