Q.45 A continuous-time speech signal 
is sampled at a rate of 8 kHz 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-infrequency 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 ______
Answer: (8)
Explanation:
