A continuous-time speech signal xa(t) is sampled at a rate of 8kHz and the samples are subsequently grouped in blocks, each of size N. The DFT of each block is to be computed in real time using the radix-2 decimation-in-frequency FFT algorithm. If the processor performs all operations sequentially, and takes 20μs for computing each complex multiplication (including multiplications by 1 and −1) and the time required for addition/subtraction is negligible, then the maximum value of N is _________View answerShowHide
Answer: 4096:4096
Worked explanation not available yet.
Free practice · Your answers on this page are not saved.