数字信号处理（全英文）答案2023秋

第五章测试

1.The straightforward implementation of the DFT is of higher efficiency, and FFT is not necessary.（ ）
A:对 B:错
答案:B
2.To compute the 256-point DFT by means of direct implementation, we need （ ） complex multiplications.
A:256×256 B:256×255 C:256 D:128×8 3.DFT is the realization method of Fourier Transform theoretically.
（ ）
A:对 B:错 4.

FFT becomes realization method of Fourier Transform theoretically.（ ）

A:对 B:错 5.One butterfly operation unit needs （ ）.
A:2 complex multiplication and 2 complex additions B:2 complex multiplication and 1 complex additions C:1 complex multiplication and 2 complex additions D:1 complex multiplication and 1 complex additions 6.The forms of basic butterfly unit for DIT-FFT and DIF-FFT algorithms are different.（ ）
A:错 B:对 7.For the DIF-FFT algorithm with radix-2, the input in the complete flow graph is of bit-reversed decimal index, and the output is of normal-order decimal index. （ ）
A:对 B:错 8.N-Point FFTs of two real sequences can be implemented using the N-point FFT of a single complex sequence.（ ）
A:对 B:错 9.IFFT algorithms can be implemented by the small changes in FFT Flow Graph.（ ）
A:错 B:对 10.IFFT algorithms can be implemented by adding pretreatment and posttreatment of FFT.（ ）
A:错 B:对