How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm? | 学就创题库

题库实习信息校招公告参访活动

单选题

How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?

A.

(N/2)logN

B.

2Nlog₂N

C.

(N/2)log₂N

D.

Nlog₂N

上一题

[单选题] What is the Fourier transform of the signal x(n)=a|n|, |a|<1?

下一题

[问答题] 一家游戏公司开发的Android端游戏APK，经常被非法二次打包，然后出现破解版。现在你作为刚上任的安全工程师...

题目信息

校招真题

-

正确率

0

评论

18

点击

收藏已收藏

错题本已加入错题本

我的笔记

登录添加笔记