登陆题目详情
单选题 Supposed that the time of a complex multiplication is 
, and assuming that the total time of DFT operation is determined by the time of calculating all multiplications, then the time of calculating a 1024-point DFT directly is ( )
学科：默认课程
时间：2026-05-19 04:49:17
相关题目
相关作业
题目1多选题
To calculate DFT by FFT algorithm, the number of complex multiplication is ( ), and the number of complex addition is ( )A. <img src="https://tihai-oss-cloud.itihey.com/img/31d7270531e523b2f81d978c0451f2c0.png">B. <img src="https://tihai-oss-cloud.itihey.com/img/2d297e57571d0afeafb0c30f16793b89.png">C. <img src="https://tihai-oss-cloud.itihey.com/img/54ad568343bd73413aacc0b9e3c639a6.png">D. <img src="https://tihai-oss-cloud.itihey.com/img/aad45840a62ee53567a9cdc1bbf3735b.png">
题目2多选题
The ways that DFT calculates linear convolution by FFT algorithm are( )A. Overlap -addB. Overlap -subtractC. Overlap -divisionD. Overlap- save
题目3单选题
Generally, the ( ) sequence of decimation-in-time Radix- 2FFT is rearranged in Bit-reversed OrderA. InputB. OutputC. Input and output
题目4单选题
The number of complex multiplications to calculate the N-point DFT directly is proportional to ( )A. <img src="https://tihai-oss-cloud.itihey.com/img/322609aae59ff4b124f9a2e24de4fa8a.png">B. <img src="https://tihai-oss-cloud.itihey.com/img/7caa53f9529bfd32eee773290c3e0772.png">C. <img src="https://tihai-oss-cloud.itihey.com/img/83574a935c5b1bcbe60b27b763f3b49a.png">D. <img src="https://tihai-oss-cloud.itihey.com/img/f579dedf31e1db04f6ed87195ca95480.png">
题目5单选题
Supposed that the time of a complex multiplication is <img src="https://tihai-oss-cloud.itihey.com/img/d67a9145fd7012b845ded8a15362f758.png">, and assuming that the total time of DFT operation is determined by the time of calculating all multiplications, then the time of calculating a 1024-point DFT directly is ( )A. 1.05sB. 1.5sC. 2.05sD. 1.0s
题目6单选题
The length of the sequence <img src="https://tihai-oss-cloud.itihey.com/img/e1f9adf229f6193b63cccc32b46b8cea.png">is <img src="https://tihai-oss-cloud.itihey.com/img/ce04d84526571d74abc3ca1c629d45e9.png">, sampling points <img src="https://tihai-oss-cloud.itihey.com/img/665c4a1b5ecd5830dcb332751d048734.png"> in frequency domain, When reconstruct the original sequence using these frequency domain samples <img src="https://tihai-oss-cloud.itihey.com/img/f04bffd0d50d71de762446d39c0fc823.png">, which problem will occur ? ( )A. Spectrum leakageB. Time domain aliasingC. Spectrum aliasingD. Inter-spectrum interference
题目7单选题
How many complex multiplications are needed to calculate 256-point DFT of sequence <img src="https://tihai-oss-cloud.itihey.com/img/e1f9adf229f6193b63cccc32b46b8cea.png">? ( )A. 256B. 256×256C. 256×255D. 128×8
题目8单选题
As shown in figure, the symbol of operation flow graph is butterfly graph of ( ) Radix-2 FFT algorithm.<img src="https://tihai-oss-cloud.itihey.com/img/569c2285a7a0ed25708bd59256f0568d.png">A. decimation-in- frequencyB. decimation-in-timeC. Both A and B are rightD. Both A and B are wrong
题目9单选题
Regardless of the particularity of some rotation factors, generally, the number of complex multiplications and complex additions required for a butterfly operation of a Radix-2 FFT algorithm are ( ) respectivelyA. 1 and 2B. 1 and 1C. 2 and 1D. 2 and 2
题目10单选题
In the FFT operation flow chart of decimation-in-time with <img src="https://tihai-oss-cloud.itihey.com/img/847d3ed5e456dab358628395cbcd122f.png">, ( ) stages of butterfly operation are needed from<img src="https://tihai-oss-cloud.itihey.com/img/e1f9adf229f6193b63cccc32b46b8cea.png">to<img src="https://tihai-oss-cloud.itihey.com/img/f04bffd0d50d71de762446d39c0fc823.png">A. 4B. 5C. 6D. 3
下载 题海APP
拍照搜题更快捷
- 海量题库
- 无搜索限制
- 快捷拍照搜题
